A new variant of the matsumoto-imai cryptosystem through perturbation

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

Volumn 2947, Issue , 2004, Pages 305-318

  Ding, Jintai ^a  

^a UNIVERSITY OF CINCINNATI   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACETIC ACID; MULTIVARIABLE SYSTEMS; PUBLIC KEY CRYPTOGRAPHY;

EFFICIENCY ANALYSIS; HIDDEN FIELD EQUATIONS; LINEARIZATION METHODS; LINEARLY INDEPENDENTS; MULTI VARIABLES; OPEN KEYS; PERTURBATION; QUADRATIC POLYNOMIAL;

CRYPTOGRAPHY;

EID: 35048862324     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24632-9_22     Document Type: Article

References (15)

1. [ACDG] Mehdi-Laurent Akkar, Nicolas T. Courtois, Romain Duteuil, Louis Goubin, A Fast and Secure Implementation of Sflash Volume 2567, pp 267-278 Lecture Notes in Computer Science
2. [C] Nicolas T. Courtois The Security of Hidden Field Equations (HFE), Volume 2020, pp 0266 Lecture Notes in Computer Science
3. [CDF] Nicolas Courtois, Magnus Daum and Patrick Felke, On the Security of HFE, HFEv- and Quartz, PKC 2003, LNCS 2567, Springer, pp. 337-350.
4. [CP] Nicolas Courtois, Jacques Patarin, About the XL Algorithm over GF(2), Volume 2612, pp 141-157 Lecture Notes in Computer Science
5. [CGP] Nicolas Courtois, Louis Goubin, Jacques Patarin, FLASH, a Fast Multivariate Signature Algorithm, Volume 2020, pp 0298 Lecture Notes in Computer Science
6. [CGP1] Jacques Patarin, Louis Goubin, Nicolas Courtois, C-+* and HM: Variations around Two Schemes of T. Matsumoto and H. Imai Volume 1514, pp 0035 Lecture Notes in Computer Science
7. [CGP2] Jacques Patarin, Nicolas Courtois, Louis Goubin QUARTZ, 128-Bit Long Digital Signatures, Volume 2020, pp 0282 Lecture Notes in Computer Science
8. [CKPS] Nicolas Courtois, Alexander Klimov, Jacques Patarin, Adi Shamir Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations, Volume 1807, pp 0392 Lecture Notes in Computer Science
9. [Dm] Dickerson, Matthew, The inverse of an automorphism in polynomial time. J. Symbolic Comput. 13 (1992), no. 2, 209-220.
10. [KS] Aviad Kipnis, Adi Shamir, Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization Volume 1666, pp 0019, Lecture Notes in Computer Science
11. [FJ] Jean-Charles Faugère, Antoine Joux, Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases Advances in cryptology - CRYPTO 2003, Dan Boneh (ed.), Volume 2729, Lecture notes in computer Sciences, Springer, New York 2003
12. [MI] Matsumoto, T., Imai, H., Public quadratic polynomial-tuples for efficient signature verification and message encryption, Advances in cryptology - EUROCRYPT '88 (Davos, 1988), 419-453, Lecture Notes in Comput. Sci., 330, Springer, Berlin, 1988.
13. [P] Patarin, J., Cryptanalysis of the Matsumoto and Imai public key scheme of Eurocrypt'88., Des. Codes Cryptogr. 20 (2000), no. 2, 175-209.
14. [PI] Patarin, J., Hidden field equations and isomorphism of polynomials, Eurocrypto'96, 1996.
15. [S] Shamir, Adi, Efficient signature schemes based on birational permutations, Advances in cryptology - CRYPTO '98 (Santa Barbara, CA, 1998), 257-266, Lecture Notes in Comput. Sci., 1462, Springer, Berlin, 1998.