Abstract
An algorithm for a minimal weight string replacement representation for the standard square and multiply exponentiation method is discussed, with a presentation of the design and proof of the algorithm. The performance of this new method is analysed and compared with previously proposed methods. The techniques presented in this paper have applications in speeding up the implementation of public-key cryptographic algorithms such as RSA [3].
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
D. Gollmann, Yongfei Han, and C. Mitchell. Redundant integer representations and fast exponentiation, to appear in International Journal: Designs, Codes and Cryptography.
D.E. Knuth. The art of computer programming, Volume 2: seminumerical algorithms. Addison-Wesley, Reading, Mass., 2nd edition, 1981.
R.L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21:120–126, 1978.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Han, Y., Gollmann, D., Mitchell, C. (1995). Minimal weight k-SR representations. In: Boyd, C. (eds) Cryptography and Coding. Cryptography and Coding 1995. Lecture Notes in Computer Science, vol 1025. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60693-9_6
Download citation
DOI: https://doi.org/10.1007/3-540-60693-9_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60693-2
Online ISBN: 978-3-540-49280-1
eBook Packages: Springer Book Archive