Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Western University

2013

Finite field arithmetic multiplication

Articles 1 - 1 of 1

Full-Text Articles in Computer Engineering

Efficient Arithmetic For The Implementation Of Elliptic Curve Cryptography, Ebrahim Abdulrahman Hasan Abdulrahman Nov 2013

Efficient Arithmetic For The Implementation Of Elliptic Curve Cryptography, Ebrahim Abdulrahman Hasan Abdulrahman

Electronic Thesis and Dissertation Repository

The technology of elliptic curve cryptography is now an important branch in public-key based crypto-system. Cryptographic mechanisms based on elliptic curves depend on the arithmetic of points on the curve. The most important arithmetic is multiplying a point on the curve by an integer. This operation is known as elliptic curve scalar (or point) multiplication operation. A cryptographic device is supposed to perform this operation efficiently and securely. The elliptic curve scalar multiplication operation is performed by combining the elliptic curve point routines that are defined in terms of the underlying finite field arithmetic operations. This thesis focuses on hardware …