IEEE Transactions on Circuits & Systems II Express Briefs · 2019 · 41 citations · 17 references
EngineeringComputer EngineeringComputer ScienceComputer ArchitectureField-programmable Gate ArraysReconfigurable ComputingHardware AccelerationLookup TablesLow-power Fpga DesignModular ArithmeticParallel ArchitecturesArithmetic Logic Unit ArchitectureKaratsuba MultiplicationLow-power MultipliersModular Arithmetic AlgorithmsModular MultiplicationMultiplier DesignPipeline Organization
In this brief, a non-least positive form (NLP) based modular multiplication method that combines Karatsuba and schoolbook multiplication is applied in Montgomery modular multiplication, which saves 2 base multiplications compared to Karatsuba-only designs and allows pipeline structure to make most use of the parallelism in large modular multiplications. Based on this method, 256-bit and 512-bit modular multipliers are constructed with 3-way and 4-way NLP multipliers on FPGA platform. Implemented on Virtex-6, the 256-bit design can perform a modular multiplication in 62.6 ns and only requires 3.5K LUTs and 24 DSPs, which exhibits low-latency and low-cost among previous works.
17
Modular multiplication without trial division
Peter L. Montgomery · Mathematics of Computation · 1985 · 2.4K citations
Modular Multiplication Without Trial Division
Peter L. Montgomery · Mathematics of Computation · 1985 · 1.1K citations · Full text
Montgomery exponentiation needs no final subtractions
Colin D. Walter · Electronics Letters · 1999 · 250 citations