References 1. M. Ajtai. »Generating Hard Instances of Lattice Problems (Extended Abstract)«. In: ACM Symposium on Theory of Computing—STOC ’96. ACM, 1996, pp. 99–108 (cit. on p. 26). 2. E. Alkim, N. Bindel, J. Buchmann, Ö. Daelen, and P. Schwabe. TESLA: Tightly-Secure Efficient Signatures from Standard Lattices. IACR Cryptology ePrint Archive, Report 2015/755. 2015 (cit. on p. 30). 3. E. Alkim, L. Ducas, T. Pöppelmann, and P. Schwabe. »Post-quantum Key Exchange—A New Hope«. In: Proceedings of the 25th USENIX Security Symposium. USENIX Association, 2016 (cit. on pp. 16, 30). 4. M. Amy, O. D. Matteo, V. Gheorghiu, M. Mosca, A. Parent, and J. Schanck. Estimating the Cost of Generic Quantum Pre-image Attacks on SHA2 and SHA3. arXiv:1603.09383. 2016 (cit. on pp. 15, 31). 5. D. Augot, M. Finiasz, and N. Sendrier.»A Family of Fast Syndrome Based Cryptographic Hash Functions«. In: Progress in Cryptology — Mycrypt 2005. Ed. by E. Dawson and S. Vaudenay. Vol. 3715. LNCS. Springer, 2005, pp. 64–83 (cit. on p. 28). 6. C. Berbain, H. Gilbert, and J. Patarin. »QUAD: A Practical Stream Cipher with Provable Security«. In: Advances in Cryptology — EUROCRYPT 2006. Ed. by S. Vaudenay. Vol. 4004. LNCS. Springer, 2006, pp. 109–128 (cit. on p. 35). 7. D. J. Bernstein. »Cost Analysis ofHash Collisions: Will Quantum Computers Make SHARCS Obsolete?«. In: Workshop Record of SHARCS’09: Special-purpose Hardware for Attacking Cryptographic Systems. 2009 (cit. on pp. 15, 31). 8. D. J. Bernstein, J. Buchmann, and E. Dahmen, eds. Post-Quantum Cryptography. ISBN: 978-3-540-88701-0. Springer, 2009 (cit. on pp. 57, 58). 9. D. J. Bernstein, D. Hopwood, A. Hülsing, T. Lange, R. Niederhagen, L. Papachristodoulou, M. Schneider, P. Schwabe, and Z. Wilcox-O’Hearn. »SPHINCS: Practical Stateless Hash-based Signatures«. In: Advances in Cryptology—EUROCRYPT 2015. Ed. by M. Fischlin and E. Oswald. Vol. 9056. LNCS. Springer, 2015, pp. 368–397 (cit. on p. 32). 10. D. J. Bernstein, T. Lange, and C. Peters. »Attacking and Defending the McEliece Cryptosystem«. In: Post-Quantum Cryptography—PQCrypto 2008. Ed. by J. Buchmann and J. Ding. Vol. 5299. LNCS. Springer, 2008, pp. 31–46 (cit. on p. 27). 11. C. Bouillaguet, C.M. Cheng, T. Chou, R. Niederhagen, and B.-Y. Yang. »Fast Exhaustive Search for Quadratic Systems in F2 on FPGAs«. In: Selected Areas in Cryptography—SAC 2013. Ed. by T. Lange, K. Lauter, and P. Lisonek. Vol. 8282. LNCS. Springer, 2013, pp. 205–222 (cit. on p. 34). 12. M. Braithwaite. Experimenting with Post-Quantum Cryptography. https://security .googleblog.com/2016/07/experimenting-with-post-quantum.html. 2016 (cit. on pp. 21, 30, 40).
PQC_for_Dummies
To see the actual publication please follow the link above