Post-quantum Cryptography: An Introduction
Publisher
Springer Singapore
Reference29 articles.
1. Goldreich O (2000) Foundations of cryptography: basic tools. Cambridge University Press, New York
2. Shor PW (1994) Algorithms for quantum computation: discrete logarithms and factoring. In: 35th annual symposium on foundations of computer science, Santa Fe, New Mexico, USA, 20–22 Nov 1994, pp 124–134
3. Chen L, Jordan S, Liu YK, Moody D, Peralta R, Perlner R, Smith-Tone D. Report on post-quantum cryptography.
https://nvlpubs.nist.gov/nistpubs/ir/2016/nist.ir.8105.pdf
4. Ajtai M (1996) Generating hard instances of lattice problems (extended abstract). In: Proceedings of the twenty-eighth annual ACM symposium on theory of computing, STOC ’96
5. Matsumoto T, Imai H (1988) Public quadratic polynomial-tuples for efficient signature-verification and message-encryption. In: Advances in cryptology — EUROCRYPT ’88. Springer, Berlin, Heidelberg, pp 419–453