Minimal weight k-SR representations
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 .
Unable to display preview. Download preview PDF.
- 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.D.E. Knuth. The art of computer programming, Volume 2: seminumerical algorithms. Addison-Wesley, Reading, Mass., 2nd edition, 1981.Google Scholar