Abstract This paper describes a hardware implementation of an arithmetic processor which is efficient for bit-lengths suitable for both commonly used types of Public Key Cryptography (PKC), i.e., Elliptic Curve (EC) and RSA Cryptosystems. Montgomery modular multiplication in a systolic array architecture is used for modular multiplication. The processor consists of special operational blocks for Montgomery Modular Multiplication, modular addition/subtraction, EC Point doubling/addition, modular multiplicative inversion, EC point multiplier, projective to affine coordinates conversion and Montgomery to normal representation conversion.
Ors et al. REF proposed hardware implementation of a bitlength-efficient elliptic curve processor over GF(p) for PKC, providing a novel architecture for Montgomery modular multiplication.
Hardware implementation of an elliptic curve processor over GF(p)
Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors. ASAP 2003
Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors. ASAP 2003
Computer Science