Polynomial equivalence problems: Algorithmic and theoretical aspects

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4004 LNCS, Issue , 2006, Pages 30-47

  Faugère, Jean Charles ^a   Perret, Ludovic ^b  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^b UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Cryptanalysis; F5 algorithm; Gr bner bases; Isomorphism of Polynomials (IP); Public Key Cryptography

Indexed keywords

ALGORITHMIC LANGUAGES; CRYPTOGRAPHY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; POLYNOMIALS; PROBLEM SOLVING;

F5 ALGORITHM; GRÖBNER BASES; ISOMORPHISM OF POLYNOMIALS (IP); PUBLIC-KEY CRYPTOGRAPHY;

SECURITY OF DATA;

EID: 33746050364     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11761679_3     Document Type: Conference Paper

References (30)

1. W.W. Adams and P. Loustaunau. An Introduction to Gröbner Bases. Graduate Studies in Mathematics, Vol. 3, AMS, 1994.
2. G. Ars, J.-C. Faugère, H. Imai, M. Kawazoe, and M. Sugita. Comparison Between XL and Gröbner Basis Algorithms. Advances in Cryptology - ASIACRYPT 2004, Lecture Notes in Computer Science, vol. 3329, pp. 338-353, 2004.
3. 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 MEGA 2005, Eighth International Symposium on Effective Methods in Algebraic Geometry, 15 pages, 2005.
4. M. Bardet, J-C. Faugère, and B. Salvy. On the Complexity of Gröbner Basis Computation of Semi-Regular Overdetermined Algebraic Equations. In Proc. of International Conference on Polynomial System Solving (ICPSS), pp. 71-75, 2004.
5. O. Billet, and H. Gilbert. A Traceable Block Cipher. Advances in Cryptology - ASIACRYPT 2003, Lecture Notes in Computer Science, vol. 2894, Springer-Verlag, pp. 331-346, 2003.
6. A. Biryukov, C. De Cannière, A. Braeken, and B. Preneel. A Toolbox for Cryptanalysis: Linear and Affine Equivalence Algorithms. Advances in Cryptology - EUROCRYPT 2003, Lecture Notes in Computer Science, vol. 2656, Springer-Verlag, pp. 33-50, 2003.
7. R. B. Boppana, J. Hastad, and S. Zachos. Does co-NP Have Short Interactive Proofs? Information Processing Letters, 25(2), pp. 127-132, 1987.
8. B. Buchberger. Gröbner Bases: an Algorithmic Method in Polynomial Ideal Theory. Recent trends in multidimensional systems theory. Reider ed. Bose, 1985.
9. B. Buchberger, G.-E. Collins, and R. Loos. Computer Algebra Symbolic and Algebraic Computation. Springer-Verlag, second edition, 1982.
10. N. Courtois. La sécurité des primitives cryptographiques basées sur des problèmes algébriques multivariables: MQ, IP, MinRank, HFE. Ph.D. Thesis, Paris, 2001.
11. N. Courtois, L. Goubin, and J. Patarin. Improved Algorithms for Isomorphism of Polynomials. Advances in Cryptology - EUROCRYPT 1998, Lecture Notes in Computer Science, vol. 1403, Springer-Verlag, pp. 84-200, 1998.
12. N. Courtois, L. Goubin, and J. Patarin. Improved Algorithms for Isomorphism of Polynomials - Extended Version. Available from http://www.minrank.org.
13. N. Courtois, L. Goubin, and J. Patarin. SFLASH, a Fast Asymmetric Signature Scheme for low-cost Smartcards - Primitive Specification and Supporting Documentation. Available at http://www.minrank.org/sflash-b-v2.pdf.
14. N. Courtois, A. Klimov, J. Patarin, and A. Shamir. Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations. Advances in Cryptology - EUROCRYPT 2000, Lecture Notes in Computer Science, vol. 1807, Springer-Verlag, pp. 392-407, 2000.
15. D. A. Cox, J.B. Little and, D. O'Shea. Ideals, Varieties, and Algorithms: an Introduction to Computational Algebraic Geometry and Commutative Algebra. Undergraduate Texts in Mathematics. Springer-Verlag. New York, 1992.
16. 4). Journal of Pure and Applied Algebra, 139(1-3), pp. 61-88, June 1999.
17. 5. Proceedings of ISSAC, pp. 75-83. ACM press, July 2002.
18. 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.
19. J. C. Faugère, P. Gianni, D. Lazard, and T. Mora. Efficient Computation of Zero-Dimensional Gröbner Bases by Change of Ordering. Journal of Symbolic Computation, 16(4), pp. 329-344, 1993.
20. P. Felke On certain Families of HFE-type Cryptosystems. Proceedings of WCC'05, International Workshop on Coding and Cryptography, March 2005.
21. S. Fortin. The Graph Isomorphism problem. Technical Report 96-20, University of Alberta, 1996.
22. M. R. Garey, and D. B. Johnson. Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
23. W. Geiselmann, R. Steinwandt, and T. Beth. Attacking the Affine Parts of SFLASH. Cryptography and Coding, 8th IMA International Conference, vol. 2260, Springer-Verlag, pp. 355-359, 2001.
24. M. Hoffman. Group-theoretic algorithms and Graph Isomorphism. Lecture Notes in Computer Science, vol. 136, Springer-Verlag, 1982.
25. http://magma.maths.usyd.edu.au/magma/
26. T. Matsumoto, and H. Imai. Public Quadratic Polynomial-tuples for efficient signature-verification and message-encryption. Advances in Cryptology - EUROCRYPT 1988, Lecture Notes in Computer Science, vol. 330, Springer-Verlag, pp. 419-453, 1988.
27. https://www.cosic.esat.kuleuven.be/nessie/deliverables/decision-final. pdf.
28. J. Patarin. Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): two new families of Asymmetric Algorithms. Advances in Cryptology - EUROCRYPT 1996, Lecture Notes in Computer Science, vol. 1070, Springer-Verlag, pp. 33-48, 1996.
29. J. Patarin. Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): two new families of Asymmetric Algorithms - Extended Version. Available from http://www.minrank.org/hfe/.
30. J. Patarin. Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt '88. Advances in Cryptology - CRYPTO 1995, Lecture Notes in Computer Science, Springer-Verlag, vol. 963, pp. 248-261, 1995.