| J. Borst. Public key cryptosystems using elliptic curves. Master's thesis, Eindhoven University of Technology, Feb. 1997. |
....key cryptosystems based on elliptic curves [9, 16] These cryptosystems rely on the difficulty to solve the discrete logarithm problem for elliptic curves. Other cryptosystems based on the same problem have been proposed thereafter. We refer to [15] for more information. A more recent overview is [1]. Koyama, Maurer, Okamoto and Vanstone proposed another kind of elliptic curve based cryptosystems [11] Their schemes are based on the difficulty of factoring large numbers and are similar to RSA and the Rabin scheme. The most practical of these schemes (Type 1) is generally called the KMOV ....
J. Borst. Public key cryptosystems using elliptic curves. Master's thesis, Eindhoven University of Technology, Feb. 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC