Hardware implementation of an elliptic curve processor over GF(p) with Montgomery modular multiplier

Author： Ors Berna   Batina Lejla   Preneel Bart   Vandewalle Joos  

Publisher： Inderscience Publishers

ISSN： 1741-1068

Source： International Journal of Embedded Systems, Vol.3, Iss.4, 2009-01, pp. : 229-240

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

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, 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.

Related content

A cryptographic processor for arbitrary elliptic curves over GF(2m)

By Eberle Hans   Gura Nils   Shantz Sheueling Chang   Gupta Vipul  

International Journal of Embedded Systems, Vol. 3, Iss. 4, 2009-01 ,pp. : 241-255 (15)

Inderscience Publishers

Access to resources Recommend Favorite

GF(2m)上椭圆曲线标量乘快速算法研究Research on Fast Algorithms for Scalar Multiplication of Elliptic Curve over GF(2m)

By 孙俐   周梦  

Computer Science and Application, Vol. 4, Iss. 4, 2014-04 ,pp. : 76-84 (9)

汉斯出版社

Access to resources Recommend Favorite

Cost-effective design for binary Edwards elliptic curves crypto-processor over GF (2 N ) using parallel multipliers and architectures

By Al-Haija Qasem Abu  

International Journal of Information and Computer Security, Vol. 5, Iss. 3, 2013-08 ,pp. : 236-250 (15)

Inderscience Publishers

Access to resources Recommend Favorite

Efficient Reconfigurable Implementation of Canonical and Normal Basis Multipliers Over Galois Fields GF(2m) Generated by AOPs

By Imaña J.L.   Sánchez J.M.  

Journal of VLSI Signal Processing, Vol. 42, Iss. 3, 2006-03 ,pp. : 285-296 (12)

Springer Publishing Company

Access to resources Recommend Favorite

Steganographic manipulations with elliptic curve cryptography

By Shankar T.N.  

International Journal of Electronic Security and Digital Forensics, Vol. 4, Iss. 4, 2012-10 ,pp. : 280-297 (18)

Inderscience Publishers

Access to resources Recommend Favorite