EFFICIENT ARITHMETICS ON ELLIPTIC CURVES OVER PRIME FIELDS

Peter Nose (2008) EFFICIENT ARITHMETICS ON ELLIPTIC CURVES OVER PRIME FIELDS. EngD thesis.

Abstract

In this thesis we give a brief introduction to arithmetics of prime fields. These are very attractive for software-based implementations of cryptosystems such as those based on the difficulty of the discrete logarithm on elliptic curves. The main topic of this thesis are efficient implementations of arithmetics on elliptic curves over prime fields. We focus on efficient scalar multiplication of points on elliptic curves using point addition and point doubling. We also discus design, implementation, optimization and performance analysis of used algorithms.

Item Type:

Thesis (EngD thesis)

Keywords:

prime field, elliptic curves, affine coordinates, projective coordinates, scalar multiplication, NAF representation.

Number of Pages:

Language of Content:

Slovenian

Mentor / Comentors:

Name and Surname	ID	Function
izr. prof. dr. Aleksandar Jurišić	1118	Mentor

Link to COBISS:

http://www.cobiss.si/scripts/cobiss?command=search&base=50070&select=(ID=6751572)

Institution:

University of Ljubljana

Department:

Faculty of Computer and Information Science

Item ID:

291

Date Deposited:

28 Oct 2008 12:49

Last Modified:

13 Aug 2011 00:33

URI:

http://eprints.fri.uni-lj.si/id/eprint/291

Actions (login required)

View Item