Cryptanalysis of Patarin’s 2-round public key system with S boxes (2R)

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

Volumn 1807, Issue , 2000, Pages 408-416

  Biham, Eli ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR TRANSFORMATIONS; MATHEMATICAL TRANSFORMATIONS;

BINARY FUNCTIONS; CIPHERTEXTS; PUBLIC KEY SYSTEMS; S-BOXES;

CRYPTOGRAPHY;

EID: 38148998967     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45539-6_28     Document Type: Conference Paper

References (11)

1. W. Diffie, M. E. Hellman, New Directions in Cryptography, IEEE Transactions on Information Theory, Vol. 22, No. 6, Nov. 1976.
2. Tsutomu Matsumoto, Hideki Imai, Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption, Lecture Notes in Computer Science, Advances in Cryptology, proceedings of EUROCRYPT’88, pp. 419-453, 1988.
3. H. Ong, C. P. Schnorr, Adi Shamir, Efficient Signature Schemes Based on Polynomial Equations, Lecture Notes in Computer Science, Advances in Cryptology, proceedings of CRYPTO’84, pp. 37-46, 1984.
4. Jacques Patarin, Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt’88, Lecture Notes in Computer Science, Advances in Cryptology, proceedings of CRYPTO’95, pp. 248-261, 1995.
5. Jacques Patarin, Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms, Lecture Notes in Computer Science, Advances in Cryptology, proceedings of EUROCRYPT’96, pp. 33-48, 1996.
6. Jacques Patarin, Asymmetric Cryptography with a Hidden Monomial, Lecture Notes in Computer Science, Advances in Cryptology, proceedings of CRYPTO’96, pp. 45-60, 1996.
7. Jacques Patarin, Louis Goubin, Asymmetric Cryptography with S Boxes, proceedings of ICICS’97, Lecture Notes in Computer Science 1334, pp. 369-380, 1997.
8. John M. Pollard, Claus P. Schnorr, An Efficient Solution to the Congruence x2 +ky2 = m(mod n), IEEE Transactions on Information Theory, Vol. 33, No. 5, 1987.
9. Adi Shamir, Efficient Signature Schemes Based on Birational Permutations, Lecture Notes in Computer Science, Advances in Cryptology, proceedings of CRYPTO’93, pp. 1-12, 1993.
10. Serge Vaudenay, Jacques Stern, Don Coppersmith, Attacks on the Birational Permutation Signature Schemes, Lecture Notes in Computer Science, Advances in Cryptology, proceedings of CRYPTO’93, pp. 435-443, 1993.
11. Ding-Feng Ye, Kwok-Yan Lam, Zong-Duo Dai, Cryptanalysis of “2R” Schemes, Lecture Notes in Computer Science, Advances in Cryptology, proceedings of CRYPTO’99, pp. 315-325, 1999.