## Public Key Cryptosystems using Elliptic Curves (1997)

Citations: | 1 - 0 self |

### BibTeX

@MISC{Borst97publickey,

author = {J. Borst},

title = {Public Key Cryptosystems using Elliptic Curves},

year = {1997}

}

### OpenURL

### Abstract

This report is a survey on public key cryptosystems that use the theory of elliptic curves. A considerable part will be about the theory of elliptic curves. Encryption systems, digital signature schemes and key agreement schemes using elliptic curves will be described. Their workload and bandwidth will be addressed and some attacks will be described. For all systems the security is based either on the elliptic curve discrete logarithm problem or on the difficulty of factorization. The differences between conventional and elliptic curve systems shall be addressed. Systems based on the elliptic curve discrete logarithm problem can be used with shorter keys to provide the same security, compared to similar conventional systems. Elliptic curve systems based on factoring are slightly more resistant as conventional systems against some attacks.