Elliptic Curves over Finite Fields
1993
Elliptic curves have been intensively studied in algebraic geometry and number theory. Recently, they have been used in devising efficient algorithms for factoring integers [8, 9], for primality proving [2, 11, 12] and for the construction of pseudorAndom bit generators [4]. In Chapter 8 we study how elliptic curves can be used in constructing efficient and secure cryptosystems, while in Chapter 10 we will discuss how good error-correcting codes may be obtained by using elliptic curves.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
11
References
0
Citations
NaN
KQI