Systolic modular multiplication

1993/03/01 by C.D. Walter, Colin D. Walter
Computer Science · #Cryptography and Residue Arithmetic #Advanced Data Storage Technologies #Cryptography and Data Security

paper · doi:10.1109/12.210181

Abstract

A systolic array for modular multiplication is presented using the ideally suited algorithm of P.L. Montgomery (1985). Throughput is one modular multiplication every clock cycle, with a latency of 2n+2 cycles for multiplicands having n digits. Its main use would be where many consecutive multiplications are done, as in RSA cryptosystems.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Citations

• A method for obtaining digital signatures and public-key cryptosystems

Related

• Efficient Modular Arithmetic for SIMD Devices
• Hyper-Systolic Matrix Multiplication
• Modular Multiplication without Carry Propagation (Algorithm Description)
• Operand Folding Hardware Multipliers
• Multipliers: comparison of Fourier transformation based method and Synopsys design technique for up to 32 bits inputs in regular and saturation arithmetics