My list of publications is also available from DBLP or Google Scholar.

Guest Editor

[1] J.-C. Faugère, J. Gutierrez, D. Gómez-Pérez, and Ludovic Perret. Mathematical and Computer Algebra Techniques in Cryptology, volume 64. Elsevier, Journal of Symbolic Computation, November 2013.
[2] J.-C. Faugère and L. Perret. Symbolic Computation and Cryptography, volume 3. Birkhäuser and Springer, Mathematics in Computer Science, 2010.
[3] D. Augot, J.-C. Faugère, and L. Perret. Gröbner Bases Techniques in Coding Theory and Cryptography, volume 44. Academic Press, Inc., Journal of Symbolic Computation, 2009.
[4] M. Sala, T. Mora, L. Perret, S. Sakata, and C. Traverso. Gröbner Bases, Coding, and Cryptography. Springer, 2009.

Book Chapter

[5] M. Sala, T. Mora, L. Perret, S. Sakata, and C. Traverso. Gröbner Bases, Coding, and Cryptography. Springer, 2009.

International Journal Papers

[6] O. Chakraborty, J.-C. Faugère, and L. Perret. Cryptanalysis of the Extension Field Cancellation cryptosystem. Des. Codes Cryptogr., 89(6):1335--1364, 2021.
[7] M. Bender, J.-C. Faugère, L. Perret, and E. Tsigaridas. A nearly optimal algorithm to decompose binary forms. J. Symb. Comput., 105:71--96, 2021.
[8] M. Conde Pena, R. Durán Díaz, J.-C. Faugère, L. Hernández Encinas, and L. Perret. Non-quantum cryptanalysis of the noisy version of Aaronson-Christiano's quantum money scheme. IET Inf. Secur., 13(4):362--366, 2019.
[9] J.-C. Faugère, L. Perret, and J. Ryckeghem. Software toolkit for HFE-based multivariate schemes. IACR Trans. Cryptogr. Hardw. Embed. Syst., 2019(3):257--304, 2019.
[10] J.-C. Faugère, A. Otmani, L. Perret, Frédéric de Portzamparc, and Jean-Pierre Tillich. Structural cryptanalysis of McEliece schemes with compact keys. Des. Codes Cryptogr., 79(1):87--112, 2016.
[11] M. R. Albrecht, J.-C. Faugère, P. Farshim, G. Herold, and L. Perret. Polly Cracker, revisited. Des. Codes Cryptography, 79(2):261--302, 2016.
[12] J. Berthomieu, J.-C. Faugère, and L. Perret. Polynomial-Time Algorithms for Quadratic Isomorphism of Polynomials: The Regular Case. Journal of Complexity, (1--39):39, 2015.
[13] J.-C. Faugère, A. Otmani, L. Perret, Frédéric de Portzamparc, and Jean-Pierre Tillich. Folding alternant and goppa codes with non-trivial automorphism groups. IEEE Transactions on Information Theory, 62(1):184--198, 2016.
[14] N. Fazio, K. Iga, A. Nicolosi, L. Perret, and W. E. Skeith III. Hardness of learning problems over Burnside groups of exponent 3. Des. Codes Cryptography, 75(1):59--70, 2015.
[15] J.-C. Faugère, A. Otmani, L. Perret, F. De Portzamparc, and J.-P. Tillich. Structural cryptanalysis of Mceliece schemes with compact keys. Designs, Codes and Cryptography, pages 87--112, January 2016.
[16] M. Albrecht, C. Cid, J.-C. Faugère, R. Fitzpatrick, and L. Perret. On the complexity of the BKW algorithm on LWE. Designs, Codes and Cryptography, 74(2):325--354, July 2015.
[17] J.-C. Faugère, V. Gauthier-Umana, A. Otmani, L. Perret, and Jean-Pierre Tillich. A distinguisher for high rate Mceliece cryptosystems. IEEE Transactions on Information Theory, 59(10):6830--6844, June 2013.
[18] L. Bettale, J.-C. Faugère, and L. Perret. Cryptanalysis of HFE, Multi-HFE and variants for odd and even characteristic. Designs, Codes and Cryptography, 69(1):1 -- 52, 2013.
[19] J.-C. Faugère, D. Lin, L. Perret, and T. Wang. On enumeration of polynomial equivalence classes and their application to MPKC. Finite Fields and Their Applications, 18(2):283 -- 302, 2012.
[20] M. Albrecht, C. Cid, J.-C. Faugère, and L. Perret. On the relation between the MXL family of algorithms and Gröbner basis algorithms. Journal of Symbolic Computation, 47(8):926--941, 2012.
[21] L. Bettale, J.-C. Faugère, and L. Perret. Hybrid approach for solving multivariate systems over finite fields. Journal of Mathematical Cryptology, 3(3):177--197, 2010.
[22] J.-C. Faugère and L. Perret. An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography. Journal of Symbolic Computation, 44(12):1676--1689, 2009.
[23] F. Levy-dit Vehel and L. Perret. Security analysis of word problem-based cryptosystems. Des. Codes Cryptography, 54(1):29--41, 2010.
[24] F. Levy-dit Vehel and L. Perret. A polly cracker system based on satisfiability. Progress in Computer Science and Applied Logic, 23:177--192, 2004.

