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].
Cite
CITATION STYLE
Han, Y., Gollmann, D., & Mitchell, C. (1995). Minimal weight k-SR representations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1025, pp. 34–43). Springer Verlag. https://doi.org/10.1007/3-540-60693-9_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
