Elliptic curve cryptosystems

Abstract

In the last 15 years much research has been done concerning practical applications of elliptic curves like integer factorization (Lenstra, Ann Math 126:649–673, 1987, [46]), primality proving (Atkin and Morain, Math Comput 61(205):29–68, 1993, [3]), algebraic geometry codes (van Lint and van der Geer, DMV Seminar, vol 12, 1988, [89]) and public-key cryptosystems (Koblitz, Math Comput 48(177):203–209, 1987, [36], Miller, Advances in Cryptology—CRYPTO ’85, 1986, pp 417–426 [58]).