@phdthesis{Antao2008msc,
abstract = {Most of nowadays applications of electronic devices demand secure communication, which justifies the existence of embedded cryptographic algorithms in these devices. The Elliptic Curve Cryptography public key system has revealed to be more appropriate to embedded systems with limited power and memory resources, when compared with other approaches, such as the widely used Rivest-Shamir-Adleman (RSA) public key system. In this thesis the Elliptic Curve properties are carefully analyzed in order to develop a complete cryptographic processor, which can compute all the necessary arithmetic needed to implement security protocols supported on elliptic curves. Different algorithms to perform the elliptic curve cryptography are analyzed in order to select the most appropriate ones, regarding the introduction of a new efficient method that uses a compact representation of elliptic curve elements. This method, which is designated coordinate collapsing, allows to perform the elliptic curve exponentiation without using the traditional two coordinates to represent a curve element. This improvement allows to reduce the bandwidth requirements by half. A prototype of the developed processor is also presented. This prototype provides to the host system the complete arithmetic support to elliptic curve cryptographic capabilities when communicating with remote systems. This prototype was thoroughly tested using real protocols which confirms this processor applicability into commercial systems.},
author = {Ant\~{a}o, Samuel},
keywords = {ASIC,Cryptography,Elliptic Curve,Embedded Systems,FPGA,Galois Fields},
pages = {90},
school = {Instituto Superior T\'{e}cnico - TU-Lisbon},
title = {{Portable Embedded Systems: Efficient Units for Data Processing and Cryptography}},
type = {MSc},
year = {2008}
}