Efficient zero-knowledge authentication based on a linear algebra problem minrank

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

Volumn 2248, Issue , 2001, Pages 402-421

  Courtois, Nicolas T ^a,b,c  

^a SchlumbergerSema ^*  (France)

^b UNIVERSITÉ DE TOULON   (France)

^c INRIA ROCQUENCOURT   (France)

Author keywords

Entity authentication; Group signatures; Identification; Min Rank problem; Multivariate cryptography; NP complete problems; Rankdistance codes; Ring signatures; Syndrome decoding (SD); Zero knowledge

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECODING; HASH FUNCTIONS; IDENTIFICATION (CONTROL SYSTEMS); LINEAR ALGEBRA; NETWORK SECURITY; PUBLIC KEY CRYPTOGRAPHY;

ENTITY AUTHENTICATIONS; GROUP SIGNATURES; MULTIVARIATE CRYPTOGRAPHY; RANK-DISTANCE CODES; RING SIGNATURES; SYNDROME DECODING; ZERO KNOWLEDGE;

AUTHENTICATION;

EID: 84946828059     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45682-1_24     Document Type: Conference Paper

References (40)

1. Alexander Barg: Handbook of coding theory, Chapter 7: Complexity Issues in Coding Theory; North Holland, 1999.
2. E.R. Berlekamp, R.J. McEliece, H.C.A. van Tilborg: On the inherent intractability of certain coding problems; IEE Trans. Inf. Th., IT-24(3), pp. 384-386, May 1978.
3. Anne Canteaut, Florent Chabaud: A newalgorithm for finding minimum-weight words in a linear code: application to McEliece’s cryptosystem and to BCH Codes of length 511;
4. Kefei Chen: A newiden tification algorithm. Cryptography Policy and algorithms conference, vol. 1029, LNCS, Springer-Verlag, 1996.
5. Amos Fiat, Adi. Shamir: Howto prove yourself: Practical solutions to identification and signature problems. In Advances in Cryptology, Crypto ’86, pp. 186-194, Springer-Verlag, 1987.
6. Don Coppersmith, Jacques Stern, Serge Vaudenay: Attacks on the birational permutation signature schemes; Crypto 93, Springer-Verlag, pp. 435-443.
7. Don Coppersmith, Jacques Stern, Serge Vaudenay, The Security of the Birational Permutation Signature Schemes, in Journal of Cryptology, 10(3), pp. 207-221, 1997.
8. Nicolas Courtois: The security of Hidden Field Equations (HFE); Cryptographers’ Track Rsa Conference 2001, San Francisco 8-12 April 2001, LNCS 2020, Springer-Verlag.
9. The HFE cryptosystem home page: http://hfe.minrank.org.
10. Nicolas Courtois: The security of cryptographic primitives based on multivariate algebraic problems: MQ, MinRank, IP, HFE; PhD thesis, September 25th 2001, Paris 6 University, France. Mostly in French. Available at http://www.minrank.org/phd.pdf
11. Nicolas Courtois and Ernst M. Gabidulin.: Security of cryptographic schemes based on rank problems; work in progress.
12. Ronald Cramer, Ivan Damgård: Zero-Knowledge Proofs for Finite Field Arithmetic or: Can Zero-Knowledge be for Free? Crypto’98, LNCS 1642, pp. 424-441, Springer Verlag. See http://www.brics.dk/RS/97/27/
13. Ernst M. Gabidulin. Theory of codes with maximum rank distance. Problems of Information Transmission, 21:1-12, 1985.
14. Ernst M. Gabidulin, A. V. Paramonov, O. V. Tretjakov: Ideals over a Non-Commutative Ring and their Applications in Cryptology. Eurocrypt 1991, pp. 482-489.
15. Ernst M. Gabidulin, Alexei V. Ourivski: Modified GPT PKC with Right Scrambler. WCC 2001, Paris, France, Daniel Augot and Claude Carlet Editor.
16. Marc Girault: A (non-practical) three pass identification protocol using coding theory; Advances in cryptology, AusCrypt’90, LNCS 453, pp. 265-272.
17. Oded Goldreich, Y. Oren. Definitions and properties of Zero-knowledge proof systems. Journal of Cryptology 1994, vol.7, no.1, pp.1-32.
18. S. Goldwasser, S. Micali and C. Rackoff, The knowledge Complexity of interactive proof systems; SIAM Journal of computing, 1997, Vol. 6, No.1, pp.84.
19. Louis Goubin, Nicolas Courtois Cryptanalysis of the TTM Cryptosystem; Advances of Cryptology, Asiacrypt’2000, 3-9 December 2000, Kyoto, Japan, Springer-Verlag.
20. Sami Harari. A newauthen tication algorithm. In Coding Theory and Applications, volume 388, pp.204-211, LNCS, 1989.
21. P. J. Lee and E. F. Brickell. An observation on the security of McEliece’s public-key cryptosystem; In Advances in Cryptology, Eurocrypt’88, LNCS 330, pp. 275–280. Springer-Verlag, 1988.
22. R.J. McEliece: A public key cryptosystem based on algebraic coding theory; DSN Progress Report42-44, Jet Propulsion Laboratory, 1978, pp. 114-116.
23. Jeffrey O. Shallit, Gudmund S. Frandsen, Jonathan F. Buss: The Computational Complexity of Some Problems of Linear Algebra problems, BRICS series report, Aaarhus, Denmark, RS-96-33, available on the net http://www.brics.dk/RS/96/33/.
24. Jacques Patarin: Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): two new families of Asymmetric Algorithms; Eurocrypt’96, Springer Verlag, pp. 33-48.
25. Jacques Patarin, Louis Goubin, Nicolas Courtois: Quartz, 128-bit long digital signatures; Cryptographers’ Track Rsa Conference 2001, San Francisco 8-12 April 2001, LNCS 2020, Springer-Verlag.
26. Jacques Patarin, Louis Goubin, Nicolas Courtois, + papers of Eli Biham, Aviad Kipnis, T. T. Moh, et al.: Asymmetric Cryptography with Multivariate Polynomials over a Small Finite Field; known as ‘orange script’, compilation of papers with added material. Available from JPatarin@slb.com.
27. David Pointcheval: A newIden tification Scheme Based on the Perceptrons Problem; In Advances in Cryptology, Proceedings of Eurocrypt’95, LNCS 921, pp.319-328, Springer-Verlag.
28. David Pointcheval: Les preuves de connaissance et leurs preuves de sécurité, PhD thesis, December 1996, Caen University, France.
29. Ronald R. Rivest, Adi Shamir and Yael Tauman: Howto leak a secret; Asiacrypt 2001, LNCS, Springer-Verlag.
30. Adi Shamir: Efficient signature schemes based on birational permutations; Crypto’93, Springer-Verlag, pp. 1-12.
31. Adi Shamir: An efficient Identification Scheme Based on Permuted Kernels, In Advances in Cryptology, Crypto’89, LNCS 435, pp.606-609, Springer-Verlag.
32. Adi Shamir, Aviad Kipnis: Cryptanalysis of the HFE Public Key Cryptosystem; In Advances in Cryptology, Proceedings of Crypto’99, Springer-Verlag, LNCS.
33. Nicolas Courtois, Adi Shamir, Jacques Patarin, Alexander Klimov, Efficient Algorithms for solving Overdefined Systems of Multivariate Polynomial Equations, Eurocrypt’2000, LNCS 1807, Springer-Verlag, pp. 392-407.
34. Jacques Stern: A newiden tification scheme based on syndrome decoding; Crypto’93, LNCS 773, pp.13-21, Springer-Verlag.
35. Jacques Stern: Designing identification schemes with keys of short size; In Advances in Cryptology, Proceedings of Crypto’94, LNCS 839, pp.164-73, Springer-Verlag.
36. Jacques Stern: A method for finding codewords of small weight; Coding Theory and Applications, LNCS 434, pp.173-180, Springer-Verlag.
37. Jacques Stern, Florent Chabaud: The cryptographic security of the syndrome decoding problem for rank distance codes. In Advances in Cryptology, Asiacrypt’96, LNCS 1163, pp. 368-381, Springer-Verlag.
38. L.G. Valiant: Completeness classes in algebra. In Proc. Eleventh Ann. ACM Symp. Theor. Comp., pp. 249-261, 1979.
39. Alexander Vardy: The intractability of computing the minimum distance of a code; IEEE Transactions on Information Theory, Nov 1997, Vol.43, No. 6; pp. 1757-1766.
40. Pascal Véron, Problème SD, Opérateur Trace, Schémas d’Identification et Codes de Goppa; PhD thesis in french, Toulon University, France, july 1995.