Parametric, Secure and Compact Implementation of RSA on FPGA
||The system is temporarily closed to updates for reporting purpose.
Öksüzoğlu, Ersin and Savaş, Erkay (2008) Parametric, Secure and Compact Implementation of RSA on FPGA. In: 2008 International Conference on ReConFigurable Computing and FPGAs, (Accepted/In Press)
We present a fast, efficient, and parameterized modular multiplier and a secure exponentiation circuit especially intended for FPGAs on the low end of the price range. The design utilizes dedicated block multipliers as the main functional unit and Block-RAM as storage unit for the operands. The adopted design methodology allows adjusting the number of multipliers, the radix used in the multipliers, and number of words to meet the system requirements such as
available resources, precision and timing constraints. The architecture, based on the Montgomery modular multiplication algorithm, utilizes a pipelining technique that allows concurrent operation of hardwired multipliers. Our
design completes 1020-bit and 2040-bit modular multiplications in 7.62 μs and 27.0 μs, respectively. The multiplier uses a moderate amount of system resources while achieving the best area-time product in literature. 2040-bit modular exponentiation engine can easily fit into Xilinx Spartan-3E 500; moreover the exponentiation circuit withstands known side channel attacks.
Repository Staff Only: item control page