Abstract
ESIGN is an efficient digital signature algorithm [OkS], [Ok], whose computation speed is more than twenty times faster than that of the RSA scheme, while its key length and signature length are comparable to those of the RSA scheme. This paper presents a software implementation of ESIGN on an 8bit micro-processor smart card. This realizes a computation time for signature generation of about 0.2 seconds. To achieve this remarkable speed for signature generation, appropriate implementation techniques such as pre-computation and table look-up techniques are effectively used. Moreover, this software implementation is compact enough for smart cards; the program size and the data size including the work area are at most 3Kbytes each. Practical identification schemes based on ESIGN are also presented.
Chapter PDF
Similar content being viewed by others
References
E. F. Brickell, “A Survey of Hardware Implementation of RSA”, in Advances in Cryptology — CRYPTO’ 89, Lecture Notes in Computer Science 435, Springer-Verlag, Berlin, pp.368–370 (1990).
D. W. Davies, “Applying the RSA Digital Signature to Electronic Mail”, Computer, Vol.16, No.2, pp.55–62 (Feb., 1983).
D. E. Denning, Cryptography and Data Security, Addison-Wesley, pp.170 (1982).
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).
S. Even, O. Goldreich, and S. Micali, “On-line/Off-line Digital Signatures”, in Advances in Cryptology — CRYPTO’ 89, Lecture Notes in Computer Science 435, Springer-Verlag, Berlin, pp.263–275 (1990).
A. Fiat and A. Shamir, “How to Prove Yourself: Practical Solutions to Identification and Signature Problems”, in Advances in Cryptology — CRYPTO’ 86, Lecture Notes in Computer Science 263, Springer-Verlag, Berlin, pp.186–194 (1987).
L. C. Guillou and J. J. Quisquater, “A Practical Zero-Knowledge Protocol Fitted to Security Microprocessors Minimizing both Transmission and Memory”, in Advances in Cryptology — EUROCRYPT’ 88, Lecture Notes in Computer Science 330, Springer-Verlag, Berlin, pp.123–128 (1988).
S. Kawamura and K. Hirano, “A Fast Modular Arithmetic Algorithm Using a Residue Table”, in Advances in Cryptology — EUROCRYPT’ 88, Lecture Notes in Computer Science 330, Springer-Verlag, Berlin, pp.246–250 (1988).
H. Knobloch, “A Smart Card Implementation of the Fiat-Shamir Identification Scheme”, in Advances in Cryptology — EUROCRYPT’ 88, Lecture Notes in Computer Science 330, Springer-Verlag, Berlin, pp.87–95 (1988).
D. E. Knuth, The Art of Computer Programming 2nd Edition, Vol.2, Semi-Numerical Algorithms. Reading, Massachusetts: Addison-Wesley (1981).
S. Miyaguchi, K. Ohta, and M. Iwata, “A 128-bit Hash Function (N-Hash)”, Proceedings of SECURICOM’90, pp.123–137 (Mar., 1990).
K. Ohta and T. Okamoto, “A Modification of the Fiat-Shamir Scheme”, in Advances in Cryptology — CRYPTO’ 88, Lecture Notes in Computer Science 403, Springer-Verlag, Berlin, pp.232–243 (1990).
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).
T. Okamoto and A. Shiraishi, “A Digital Signature Scheme Based on Quadratic Inequalities”, Proceeding of Symposium on Security and Privacy, IEEE, pp.123–132 (Apr., 1985).
H. Ong and C. P. Schnorr, “A Fast Signature Generation with the Fiat-Shamir Scheme”, in Advances in Cryptology — EUROCRYPT’ 90, Lecture Notes in Computer Science 473, Springer-Verlag, Berlin, pp.432–440 (1991).
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).
A. Shamir, “Identity-based Cryptosystems and Signature Schemes”, Advances in Cryptology — CRYPTO’ 84, Lecture Notes in Computer Science 196, Springer-Verlag, Berlin, pp.47–53 (1985).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fujioka, A., Okamoto, T., Miyaguchi, S. (1991). ESIGN: An Efficient Digital Signature Implementation for Smart Cards. In: Davies, D.W. (eds) Advances in Cryptology — EUROCRYPT ’91. EUROCRYPT 1991. Lecture Notes in Computer Science, vol 547. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46416-6_38
Download citation
DOI: https://doi.org/10.1007/3-540-46416-6_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54620-7
Online ISBN: 978-3-540-46416-7
eBook Packages: Springer Book Archive