الفهرس 
INTRODUCTIONOnly 14 pages are availabe for public view
 |  | from | 16 |  |  |
| | | from | 16 | | |
Abstract
Public key cryptography is a modern form of cryptography that allows different parties to e’\change information securely over an insecure network, without having first to agree upon some secret key. The main use of public key cryptography is to provide information security in computer science, for example to transfer securely email, credit card details or other secret information between sender and recipient via the internet.
Public-key cryptography was conceived in 1976 by Whit field Diffie and Martin Hellman. The first practical realization followed in 1977 when Ron Rivest, Adi - Shamir and Len Adleman proposed their now well known RSA cryptosystem, in which security based on the intractability of the integer factorization problem.
Elliptic curve cryptography (ECC) was discovered in 1985 by Neal Koblitz and Victor Miller. Elliptic curve Cryptographic schemes are public key mechanisms that provide the same functionality as RSA schemes. However, their security is based on the hardness of a different problem, namely the elliptic curve discrete logarithm problem (ECDLP).
In this Master’s thesis elliptic curve cryptography is discussed in greater depth - how it works, and whether it’s better suited to be used than the nowadays widely used RSA. It describes the elliptic curve cryptography and RSA implementations used to compare these two cryptosystems.
ECC offers considerably greater security for a smaller key size; this makes possible much more compact implementations for a given level of security, which means faster cryptographic operations, running on smaller chips or more compact software. This means less heat production and less power consumption.