Advertisement

Minimal weight k-SR representations

  • Yongfei Han
  • Dieter Gollmann
  • Chris Mitchell
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1025)

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].

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    D. Gollmann, Yongfei Han, and C. Mitchell. Redundant integer representations and fast exponentiation, to appear in International Journal: Designs, Codes and Cryptography.Google Scholar
  2. 2.
    D.E. Knuth. The art of computer programming, Volume 2: seminumerical algorithms. Addison-Wesley, Reading, Mass., 2nd edition, 1981.Google Scholar
  3. 3.
    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.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Yongfei Han
    • 1
  • Dieter Gollmann
    • 1
  • Chris Mitchell
    • 1
  1. 1.Information Security Group Department of Computer Science Royal HollowayUniversity of LondonEgham

Personalised recommendations