The Group Law On Elliptic Curves
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.
KeywordsRational Function Normal Form Elliptic Curve Local Ring Elliptic Curf
Unable to display preview. Download preview PDF.