Abstract
We propose a practical digital signature scheme based on the elliptic curve modulo n, where n = p 2 q such that p and q are large secret primes. The signature generation speed of our scheme is more than 10 times faster than that of the RSA scheme. Moreover, a pre-processing technique can significantly increase the signature generation speed.
Chapter PDF
Similar content being viewed by others
References
E. Brickell and J. DeLaurentis, “An Attack on a Signature Scheme Proposed by Okamoto and Shiraishi”, Advances in Cryptology — CRYPTO’85, Lecture Notes in Computer Science No.218, Springer-Verlag, pp.28–32 (1986).
W. Diffie and M. E. Hellman, “New Directions in Cryptography”, IEEE Transactions on Information Theory, Vol.IT-22, No.6, pp.644–654 (Nov., 1976).
J. Evertse and E. van Heyst, “Which New RSA Signatures can be Computed from some Given RSA Signatures?”, Advances in Cryptology — EUROCRYPT’90, Lecture Notes in Computer Science No.473, Springer-Verlag, pp.83–97 (1991).
A. Fujioka, T. Okamoto, and S. Miyaguchi, “ESIGN: An Efficient Digital Signature Implementation for Smart Cards”, Advances in Cryptology — EUROCRYPT’91, Lecture Notes in Computer Science No.547, Springer-Verlag, pp.446–457 (1991).
J. Hastad, “On Using RSA with Low Exponent in a Public Key Network”, Advances in Cryptology — CRYPTO’85, Lecture Notes in Computer Science No.218, Springer-Verlag, pp.403–408 (1985).
B. S. Kaliski, Jr., “A Pseudo-Random Bit Generator Based on Elliptic Logarithms”, Advances in Cryptology — CRYPTO’86, Lecture Notes in Computer Science No.263, Springer-Verlag, pp.84–103 (1986).
K. Koyama, U. Maurer, T. Okamoto, and S. A. Vanstone, “New Public-Key Schemes Based on Elliptic Curves over the Ring Z n”, Advances in Cryptology — CRYPTO’91, Lecture Notes in Computer Science No.576, Springer-Verlag, pp.252–266 (1992).
D. E. Knuth, The Art of Computer Programming, 2nd Edition, Addison-Wesley Publishing Company (1981).
N. Koblitz, A. Course in Number Theory and Cryptography, Springer-Verlag (1987).
N. Koblitz, “Constructing Elliptic Curve Cryptosystems in Characteristics 2”, Advances in Cryptology — CRYPTO’90, Lecture Notes in Computer Science No.537, Springer-Verlag, pp.156–167 (1991).
National Institute for Standards and Technology, “Specifications for a Digital Signature Standard”, Federal Information Processing Standard Publication XX, draft (Aug., 1991).
T. Okamoto, “A Fast Signature Scheme Based on Congruential Polynomial Operations”, IEEE Transactions on Information Theory, Vol.IT-36, No.1, pp.47–53 (Jan., 1990).
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, pp.120–126 (Feb., 1978).
B. Vallée, M. Girault, and P. Toffin, “How to Break Okamoto’s Cryptosystem by Reducing Lattice Bases”, Advances in Cryptology — Eurocrypt’88, Lecture Notes in Computer Science No.330, Springer-Verlag, pp.281–292 (1988).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Okamoto, T., Fujioka, A., Fujisaki, E. (1993). An Efficient Digital Signature Scheme Based on an Elliptic Curve over the Ring Z n . In: Brickell, E.F. (eds) Advances in Cryptology — CRYPTO’ 92. CRYPTO 1992. Lecture Notes in Computer Science, vol 740. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48071-4_4
Download citation
DOI: https://doi.org/10.1007/3-540-48071-4_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57340-1
Online ISBN: 978-3-540-48071-6
eBook Packages: Springer Book Archive