Keyboard shortcuts

Press ← or → to navigate between chapters

Press S or / to search in the book

Press ? to show this help

Press Esc to hide this help

C. Bibliographie

[1]: The General Sieve Kernel and New Records in Lattice Reduction. Martin R. Albrecht, Léo Ducas, Gottfried Herold, Elena Kirshanova, Eamonn W. Post-lethwaite, and Marc Stevens. In Yuval Ishai and Vincent Rijmen, editors, EUROCRYPT 2019, Part II, volume 11477 of LNCS, pages 717–746. Springer, Cham, mai 2019.

[2]: Référentiel Général de Sécurité, Annexe B2, Gestion des clés cryptographiques, ANSSI, 2012.

[3]: Guide de sélection d’algorithmes cryptographiques. ANSSI, 1.0 edition, 2021.

[4]: Recommandations relatives à l’authentification multifacteur et aux mots de passe. ANSSI, 2.0 edition, 2021.

[5]: Duplicate Signature Key Selection Attack in Let’s Encrypt. Andrew Ayer, 2015.

[6]: Optimal Asymmetric Encryption. Mihir Bellare and Philipp Rogaway. In Proceedings of Eurocrypt 1994, volume 839 of LNCS, pages 92–111. Springer-Verlag, 1994.

[7]: Multi-Ciphersuite Security of the Secure Shell (SSH) Protocol. Florian Bergsma, Benjamin Dowling, Florian Kohlar, Jörg Schwenk, and Douglas Stebila. In Gail-Joon Ahn, Moti Yung, and Ninghui Li, editors, ACM CCS 2014, pages 369–381. ACM Press, novembre 2014.

[8]: Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS #1. Daniel Bleichenbacher. In Proceedings of Crypto 1998, volume 1462 of LNCS, pages 1–12. Springer, 1998.

[9]: Daniel Bleichenbacher. Crypto Rump Session, 2006.

[10]: Functionality Classes and Evaluation Methodology for Physical Random Number Generators. BSI. Technical Report AIS31 Version 4, 2025.

[11]: Reduction from Sparse LPN to LPN, Dual Attack 3.0. Kévin Carrier, Thomas Debris-Alazard, Charles Meyer-Hilfiger, and Jean-Pierre Tillich. In Marc Joye and Gregor Leander, editors, EUROCRYPT 2024, Part VII, volume 14657 of LNCS, pages 286–315. Springer, Cham, mai 2024.

[12]: Lattice Sieving via Quantum Random Walks. André Chailloux and Johanna Loyer. In Mehdi Tibouchi and Huaxiong Wang, editors, ASIACRYPT 2021, Part IV, volume 13093 of LNCS, pages 63–91. Springer, Cham, décembre 2021.

[13]: Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities. Don Coppersmith. Journal of Cryptology, 10(4) :233–260, septembre 1997.

[14]: BUFFing signature schemes beyond unforgeability and the case of post-quantum signatures. Cas Cremers, Samed Düzlü, Rune Fiedler, Marc Fischlin, and Christian Janson. In 2021 IEEE Symposium on Security and Privacy, pages 1696–1714. IEEE Computer Society Press, mai 2021.

[15]: New directions in cryptography. Whitfield Diffie and Martin Hellman. IEEE Transactions on Information Theory, 22(6) :644–654, 1976.

[16]: Hide-and-Seek and the Non-resignability of the BUFF Transform. Jelle Don, Serge Fehr, Yu-Hsuan Huang, Jyun-Jie Liao, and Patrick Struck. In Elette Boyle and Mohammad Mahmoody, editors, TCC 2024, Part III, volume 15366 of LNCS, pages 347–370. Springer, Cham, décembre 2024.

[17]: On the (In)Security of the BUFF Transform. Jelle Don, Serge Fehr, Yu-Hsuan Huang, and Patrick Struck. In Leonid Reyzin and Douglas Stebila, editors, CRYPTO 2024, Part I, volume 14920 of LNCS, pages 246–275. Springer, Cham, août 2024.

[18]: Shortest Vector from Lattice Sieving: A Few Dimensions for Free. Léo Ducas. In Jesper Buus Nielsen and Vincent Rijmen, editors, EUROCRYPT 2018, Part I, volume 10820 of LNCS, pages 125–145. Springer, Cham, avril / mai 2018.

[19]: Does the Dual-Sieve Attack on Learning with Errors Even Work? Léo Ducas and Ludo N. Pulles. In Helena Handschuh and Anna Lysyanskaya, editors, CRYPTO 2023, Part III, volume 14083 of LNCS, pages 37–69. Springer, Cham, août 2023.

[20]: Secure Integration of Asymmetric and Symmetric Encryption Schemes. Eiichiro Fujisaki and Tatsuaki Okamoto. In Michael J. Wiener, editor, CRYPTO’99, volume 1666 of LNCS, pages 537–554. Springer, Berlin, Heidelberg, août 1999.

[21]: Secure Integration of Asymmetric and Symmetric Encryption Schemes. Eiichiro Fujisaki and Tatsuaki Okamoto. Journal of Cryptology, 26(1) :80–101, janvier 2013.

[22]: Probabilistic Encryption. Shafi Goldwasser and Silvio Micali. Journal of Computer and System Sciences, 28(2) :270–299, 1984.

[23]: A Fast Quantum Mechanical Algorithm for Database Search. Lov K. Grover. In 28th ACM STOC, pages 212–219. ACM Press, mai 1996.

[24]: Fournitures nécessaires à l’analyse de mécanismes cryptographiques Secrétariat général de la défense nationale. 2006.

[25]: Seems Legit: Automated Analysis of Subtle Attacks on Protocols that Use Signatures. Dennis Jackson, Cas Cremers, Katriel Cohn-Gordon, and Ralf Sasse. In Lorenzo Cavallaro, Johannes Kinder, XiaoFeng Wang, and Jonathan Katz, editors, ACM CCS 2019, pages 2165–2180. ACM Press, novembre 2019.

[26]: Bitcoin Transaction Malleability Evan Klitzke. 2017.

[27]: Worst-case to average-case reductions for module lattices. Adeline Langlois and Damien Stehlé. DCC, 75(3):565–599, 2015.

[28]: Report on the Security of LWE : Improved Dual Lattice Attack MATZOV, avril 2022.

[29]: Recommandation for Random Number Generation Using Deterministic Random Bit Generators. NIST. Technical Report Special Publication 800-90A, Revision 1, U.S. Department of Commerce, Washington, D.C., 2015.

[30]: On lattices, learning with errors, random linear codes, and cryptography. Oded Regev. In Harold N. Gabow and Ronald Fagin, editors, 37th ACM STOC, pages 84–93. ACM Press, mai 2005.

[31]: A hierarchy of polynomial time lattice basis reduction algorithms. C.P. Schnorr. Theoretical Computer Science, 53(2), 1987.

[32]: Algorithms for Quantum Computation: Discrete Logarithms and Factoring. Peter W. Shor. In 35th FOCS, pages 124–134. IEEE Computer Society Press, novembre 1994.

[33]: The First Collision for Full SHA-1. Marc Stevens, Elie Bursztein, Pierre Karpman, Ange Albertini, and Yarik Markov. In Jonathan Katz and Hovav Shacham, editors, CRYPTO 2017, Part I, volume 10401 of LNCS, pages 570–596. Springer, Cham, août 2017.