Answers are grounded in this paper and cite their sources.
resumably hard mathematical problems stand at the core of modern cryptography. A typical security proof for a cryptographic protocol relates its resistance against a particular attack to the hardness of some mathematical problem. Very few problems have survived thorough cryptanalysis, the most established ones being the integer factorization problem and the discrete logarithm problems on finite fields and elliptic curves. Other problems have been suggested, related, for example, to hyperelliptic curves, lattices [42], error-correcting codes They are currently less trusted than the three previous ones, but they might join or replace them in the future.
No takes yet. Share an insight, caveat, or question.
Petit et al. (2013) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: