Jean-Charles Faugère
ABSTRACT
The associated talk surveys how computer algebra techniques have been used to break several cryptosystems.
- L. Goubin, and J. Patarin. Asymmetric Cryptography with S-Boxes. Information and Communication Security, First International Conference (ICICS'97), Lecture Notes in Computer Science vol. 1334, Springer-Verlag, pp. 369--380, 1997. Google Scholar
Digital Library
- D. F. Ye, K. Y. Lam, Z. D. Dai. Cryptanalysis of "2R" Schemes, Adv in Cryptology - CRYPTO 1999, Lecture Notes in Computer Science, vol. 1666, Springer-Verlag, pp. 315--325, 1999. Google ScholarDigital Library
- D. F. Ye, Z. D. Dai and K. Y. Lam. Decomposing Attacks on Asymmetric Cryptography Based on Mapping Compositions, Journal of Cryptology (14), pp. 137--150, 2001.Google ScholarDigital Library
- M. Albrecht, and C. Cid. Algebraic Techniques in Differential Cryptanalysis. Proceedings of the First International Conference on Symbolic Computation and Cryptography, SCC 2008, Beijing, China, April 2008.Google Scholar
- G. Ars. Applications des bases de Gröbner à la cryptographie. Thèse de doctorat, Université de Rennes I, 2004.Google Scholar
- M. Bardet, J-C. Faugère, B. Salvy and B.-Y. Yang. Asymptotic Behaviour of the Degree of Regularity of Semi-Regular Polynomial Systems. In Proc. of MEGA 2005, Eighth International Symposium on Effective Methods in Algebraic Geometry, 2005.Google Scholar
- A. Bauer, and A. Joux. Toward a rigorous variation of coppersmith's algorithm on three variables. Advances in Cryptology - EUROCRYPT 2008, Lecture Notes in Computer Science, vol. 4515, Springer-Verlag, pp. 361--378, 2007. Google ScholarDigital Library
- L. Bettale and J. C. Faugère and L. Perret. Cryptanalysis of the TRMS Cryptosystem of PKC 05 AfricaCrypt 2008, Lecture Notes in Computer Science, vol. 5023, Springer-Verlag, pp. 143--155, 2008. Google ScholarDigital Library
- L. Bettale and J. C. Faugère and L. Perret. Security Analysis of Multivariate Polynomials for Hashing. Information Security and Cryptology - Inscrypt 2008, Springer-Verlag, 2008.Google Scholar
- C. Bouillaguet, and P.-A. Fouque. Analysis of the Collision Resistance of Radio Gatün using Algebraic Techniques. SAC 2008, LNCS, Springer-Verlag. To appear.Google Scholar
- B. Buchberger. An Algorithm for Finding the Basis Elements in the Residue Class Ring Modulo a Zero Dimensional Polynomial Ideal (German), PhD Thesis, Univ of Innsbruck, Math. Institute, Austria, 1965. (English Translation: J. of Symbolic Computation, Special Issue on Logic, Math and Comp Science: Interactions. Volume 41, Num. 3-4, pp 475--511, 2006). Google ScholarDigital Library
- J. Buchmann, A. Pyshkin, and R.-P. Weinmann. Block Ciphers Sensitive to Gröbner Basis Attacks. Topics in Cryptology - CT RSA'06, Lecture Notes in Computer Science, vol. 3860, Springer-Verlag, pp. 313--331, 2006. Google ScholarDigital Library
- N. Courtois, and J. Pieprzyk. Cryptanalysis of Block Ciphers with Overdefined Systems of Equations. Advances in Cryptology - ASIACRYPT 2002, Lecture Notes in Computer Science, vol. 2501, pp. 267--287, 2002. Google ScholarDigital Library
- N. Courtois. Fast Algebraic Attacks on Stream Ciphers with Linear Feedback. Advances in Cryptology - CRYPTO 2003, LNCS, vol. 2729, pp. 176--194, 2003. Google ScholarDigital Library
- N. Courtois, and W. Meier. Algebraic Attacks on Stream Ciphers with Linear Feedback. Advances in Cryptology - EUROCRYPT 2003, Lecture Notes in Computer Science, vol. 2656, pp. 345--359, 2003. Google ScholarDigital Library
- J. Daemen, V. Rijmen. The Design of Rijndael: The Wide Trail Strategy. Springer-Verlag (2001). Google ScholarDigital Library
- J.-C. Faugère. A New Efficient Algorithm for Computing Gröbner Basis: F4. Journal of Pure and Applied Algebra, vol. 139, pp. 61--68, 1999.Google ScholarCross Ref
- J.-C. Faugère. A New Efficient Algorithm for Computing Gröbner Basis without Reduction to Zero: F5. Proceedings of ISSAC, pp. 75--83. ACM press, July 2002. Google ScholarDigital Library
- J.-C. Faugère, and A. Joux. Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems using Gröbner bases. Advances in Cryptology - CRYPTO 2003, Lecture Notes in Computer Science, vol. 2729, Springer-Verlag, pp. 44--60, 2003.Google Scholar
- J.-C. Faugère, and L. Perret. Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects. Advances in Cryptology - EUROCRYPT 2006, Lecture Notes in Computer Science, vol. 4004, pp. 30--47, 2006. Google ScholarDigital Library
- J.-C. Faugère, and L. Perret. Cryptanalysis of 2R- Schemes. Advances in Cryptology - CRYPTO 2006, Lecture Notes in Computer Science, vol. 4117, pp. 357--372, 2006.Google Scholar
- J.-C. Faugère, F. Levy-dit-Vehel, and L. Perret. Cryptanalysis of MinRank. Advances in Cryptology - CRYPTO 2008, Lecture Notes in Computer Science, vol. 5157, pp. 280--296, 2008. Google ScholarDigital Library
- J. C. Faugère and L. Perret. On the Security of UOV pp. 103--109, Proceedings of the First International Conference on Symbolic Computation and Cryptography, SCC 2008, Beijing, China, April 2008.Google Scholar
- J.-C. Faugère, and L. Perret. An Efficient Algorithm for Decomposing Multivariate Polynomials and its Applications to Cryptography. Special Issue of the Journal of Symbolic Computation on Gröbner Bases Techniques in Cryptography and Coding Theory. 2009. Google ScholarDigital Library
- P.-A. Fouque, G. Macariorat, L. Perret and J. Stern. On the Security of the l-IC Signature Scheme. Public Key Cryptography, 14th International Workshop on Practice and Theory in Public Key Cryptography, PKC 2008, Lecture Notes in Computer Science, vol. 4939, pp. 1--17, Springer-Verlag, 2008. Google ScholarDigital Library
- A. K. Lenstra, H. W. Lenstra, Jr., and L. Lovász. Factoring polynomials with rational coefficients. Math. Ann., 261(4):515--534, 1982.Google ScholarCross Ref
- R. Rivest, A. Shamir and L. Adleman. A Method for Obtaining Digital Dignatures and Public-Key Cryptosystems. Communications of the ACM, 21-2, pp. 120--126, 1978. Google ScholarDigital Library
- M. Sugita, M. Kawazoe, L. Perret, and H. Imai. Algebraic Cryptanalysis of 58-Round SHA-1. Fast Software Encryption, 14th International Workshop, FSE 2007, Lecture Notes in Computer Science, vol. 4593, Springer-Verlag, pp. 349-365, 2007. Google ScholarDigital Library
- P. W. Shor Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer SIAM J.Sci. Statist. Comput., 26 (1484) 1997. Google ScholarDigital Library
- M. Caboara, F. Caruso, and C. Traverso. Gröbner bases for public key cryptography ISSAC '08, ACM pp 315--324 (Linz/Hagenberg, Austria) 2008. Google ScholarDigital Library
Index Terms
- Interactions between computer algebra (Gröbner bases) and cryptology
Recommendations
Gröbner bases for public key cryptography
ISSAC '08: Proceedings of the twenty-first international symposium on Symbolic and algebraic computationUp to now, any attempt to use Gröbner bases in the design of public key cryptosystems has failed, as anticipated by a classical paper of B. Barkee et al.; we show why, and show that the only residual hope is to use binomial ideals, i.e. lattices. We ...
A variant of the F4 algorithm
CT-RSA'11: Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011Algebraic cryptanalysis usually requires to find solutions of several similar polynomial systems. A standard tool to solve this problem consists of computing the Gröbner bases of the corresponding ideals, and Faugère's F4 and F5 are two well-known ...
Gröbner Basis Cryptosystems
In the first sections we extend and generalize Gröbner basis theory to submodules of free right modules over monoid rings. Over free monoids, we adapt the known theory for right ideals and prove versions of Macaulay's basis theorem, the Buchberger ...
Comments