Cryptography
The Top Open Problems editorial order restricted to Computer Science, followed by cross-listed economics entries. Existing relative order is retained, with provisional placements for new game-learning questions; most entries have no individual difficulty assessment. About rankings
Browse by subject
Search this collection by problem ID, title, classification, subject, provider, or model.
Search results
No matching problems. Try another search or clear a filter.
38 records · Search and filter
- CS-6 One-way functions exist
- CS-27 Basing One-Way Functions on NP-Hardness
- CS-28 Existence of One-Way Permutations
- CS-38 Indistinguishability Obfuscation from Constant-Degree Homomorphic Assumptions
- CS-60 Classical Worst-Case Hardness Reduction for LWE
- CS-71 Worst-case to average-case hardness reduction for the Learning Parity with Noise problem
- CS-92 Discrete Logarithm Problem
- CS-190 Computational Diffie–Hellman problem
- CS-241 Regular-orbit equivalence and affine orbit-size certificates for SDLP
- CS-244 A one-round action barrier and leave-one-out multiparty key routing
- CS-246 Hidden Goppa presentations versus public-code decoding
- CS-247 Certificates for hidden Goppa structure and bounded decoding
- CS-255 The real cost of the CSIDH hidden-shift attack
- CS-256 Exact DDH leakage and sampler criteria for the CSIDH torsor
- CS-279 Computational Hardness of Learning Parity with Noise
- CS-295 Optimal Rates of Collusion-Secure Fingerprinting Codes
- CS-320 Witness Pseudorandom Functions from Witness Encryption
- CS-321 Reusable Garbled RAM under Weaker Assumptions
- CS-332 Consequences of Indistinguishability Obfuscation
- CS-340 Security of Interactive Lattice-Based Group Key Exchange
- CS-341 Assumptions and Function Classes for Function Secret Sharing
- CS-342 Round Complexity of Non-Malleable Commitments
- CS-343 Average-Case Hardness of Quasi-Cyclic Code Problems
- CS-434 Foundational Assumptions for Obfuscation, FHE, and SNARGs
- CS-516 Semantic leakage barriers for learned group cryptanalysis
- CS-519 An epimorphism audit for non-Hopfian cryptography
- CS-520 A fiber--leakage--arity audit for group-theoretic cryptographic building blocks
- CS-523 Torsion-image leakage and rigidity in SIDH
- CS-629 Semaev's Auxiliary Elliptic-Curve Index-Calculus Algorithm
- CS-679 Cryptographic Replacement of Pseudorandom Steganographic Functions
- CS-683 Optimal Fair Multiparty Coin Flipping
- CS-684 Depth-Independent Attribute-Based Encryption
- CS-687 Dimension Gaps in Lattice Reductions to Learning with Errors
- CS-699 Error-Free Multiparty Homomorphic Secret Sharing
- CS-700 Achievable Relations in Multi-Key Ciphertext Transformations
- CS-737 Average-Case Metacomplexity Characterizations of One-Way Functions
- CS-796 Evasive-LWE Research-Direction Discussion
- CS-797 Cryptographic Equivalences for High-Energy Phenomena