Cryptology ePrint Archive: Report 2016/280

Low Power Montgomery Modular Multiplication on Reconfigurable Systems

Pedro Maat C. Massolino and Lejla Batina and 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.

Category / Keywords: implementation / elliptic curve cryptosystem, modular multiplication, montgomery algorithm, FPGA

Date: received 12 Mar 2016

Contact author: p massolino at cs ru nl

Available format(s): PDF | BibTeX Citation

Version: 20160314:075025 (All versions of this report)

Short URL: ia.cr/2016/280

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]