Asymmetric cryptography with a hidden monomial: And a candidate algorithm for ≃ 64 bits asymmetric signatures

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

Volumn 1109, Issue , 1996, Pages 45-60

  Patarin, Jacques ^a  

^a CP8 TRANSAC ^*  (France)

Author keywords

[No Author keywords available]

Indexed keywords

REPAIR;

ASYMMETRIC CRYPTOGRAPHY; ASYMMETRIC SIGNATURE; EXTENDED VERSIONS; ORIGINAL ALGORITHMS; SECRET KEY;

CRYPTOGRAPHY;

EID: 84955622221     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68697-5_4     Document Type: Conference Paper

References (4)

1. T. Matsumoto and H. Imai, "Public quadratic polynomial-tuples for efficient signature-verification and message-encryption," EUROCRYPT'88, Springer Verlag, pp. 419-453.
2. J. Patarin, "Cryptanalysis of the Matsumoto and Imai public key scheme of Eurocrypt'88," CRYPTO'95, Springer Verlag, pp. 248-261.
3. J. Patarin, "Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): two new Families of Asymmetric Algorithms," EURO- CRYPT'96, Springer Verlag, pp. 33-48.
4. F.R. Gantmacher, "The theory of matrices," Chelsea Publishing Company, Volume one, chapter VII.