Abstract
Most of publications on Elliptic Curve Cryptosystem implementations concentrates on characteristic 2 case. We show here that advantage can be taken of the good performances of processors or coprocessors to compute RSA ([4]) calculus to get fast implementations of elliptic curve exponentiation in a field of characteristic p. We compare also known and less known algorithms performances to make this calculus.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gollman, D., Han, Y., Mitchell, C.J.: Redundant Integers Representations and Fast Exponentiation Designs. Codes and Cryptography 7, 135–151 (1996)
Knuth, D.E.: The Art of Computer Programming, 2nd edn. Seminumerical Algorithms, vol. 2, pp. 316–336. Addison Wesley, Reading (1981)
Menezes, A.J., van Oorshot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography, pp. 606–610. CRC Press, Boca Raton (1997)
Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21, 120–126 (1978)
Sorenson, J.: An Analysis of Lehmer’s Euclidean GCD Algorithm. In: ISSAC 1995, pp. 254–258 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Durand, A. (2000). Efficient Ways to Implement Elliptic Curve Exponentiation on a Smart Card. In: Quisquater, JJ., Schneier, B. (eds) Smart Card Research and Applications. CARDIS 1998. Lecture Notes in Computer Science, vol 1820. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10721064_33
Download citation
DOI: https://doi.org/10.1007/10721064_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67923-3
Online ISBN: 978-3-540-44534-0
eBook Packages: Springer Book Archive