Fully Refereed International Conferences Papers with Proceedings (Rank A+ or A)

[25] M. Bender, J.-C. Faugère, L. Perret, and E. Tsigaridas. A superfast randomized algorithm to decompose binary forms. In Sergei A. Abramov, Eugene V. Zima, and Xiao-Shan Gao, editors, Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2016, Waterloo, ON, Canada, July 19-22, 2016, pages 79--86. ACM, 2016.
[26] M. Conde Pena, J.-C. Faugère, and L. Perret. Algebraic cryptanalysis of a quantum money scheme : the noise-free case. In IACR International Conference on Practice and Theory of Public-Key Cryptography (PKC'15), Maryland, United States, March 2015.
[27] J.-C. Faugère, D. Gligoroski, L. Perret, S. Samardjiska, and E. Thomae. A polynomial-time key-recovery attack on MQQ cryptosystems. In IACR International Conference on Practice and Theory of Public-Key Cryptography (PKC'15), Maryland, United States, March 2015.
[28] J.-C. Faugère, L. Perret, and F. De Portzamparc. Algebraic attack against variants of Mceliece with Goppa polynomial of a special form. In Advances in Cryptology Asiacrypt 2014, Kaohsiung, Taïwan, September 2014.
[29] M. Albrecht, J.-C. Faugère, R. Fitzpatrick, and L. Perret. Lazy modulus switching for the BKW algorithm on LWE. In Hugo Krawczyk, editor, Public-Key Cryptography PKC 2014, volume 8383 of Lecture Notes in Computer Science, pages 429--445, Buenos Aires, Argentina, March 2014. Springer Berlin Heidelberg.
[30] M. Albrecht, J.-C. Faugère, R. Fitzpatrick, L. Perret, Y. Todo, and K. Xagawa. Practical cryptanalysis of a public-key encryption scheme based on new multivariate quadratic assumptions. In Hugo Krawczyk, editor, Public-Key Cryptography PKC 2014, volume 8383 of Lecture Notes in Computer Science, pages 446--464, Buenos Aires, Argentina, March 2014. Springer Berlin Heidelberg.
[31] J.-C. Faugère, L. Perret, C. Petit, and G. Renault. Improving the complexity of index calculus algorithms in elliptic curves over binary fields. In David Pointcheval and Thomas Johansson, editors, Advances in Cryptology EUROCRYPT 2012, volume 7237 of Lecture Notes in Computer Science, pages 27--44. Springer Berlin / Heidelberg, 2012.
[32] L. Bettale, J.-C. Faugère, and L. Perret. Solving polynomial systems over finite fields: Improved analysis of the hybrid approach. In Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC '12, pages 67--74, New York, NY, USA, 2012. ACM.
[33] M. Albrecht, J.-C. Faugère, P. Farshim, and L. Perret. Polly Cracker, revisited. In D.H. Lee and X. Wang, editors, Advances in Cryptology Asiacrypt 2011, volume 7073 of Lecture Notes in Computer Science, pages 179--196. Springer Berlin / Heidelberg, 2011.
[34] L. Bettale, J.-C. Faugère, and L. Perret. Cryptanalysis of multivariate and odd-characteristic HFE variants. In D. Catalano et al., editor, Public Key Cryptography - PKC 2011, volume 6571 of Lecture Notes in Computer Science, pages 441--458. Springer-Verlag, 2011.
[35] C. Bouillaguet, J.-C. Faugère, P.-A. Fouque, and L. Perret. Practical cryptanalysis of the identification scheme based on the isomorphism of polynomial with one secret problem. In D. Catalano et al., editor, Public Key Cryptography - PKC 2011, volume 6571 of Lecture Notes in Computer Science, pages 1--12. Springer-Verlag, 2011.
[36] J.-C. Faugère, J. von zur Gathen, and L. Perret. Decomposition of generic multivariate polynomials. In ISSAC '10: Proceedings of the 2010 international symposium on Symbolic and algebraic computation, ISSAC '10, pages 131--137, New York, NY, USA, 2010. ACM.
[37] J.-C. Faugère, A. Otmani, L. Perret, and J.-P. Tillich. Algebraic cryptanalysis of McEliece variants with compact keys. In Proceedings of Eurocrypt 2010, volume 6110 of Lecture Notes in Computer Science, pages 279--298. Springer Verlag, 2010.
[38] J.-C. Faugère and L. Perret. High order derivatives and decomposition of multivariate polynomials. In ISSAC '09: Proceedings of the 2009 international symposium on Symbolic and algebraic computation, ISSAC '09, pages 207--214, New York, NY, USA, 2009. ACM.
[39] J.-C. Faugère, F. Levy-dit Vehel, and L. Perret. Cryptanalysis of MinRank. In David Wagner, editor, Advances in Cryptology CRYPTO 2008, volume 5157 of Lecture Notes in Computer Science, pages 280--296, Berlin, Heidelberg, August 2008. Springer-Verlag.
[40] P.-A. Fouque, G. Macariorat, L. Perret, and J. Stern. On the security of the -IC signature scheme. In Public Key Cryptography, 4th International Workshop on Practice and Theory in Public Key Cryptography, PKC 2008, volume 4939 of Lecture Notes in Computer Science, pages 1--17. Springer, 2008.
[41] M. Sugita, M. Kawazoe, L. Perret, and H. Imai. Algebraic cryptanalysis of 58-round SHA-1. In Alex Biryukov, editor, Fast Software Encryption, 14th International Workshop, FSE 2007, Luxembourg, Luxembourg, March 26-28, 2007, Revised Selected Papers, volume 4593 of Lecture Notes in Computer Science, pages 349--365. Springer, 2007.
[42] J.-C. Faugère and L. Perret. Cryptanalysis of 2R- schemes. In Cynthia Dwork, editor, Advances in Cryptology - CRYPTO 2006, volume 4117 of Lecture Notes in Computer Science, pages 357--372. Springer Berlin / Heidelberg, August 2006.
[43] J.-C. Faugère and L. Perret. Polynomial equivalence problems: Algorithmic and theoretical aspects. In Serge Vaudenay, editor, Advances in Cryptology - EUROCRYPT 2006, volume 4004 of Lecture Notes in Computer Science, pages 30--47. Springer Berlin / Heidelberg, 2006.
[44] L. Perret. A fast cryptanalysis of the isomorphism of polynomials with one secret problem. In Ronald Cramer, editor, Advances in Cryptology - EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22-26, 2005, Proceedings, volume 3494 of Lecture Notes in Computer Science, pages 354--370. Springer, 2005.

Fully Refereed International Conferences Papers with Proceedings (Rank B or C)

[45] L. Bettale, D. Kahrobaei, L. Perret, and J. A. Verbel. Biscuit: New MPCITH signature scheme from structured multivariate polynomials. ACNS'24.
[46] C. Battarbee, D. Kahrobaei, L. Perret, and Siamak F. Shahandashti. SPDH-sign: Towards efficient, post-quantum group-based signatures. In Thomas Johansson and Daniel Smith-Tone, editors, Post-Quantum Cryptography - 14th International Workshop, PQCrypto 2023, College Park, MD, USA, August 16-18, 2023, Proceedings, volume 14154 of Lecture Notes in Computer Science, pages 113--138. Springer, 2023.
[47] W. Beullens, J.-C. Faugère, E. Koussa, G. Macario-Rat, J. Patarin, and L. Perret. PKP-based signature scheme. In Feng Hao, Sushmita Ruj, and Sourav Sen Gupta, editors, Progress in Cryptology - INDOCRYPT 2019 - 20th International Conference on Cryptology in India, Hyderabad, India, December 15-18, 2019, Proceedings, volume 11898 of Lecture Notes in Computer Science, pages 3--22. Springer, 2019.
[48] E. Koussa, J.-C. Faugère, G. Macario-Rat, J. Patarin, and L. Perret. Combinatorial digital signature scheme. In Marie-Rita Hojeij, Béatrice Finance, Yehia Taher, Karine Zeitouni, Rafiqul Haque, and Mohamed Dbouk, editors, Proceedings of the 1st International Conference on Big Data and Cyber-Security Intelligence, BDCSIntell 2018, Hadath, Lebanon, December 13-15, 2018, volume 2343 of CEUR Workshop Proceedings, pages 48--54. CEUR-WS.org, 2018.
[49] J.-C. Faugère and L. Perret. The quantum-safe revolution. In Dooho Choi and Sylvain Guilley, editors, Information Security Applications - 17th International Workshop, WISA 2016, Jeju Island, Korea, August 25-27, 2016, Revised Selected Papers, volume 10144 of Lecture Notes in Computer Science, pages 258--266, 2016.
[50] J.-C. Faugère, L. Perret, F. De Portzamparc, A. Otmani, and J.-P. Tillich. Structural weakness of compact variants of the Mceliece cryptosystem. In IEEE International Symposium on Information Theory - ISIT 2014, pages 1717--1721, Honolulu, United States, June 2014. [ bib | http ]
[51] J.-C. Faugère, D. Gligoroski, E. Jensen, R. Odegard, L. Perret, S. Johan Knapskog, and S. Markovski. MQQ-SIG. In Liqun Chen, Moti Yung, and Liehuang Zhu, editors, Trusted Systems - The Third International Conference on Trusted Systems - INTRUST 2011, volume 7222 of Lecture Notes in Computer Science, pages 184--203. Springer Verlag, 2012.
[52] J.-C. Faugère, V. Gauthier-Umana, A. Otmani, L. Perret, and J.-P. Tillich. A Distinguisher for High Rate McEliece Cryptosystems. In Information Theory Workshop (ITW), 2011 IEEE, pages 282--286, October 2011.
[53] F. Armknecht, D. Augot, L. Perret, and A.-R. Sadeghi. On constructing homomorphic encryption schemes from coding theory. In Liqun Chen, editor, Cryptography and Coding - 13th IMA International Conference, IMACC 2011, Oxford, UK, December 12-15, 2011. Proceedings, volume 7089 of Lecture Notes in Computer Science, pages 23--40. Springer, 2011.
[54] M. Albrecht, C. Cid, T. Dulien, J.-C. Faugère, and L. Perret. Algebraic precomputations in differential cryptanalysis. In M. Yung and X. Lai, editors, Information Security and Cryptology: 6th International Conference, Inscrypt 2010, Revised Selected Papers, volume 6584, pages 1--18. Springer-Verlag, October 2010.
[55] L. Bettale, J.-C. Faugère, and L Perret. Cryptanalysis of the TRMS cryptosystem of PKC'05. In Serge Vaudenay, editor, AfricaCrypt 2008, volume 5023 of Lecture Notes in Computer Science, pages 143--155, Casablanca, Morocco, 2008. Springer.
[56] L. Bettale, J.-C. Faugère, and L. Perret. Security analysis of multivariate polynomials for hashing. In Moti Yung, Dongdai Lin, and Peng Liu, editors, Information Security and Cryptology: 4th International Conference, Inscrypt 2008, Revised Selected Papers, volume 5487, pages 115--124, Berlin, Heidelberg, December 2009. Springer-Verlag.
[57] J.-C. Faugère, A. Joux, L. Perret, and J. Treger. Cryptanalysis of the hidden matrix cryptosystem. In Michel Abdalla and Paulo Barreto, editors, Progress in Cryptology, LATINCRYPT 2010, volume 6212 of Lecture Notes in Computer Science, pages 241--254. Springer Berlin / Heidelberg, 2010.
[58] J.-C. Faugère, R. Odegard, L. Perret, and D. Gligoroski. Analysis of the MQQ public key cryptosystem. In Swee-Huay Heng, Rebecca N. Wright, and Bok-Min Goi, editors, Ninth International Conference on Cryptology And Network Security (CANS 2010), volume 6467 of Security and Cryptology, pages 1--14. Springer-Verlag, December 2010.
[59] J.-C. Faugère and L. Perret. Algebraic cryptanalysis of Curry and Flurry using correlated messages. In M. Yung and F. Bao, editors, Information Security and Cryptology: 5th International Conference, Inscrypt 2009, Beijing, China, December, 2009, Revised Selected Papers, volume 6151, pages 266--277, Berlin, Heidelberg, 2010. Springer-Verlag.
[60] F. Levy dit Vehel and L. Perret. On the wagner-magyarik cryptosystem. In Selected papers of WCC 2005 Conference, volume 3969, pages 316--329. Springer-Verlag, 2005.
[61] Françoise Levy-dit-Vehel and Ludovic Perret. Attacks on public key cryptosystems based on free partially commutative monoids and groups. In Anne Canteaut and Kapalee Viswanathan, editors, Progress in Cryptology - INDOCRYPT 2004, 5th International Conference on Cryptology in India, Chennai, India, December 20-22, 2004, Proceedings, volume 3348 of Lecture Notes in Computer Science, pages 275--289. Springer, 2004.
[62] Françoise Levy-dit-Vehel and Ludovic Perret. Polynomial equivalence problems and applications to multivariate cryptosystems. In Thomas Johansson and Subhamoy Maitra, editors, Progress in Cryptology - INDOCRYPT 2003, 4th International Conference on Cryptology in India, New Delhi, India, December 8-10, 2003, Proceedings, volume 2904 of Lecture Notes in Computer Science, pages 235--251. Springer, 2003.

Fully Refereed International Conferences Papers (no proceeding)

[63] C. Battarbee, D. Kahrobaei, L. Perret and S.~F. Shahandashti. A subexponential quantum algorithm for the semidirect discrete logarithm problem. NIST Fourth PQC Standardization Conference (virtual conference), 2022
[64] M. Albrecht, C. Cid, J.-C. Faugère, R. Fitzpatrick, and L. Perret. On the complexity of the Arora-Ge algorithm against LWE. In SCC '12: Proceedings of the 3nd International Conference on Symbolic Computation and Cryptography, pages 93--99, Castro-Urdiales, Spain, July 2012.
[65] M. Albrecht, Carlos Cid, J.-C. Faugère, R. Fitzpatrick, and L. Perret. On the complexity of BKW algorithm against LWE. In SCC'12: Proceedings of the 3nd International Conference on Symbolic Computation and Cryptography, pages 100--107, Castro-Urdiales, Spain, July 2012.
[66] M. Albrecht, C. Cid, T. Dulien, J.-C. Faugère, and L. Perret. Algebraic precomputations in differential cryptanalysis. In Tools'10: Proceedings of the Workshop on Tools for Cryptanalysis 2010, pages 1--14, RHUL, England, June 2010.
[67] L. Bettale, J.-C. Faugère, and L. Perret. Hybrid approach : a tool for multivariate cryptography. In Tools'10: Proceedings of the Workshop on Tools for Cryptanalysis 2010, pages 1--2, RHUL, England, June 2010.
[68] J.-C. Faugère, R. Odegard, L. Perret, and D. Gligoroski. Analysis of the MQQ public key cryptosystem. In SCC'10: Proceedings of the 2nd International Conference on Symbolic Computation and Cryptography, pages 101--116, RHUL, England, June 2010.
[69] J.-C. Faugère, A Otmani, L. Perret, and J.-P. Tillich. Algebraic cryptanalysis of McEliece variants with compact keys -- toward a complexity analysis. In P. Véron, editor, Yet Another Conference on Cryptography, YACC 2010, pages 1--4, Toulon, France, 2010.
[70] J.-C. Faugère, A Otmani, L. Perret, and J.-P. Tillich. A distinguisher for high rate mceliece cryptosystem -- extended abstract. In P. Véron, editor, Yet Another Conference on Cryptography, YACC 2010, pages 1--4, Toulon, France, 2010.
[71] J.-C. Faugère, A Otmani, L. Perret, and J.-P. Tillich. Algebraic cryptanalysis of McEliece variants with compact keys -- toward a complexity analysis. In SCC '10: Proceedings of the 2nd International Conference on Symbolic Computation and Cryptography, pages 45--55, RHUL, England, June 2010.
[72] J.-C. Faugère and L. Perret. On the security of UOV. In First International Conference on Symbolic Computation and Cryptography, SCC 08, LMIB, pages 103--109, Beijing, China, April 2008.
[73] J.-C. Faugère and L. Perret. High order derivatives and decomposition of multivariate polynomials. In Second Workshop on Mathematical Cryptology, pages 15--19, Santander, Spain, October 2008.
[74] J.-C. Faugère, L. Perret, and P.-J. Spaenlehauer. Algebraic-differential cryptanalysis of DES. In Western European Workshop on Research in Cryptology - WEWoRC 2009, pages 1--5, Graz, Austria, July 2009.
[75] I. Simonetti, J.-C. Faugère, and L. Perret. Algebraic attack against trivium. In First International Conference on Symbolic Computation and Cryptography, SCC 08, LMIB, pages 95--102, Beijing, China, April 2008.

Patent

[76] L. Perret and J.-C. Faugère. Mise en oeuvre optimisée du HFE, January 2017.

Software

[77] J.-C. Faugère, L. Perret, and J. Ryckeghem. MQSoft, A fast multivariate cryptography library.

Standardisation documents

[78] ETSI CYBER QSC (L. Perret, rapporteur). Quantum-Safe Signatures. Technical Report TR 103 616, ETSI, 2021.
[79] W. Beullens, J.-C. Faugère, X. Han, D. Lin, E. Koussa, G. Macario-Rat, J. Patarin, and L. Perret. PKPDSS : A Submission to the Chinese post-quantum Competition, 2019.
[80] O. Chakraborty, J.-C. Faugère, and L. Perret. CFPKM : A key encapsulation mechanism based on solving system of non-linear multivariate polynomials, 2017. A submission to the NIST round-1 post-quantum submission process.
[81] J.-C. Faugère, L. Perret, and J. Ryckeghem. DualModeMS: A dual mode for multivariate-based signature, 2017. A submission to the NIST post-quantum submission process.
[82] A. Casanova, J.-C. Faugère, G. Macario-Rat, J. Patarin, L. Perret, and J. Ryckeghem. GeMSS : A Great Multivariate Short Signature, 2017. A submission to the NIST post-quantum submission process.

PhD/HDR

[83] L. Perret. Groebner bases in quantum-safe cryptographyy. Habilitation thesis, Sorbonne University, 2016.
[84] L. Perret. Algebraic and combinatorial tools for public-key cryptography. PhD thesis, Université de Marne-la-Vallé, 2005.

Preprints

[85] C. Battarbee, D. Kahrobaei, L. Perret and S ~F. Shahandashti. SPDH-sign: towards efficient, post-quantum group-based signatures. Cryptology ePrint Archive, Paper 2023/595, 2023 (accepted at PQC'2023).
[86] J.-C Faugère, G. Macario Rat, J. Patarin, and L. Perret. A new perturbation for multivariate public key schemes such as HFE and UOV. Cryptology ePrint Archive, Paper 2022/203, 2022.
[87] J.-C. Faugère, K. Horan, D. Kahrobaei, M. Kaplan, E. Kashefi, and L. Perret. Fast quantum algorithm for solving multivariate quadratic equations. IACR Cryptol. ePrint Arch., page 1236, 2017.
[88] M. R. Albrecht, C. Cid, J.-C Faugère, R. Fitzpatrick, and L. Perret. Algebraic algorithms for LWE problems. IACR Cryptology ePrint Archive, 2014:1018, 2014.
[89] J.-C. Faugère, L. Perret, C. Petit, and G. Renault. New subexponential algorithms for factoring in SL(2, Fq). IACR Cryptology ePrint Archive, 2011:598, 2011.

Dissemination

[90] R. Grimes, E. Chiu, J. Gable, B. Huttner and L. Perret. Practical preparations for the post-quantum world. Cloud Security Alliance, QSS WG white paper, 2021.
[91] R. Faux and L. Perret. Confidence in post-quantum algorithms. Cloud Security Alliance, QSS WG white paper, 2021.
[92] ATARC Quantum Working Group. White Paper : Quantum-safe framework. An intra and inter-agency guide to being quantum ready. ATARC white paper, 2021.
[93] ATARC Quantum Working Group. Applied quantum computing for today’s military. ATARC white paper, 2021.
[94] R. Faux and L. Perret. Mitigating the quantum threat with hybrid cryptography. Cloud Security Alliance, QSS WG white paper, 2018.
[95] B. Huttner, J. Melia, L. Perret and L. Wilson. Applied quantum-safe security quantum-resistant algorithms and quantum-key distribution. Cloud Security Alliance, QSS WG white paper, 2017.
[96] B. Huttner, J. Melia, L. Perret and L. Wilson. Quantum-safe security glossary. Cloud Security Alliance, QSS WG white paper, 2017.