Latest Preprints

[1] 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. [ bib | http ]
[2] 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. [ bib | http ]

Guest Editor

[1] Jean-Charles Faugère, Jaime Gutierrez, Domingo Gómez-Pérez, and Ludovic Perret. Mathematical and Computer Algebra Techniques in Cryptology, volume 64. Elsevier, Journal of Symbolic Computation, November 2013. [ bib | DOI | http | .pdf ]
[2] J.-C. Faugère and L. Perret. Symbolic Computation and Cryptography, volume 3. Birkhäuser and Springer, Mathematics in Computer Science, 2010. [ bib | DOI | .pdf ]
[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. [ bib | DOI | .pdf ]
[4] M. Sala, T. Mora, L. Perret, S. Sakata, and C. Traverso. Gröbner Bases, Coding, and Cryptography. Springer, 2009. [ bib | http ]

Book Chapter

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

International Journal Papers

[1] Jean-Charles Faugère, Ayoub Otmani, Ludovic 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. [ bib | DOI | http ]
[2] 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. [ bib | DOI | http | .pdf ]
[3] Jérémy Berthomieu, Jean-Charles Faugère, and Ludovic Perret. Polynomial-Time Algorithms for Quadratic Isomorphism of Polynomials: The Regular Case. Journal of Complexity, (1-39):39, 2015. [ bib | http | .pdf ]
[4] Nelly Fazio, Kevin Iga, Antonio Nicolosi, Ludovic Perret, and William E. Skeith III. Hardness of learning problems over burnside groups of exponent 3. Des. Codes Cryptography, 75(1):59-70, 2015. [ bib | DOI | http ]
[5] 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, page 26, January 2015. [ bib | http | http ]
[6] 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. [ bib | DOI | http | .pdf ]
[7] 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. [ bib | DOI | http | .pdf ]
[8] 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. [ bib | DOI | http | .pdf ]
[9] 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. [ bib | DOI | .pdf ]
[10] 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. [ bib | DOI | .pdf ]
[11] F. Levy-dit Vehel and L. Perret. Security Analysis of Word Problem-Based Cryptosystems. Des. Codes Cryptography, 54(1):29-41, 2010. [ bib | DOI ]
[12] 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. [ bib | DOI | .pdf ]
[13] 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. [ bib ]

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

[1] 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. [ bib | http | http ]
[2] 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. [ bib | http | http ]
[3] 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. [ bib | http | .pdf ]
[4] 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. [ bib | http | .pdf ]
[5] 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. [ bib | http | .pdf ]
[6] 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. [ bib | .pdf ]
[7] Luk 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. [ bib | .pdf ]
[8] 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. [ bib | .pdf ]
[9] 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. [ bib | .pdf ]
[10] 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. [ bib | .pdf ]
[11] 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. [ bib | .pdf ]
[12] 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. [ bib | .pdf ]
[13] 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. [ bib | .pdf ]
[14] 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. [ bib | .pdf ]
[15] P.-A. Fouque, G. Macariorat, L. Perret, and J. Stern. On the Security of the l-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. [ bib ]
[16] M. Sugita, M. Kawazoe, L. Perret, and H. Imai. Algebraic Cryptanalysis of 58-Round SHA-1. In Biryukov [17], pages 349-365. [ bib ]
[17] 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. Springer, 2007. [ bib ]
[18] Jean-Charles 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. [ bib | .pdf ]
[19] 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. [ bib | .pdf ]
[20] L. Perret. A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem. In Cramer [21], pages 354-370. [ bib ]
[21] 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. Springer, 2005. [ bib ]

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

[1] 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 ]
[2] 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. [ bib | .pdf ]
[3] 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 To appear, pages 1-18. Springer-Verlag, October 2010. [ bib | .pdf ]
[4] 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. [ bib | DOI | .pdf ]
[5] 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. [ bib | .pdf ]
[6] 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. [ bib | DOI | .pdf ]
[7] 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. [ bib | DOI | .pdf ]
[8] 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. [ bib ]
[9] F. Levy dit Vehel and L. Perret. Attacks on public key cryptosystems based on free partially commutative monoids and groups. In Canteaut and Viswanathan [10], pages 275-289. [ bib ]
[10] 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. Springer, 2004. [ bib ]
[11] F. Levy dit Vehel and L. Perret. Polynomial equivalence problems and applications to multivariate cryptosystems. In Johansson and Maitra [12], pages 235-251. [ bib ]
[12] 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. Springer, 2003. [ bib ]

Fully Refereed International Conferences Papers (no Proceeding)

[1] M. Albrecht, C. Cid, J.-C. Faugère, Robert F., 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, July 2012. [ bib ]
[2] 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, July 2012. [ bib ]
[3] 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. [ bib | DOI ]
[4] 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. [ bib | DOI | .pdf ]
[5] Frederik Armknecht, Daniel Augot, Ludovic Perret, and Ahmad-Reza Sadeghi. On constructing homomorphic encryption schemes from coding theory. In Chen [6], pages 23-40. [ bib | DOI | http ]
[6] 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. Springer, 2011. [ bib | DOI | http ]
[7] 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, June 2010. Ecrypt II. [ bib | .pdf ]
[8] 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, June 2010. Ecrypt II. [ bib | .pdf ]
[9] 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, June 2010. [ bib | .pdf ]
[10] 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, June 2010. [ bib | .pdf ]
[11] 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, 2010. [ bib | .pdf ]
[12] 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, 2010. [ bib | .pdf ]
[13] 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, July 2009. [ bib | DOI | .pdf ]
[14] 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. [ bib ]
[15] 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. [ bib | .pdf ]
[16] 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. [ bib | .pdf ]

PhD Thesis

[1] L. Perret. Algebraic and Combinatorial Tools for Public Key Cryptography. PhD thesis, Université de Marne-la-Vallé, 2005. [ bib | http ]

Preprints

[1] Ludovic Perret. On the computational complexity of some equivalence problems of polynomial systems of equations over finite fields. Electronic Colloquium on Computational Complexity (ECCC), (116), 2004. [ bib ]
[2] Françoise Levy-Dit Vehel and Ludovic Perret. A Polly Cracker system based on Satisfiability. Research Report RR-4698, INRIA, 2003. [ bib | http ]