A message recovery signature scheme equivalent to DSA over elliptic curves

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

Volumn 1163, Issue , 1996, Pages 1-14

  Miyaji, Atsuko ^a  

^a PANASONIC CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; EQUIVALENCE CLASSES; GEOMETRY; RECOVERY;

DIGITAL SIGNATURE ALGORITHMS; DISCRETE LOGARITHM PROBLEMS; ELGAMAL SIGNATURE SCHEME; ELGAMAL SIGNATURES; KEY EXCHANGE PROTOCOLS; MESSAGE RECOVERY SIGNATURE; PUBLIC KEY SYSTEMS; SECURITY RELATIONS;

CRYPTOGRAPHY;

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

References (19)

1. D. Bleichenbacher, "Generating ElGamal signatures without knowing the secret key" to appear in Advances in Cryptology-Proceedings of EUROCRYPT'96.
2. W. Diffie and M. Heilman, "New directions in cryptography" IEEE Trans. Inform. Theory, Vol. IT-22 (1976), 644-654.
3. T. ElGamal, "A public key cryptosystem and a signature scheme based on discrete logarithms," IEEE Trans. Inform. Theory, Vol. IT-31 (1985), 469-472.
4. C. G. Günther, "An identity-based key-exchange protocol," Advances in Cryptology-Proceedings of Eurocrypt'89, Lecture Notes in Computer Science, 434(1990), Springer-Verlag, 29-37.
5. G. Harper, A. Menezes and S. Vanstone, "Public-key cryptosystems with very small key lengths," Advances in Cryptology-Proceedings of Eurocrypt'92, Lecture Notes in Computer Science, 658(1993), Springer-Verlag, 163-173.
6. N. Koblitz, "Elliptic curve cryptosystems," Mathematics of Computation, 48(1987), 203-209.
7. V. S. Miller, "Use of elliptic curves in cryptography," Advances in Cryptology-Proceedings of Crypto'85, Lecture Notes in Computer Science, 218(1986), Springer-Verlag, 417-426.
8. A. Miyaji, "On ordinary elliptic curves," Advances in Cryptology-Proceedings of ASIACRYPT'91, Lecture Notes in Computer Science, 739(1993), Springer-Verlag, 460-469.
9. p suitable for cryptosystems," Advances in Cryptology-Proceedings of AUSCRYPT'92, Lecture Notes in Computer Science, 718(1993), Springer-Verlag, 479-491.
10. "Proposed federal information processing standard for digital signature standard (DSS)," Federal Register, v. 56, n. 169, 30 Aug 1991, 42980-42982.
11. A. Menezes, T. Okamoto and S. Vanstone, "Reducing elliptic curve logarithms to logarithms in a finite field," Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, 80-89, 1991.
12. K. Nyberg and R. A. Rueppel, "A new signature scheme based on the DSA giving message recovery," Proceedings of 1st A CM Conference on Computer and Communications Security, 1993.
13. K. Nyberg and R. A. Rueppel, "Message recovery for signature schemes based on the discrete logarithm problem" Advances in Cryptology-Proceedings of Euro-crypt'94, Lecture Notes in Computer Science, 950(1995), Springer-Verlag, 182-193.
14. K. Nyberg and R. A. Rueppel, "Message recovery for signature schemes based on the discrete logarithm problem," Designs Codes and Cryptography, 7(1996), 61-81.
15. R. Rivest, A. Shamir and L. Adleman, "A method for obtaining digital signatures and public-key cryptosystems," Communications of the ACM, vol. 21, No. 2(1978), 120-126.
16. K. Sakurai and H. Shizuya, "Relationships among the computational powers of breaking Discrete Log cryptosystems," Advances in Cryptology-Proceedings of Euro-crypt'95, Lecture Notes in Computer Science, 921(1995), Springer-Verlag, 341-355.
17. C. P. Schnorr, "Efficient identification and signatures for smart cards," Advances in cryptology-Proceedings of Crypto'89, Lecture Notes in Computer Science, 435(1989), Springer-Verlag, 239-252.
18. J. H. Silverman, The Arithmetic of Elliptic Curves, GTM106, Springer-Verlag, New York, 1986.
19. A. Shamir, R. Rivest and L. Adleman, "Mental Poker," MIT/LCS, TM-125, (Feb. 1979).