The Group Law On Elliptic Curves

  • Andreas Enge


Elliptic curves can be equipped with an efficiently computable group law, so that they are suited for implementing the cryptographic schemes of the previous chapter, as suggested first in [Koblitz, 1987] and [Miller, 1986]. They are particularly appealing because they achieve the same level of security as a finite field based cryptosystem with much shorter key lengths, which results in a faster encryption and decryption process. Our aim in this chapter is to prove the group law.


Rational Function Normal Form Elliptic Curve Local Ring Elliptic Curf 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1999

Authors and Affiliations

  • Andreas Enge
    • 1
  1. 1.Universität AugsburgGermany

Personalised recommendations