Probabilities govern our day to day lives. Undoubtedly, we construct many of our judgments based on assumptions. A scientific example is the case of public-key encryption, where hardness assumptions are the main ingredient of provable security. But, while such clever mathematical ideas mesmerized both researchers and users since the 1970’s, a rather new assumption shakes the cryptographic world: the eventual construction of quantum computers. In this article, we provide the reader with a comprehensive overview regarding post-quantum cryptography. Compared to other well established surveys which underline the importance of designing post-quantum public-key cryptographic algorithms, we stress that symmetric key cryptography should receive the same amount of attention from the scientific community.
CITATION STYLE
Maimuţ, D., & Simion, E. (2019). Post-quantum cryptography and a (Qu)bit more. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11359 LNCS, pp. 22–28). Springer Verlag. https://doi.org/10.1007/978-3-030-12942-2_3
Mendeley helps you to discover research relevant for your work.