benchmarks.wiki / Public workspace

MMLU / 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

choices

  1. integer multiplication is a function whose inverse, factorization, remains difficult for a large class of inputs
  2. P = NP
  3. even if P = NP, integer factorization is still likely not to be polynomial-time computable
  4. testing primality is computationally intractable

subject

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

Official source

initial import