Anzeige
Erschienen in:
2016 | OriginalPaper | Buchkapitel
Cryptography Based on Really Hard Problems
verfasst von : Nigel P. Smart
Erschienen in: Cryptography Made Simple
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.