2007 The Third International Symposium on Information Assurance and Security
Inclusion of a Montgomery Multiplier Unit into an Embedded Processor?s Datapath to Speed-up Elliptic Curve Cryptography
Manchester, United Kingdom
August 29-August 31
ISBN: 0-7695-2876-7
This paper analyzes the effects of including a full-width GF(2^m) Montgomery multiplier within the datapath of an existing embedded processor, aiming to speed-up Elliptic Curve Cryptography (ECC). This approach tends to exploit the tight coupling between the new and the other processor modules while maintaining both software compatibility and high flexibility to adapt to different ECC parameters and algorithms. In addition, the present work focuses on the effects on performance due to the interaction between the new unit and the other processor parts. We show that the modified ARM processor runs the ECC critical operation (kP) 9-times faster than in pure software and up to 14-times faster using 3 units and optimized instruction scheduling. Moreover, the improved processor achieves the same performance with 1/4 sized caches thanks to more than 93%
Index Terms:
Elliptic-curve cryptography, security in embedded systems, instruction-set extensions, special-purpose unit, performance evaluation.
Citation:
S. Bartolini, G. Castagnini, E. Martinelli, "Inclusion of a Montgomery Multiplier Unit into an Embedded Processor?s Datapath to Speed-up Elliptic Curve Cryptography," ias, pp.95-100, 2007 The Third International Symposium on Information Assurance and Security, 2007