An Attack on a Signature Scheme Proposed by Okamoto and Shiraishi

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

Volumn 218 LNCS, Issue , 1986, Pages 28-32

  Brickell, Ernest F ^a   DeLaurentis, John M ^b  

^a TELCORDIA TECHNOLOGIES   (United States)

^b SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

DIGITAL SIGNATURE SCHEMES; OKAMOTO; PUBLIC KEY AUTHENTICATION; QUADRATIC INEQUALITY; RSA ENCRYPTION; SIGN MESSAGES; SIGNATURE SCHEME;

AUTHENTICATION;

EID: 3743146243     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-39799-X_4     Document Type: Conference Paper

References (5)

1. T. Okamoto, A. Shiraishi, “A Fast Signature Scheme Based on Quadratic Inequalities,” Proc. of the 1985 Symposium on Security and Privacy, April 1985, Oakland, CA.
2. H. Ong, C. P. Schnorr, and A. Shamir, “An Efficient Sisnature Schem; Based on Quadratic Equations,” Proc. 16th ACM SYMP.Theor. Computing (1984), 208-216.
3. 2 = m(mod n),” Private communication with C. P. Schnorr. June 29, 1984.
4. H. Ong, C. P. Schnorr, A. Shamir, “Efficient Signature Schemes Based on Polynomial Equations,” to appear in Crypto’84, Lecture Notes in Computer Science, Springer-Verlag, NY (1984).
5. D. Estes, L. Adleman, K. Kompella, K. McCurley, G. Miller, “Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Flelds,” to appear.