The multi-variable modular polynomial and its applications to cryptography

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

Volumn 1178, Issue , 1996, Pages 386-396

  Takagi, Tsuyoshi ^a   Naito, Shozo ^a  

^a NTT CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; POLYNOMIALS;

CRITICAL NUMBERS; ELLIPTIC CURVE; ITS APPLICATIONS; MODULAR POLYNOMIAL; MULTI VARIABLES; PLAIN TEXT;

MULTIVARIABLE SYSTEMS;

EID: 84990218567     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0009515     Document Type: Conference Paper

References (8)

1. B. Buchberger, “Application of gröbner bases in non-linear computer science”, Lecture Notes in Computer Science, Vol.296, (1987), pp.52–80.
2. D. Coppersmith, M. Franklin, J. Patarin, M. Reiter, “Low-exponet RSA with related messages”, Advances in Cryptology — EURO-CRYPT ‘96, LNCS 1070, (1996), pp.1–9.
3. D. Coppersmith, “Finding a small root of a univariate modular equation”, Advances in Cryptology — EUROCRYPT’96, LNCS 1070, (1996), pp.155–165.
4. J. Håstad, “Solving simultaneous modular equations of low degree”, SIAM J. Computing, Vol.17, No.2, (1988), pp.336–341.
5. K. Koyama, U. M. Maurer, T. Okamoto and S. A. Vanstone, “New public-key schemes based on elliptic curves over the ring Zn”, Advances in Cryptology — CRYPTO ‘91, LNCS 576, (1992), pp.252–266.
6. K. Kurosawa, K. Okada, S. Tsujii, “Low exponent attack against elliptic curve RSA”, Information Processing Letters, 53, (1995), pp.77–83.
7. H. Kuwakado, K. Koyama; “Security of RSA-type cryptosystems over elliptic curves against the Håstad attack”, Electronics Letters, 30, No.22, (1994), pp.1843–1844.
8. J. H. Silverman, “The arithmetic of elliptic curves”, GTM106, Springer-Verlag, Berlin, 1986.