benchmarks.wiki

benchmarks.wiki / Public workspace

MMLU-Pro / 10382 / Many cryptographic protocols base their security on assumptions about the…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

question

Many cryptographic protocols base their security on assumptions about the computational difficulty of integer factorization. Integer factorization serves this purpose because we believe that

category

computer science

options

  1. testing primality is computationally intractable
  2. integer multiplication is a function whose inverse, factorization, remains difficult for a large class of inputs
  3. only prime numbers can be factored efficiently
  4. even if P = NP, integer factorization is still likely not to be polynomial-time computable
  5. P = NP
  6. integer factorization is a NP-complete problem
  7. integer multiplication is a function whose inverse, factorization, is easy for a large class of inputs
  8. all integers can be factored in polynomial time

src

ori_mmlu-college_computer_science

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

upstream_id / Original problem ID
10382
task_id
0200b621-0f55-5a61-8113-847cbe360eb4
task_key
default--test--10382
task_revision_id
1
config / split
default / test

Official source

initial import