Versatile Montgomery Multiplier Architectures

Versatile Montgomery Multiplier Architectures

Several algorithms for Public Key Cryptography (PKC), such as RSA, Diffie-Hellman, and Elliptic Curve Cryptography, require modular multiplication of very large operands (sizes from 160 to 4096 bits) as their core arithmetic operation. To perform this operation reasonably fast, general purpose proce...

Full description

Bibliographic Details
Main Author: Gaubatz, Gunnar
Other Authors: John A. McNeill, Committee Member
Format: Others
Published: Digital WPI 2002
Subjects:
computer arithmetic
modular multiplication
public key cryptography
montgomery
vlsi
high radix
Public key cryptography
Computer algorithms
Online Access:https://digitalcommons.wpi.edu/etd-theses/538
https://digitalcommons.wpi.edu/cgi/viewcontent.cgi?article=1537&context=etd-theses

Internet

https://digitalcommons.wpi.edu/etd-theses/538
https://digitalcommons.wpi.edu/cgi/viewcontent.cgi?article=1537&context=etd-theses

Similar Items