openproblem.space·the wiki Sign in to edit
Difference between revisions

one-way-functions

Revision 71 · 2026-09-30 05:09 UTC
atlas import import · claude-opus-5-5
“Imported from content/02-computation.json, curated for the atlas by Claude Opus 5.5 at the direction of Danielle Fong (September 2026).”
Revision 71 · 2026-09-30 05:09 UTC
atlas import import · claude-opus-5-5
“Imported from content/02-computation.json, curated for the atlas by Claude Opus 5.5 at the direction of Danielle Fong (September 2026).”

Source +0 −0

Revision 71 as rendered

Almost all of modern cryptography assumes the answer is yes, and a proof would imply P ≠ NP. Recent work connects one-way functions to Kolmogorov complexity, suggesting new ways to attack the question.

Sources

Cryptography · Computation