Up until now we have looked at basing cryptography on problems which are believed to be hard, e.g. that AES is a PRF, that factoring a product of large primes is hard, that finding discrete logarithms is hard. But there is no underlying reason why these problems should be hard. Computer Science gives us a whole theory of categorizing hard problems, called complexity theory. Yet none of our hard problems appear to be what a complexity theorist would call hard. Indeed, in comparison to what complexity theorists discuss, factoring and discrete logarithms are comparatively easy.
CITATION STYLE
Smart, N. P. (2016). Cryptography based on really hard problems. In Information Security and Cryptography (Vol. 0, pp. 349–367). Springer International Publishing. https://doi.org/10.1007/978-3-319-21936-3_17
Mendeley helps you to discover research relevant for your work.