### Low Power Montgomery Modular Multiplication on Reconfigurable Systems

Pedro Maat C. Massolino, Lejla Batina, Ricardo Chaves, and Nele Mentens

##### Abstract

This paper presents an area-optimized FPGA architecture of the Montgomery modular multiplication algorithm on a low power reconfigurable IGLOO® 2 FPGA of Microsemi®. Our contributions consist of the mapping of the Montgomery algorithm to the specific architecture of the target FPGA, using the pipelined Math blocks and the embedded memory blocks. We minimize the occupation of these blocks as well as the usage of the regular FPGA cells (LUT4 and Flip Flops) through an dedicated scheduling algorithm. The obtained results suggest that a 224-bit modular multiplication can be computed in 2.42 µs, at a cost of 444 LUT4, 160 Flip Flops, 1 Math Block and 1 64x18 RAM, with a power consumption of 25.35 mW. If more area resources are considered, modular multiplication can be performed in 1.30 µs at a cost of 658 LUT4, 268 Flip Flops, 2 Math Blocks, 2 64x18 RAMs and a power consumption of 36.02 mW.

Available format(s)
Category
Implementation
Publication info
Preprint.
Keywords
elliptic curve cryptosystemmodular multiplicationmontgomery algorithmFPGA
Contact author(s)
p massolino @ cs ru nl
History
Short URL
https://ia.cr/2016/280

CC BY

BibTeX

@misc{cryptoeprint:2016/280,
author = {Pedro Maat C.  Massolino and Lejla Batina and Ricardo Chaves and Nele Mentens},
title = {Low Power Montgomery Modular Multiplication on Reconfigurable Systems},
howpublished = {Cryptology ePrint Archive, Paper 2016/280},
year = {2016},
note = {\url{https://eprint.iacr.org/2016/280}},
url = {https://eprint.iacr.org/2016/280}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.