Algorithms That Use Elliptic Curves
Elliptic curves over finite fields are used in some cryptographic applications as well as for integer factorization. Typically, the general idea in these applications is that a known algorithm which makes use of certain finite groups is rewritten to use the groups of rational points of elliptic curves. For more see also:
- Elliptic curve cryptography
- Elliptic Curve DSA
- Lenstra elliptic curve factorization
- Elliptic curve primality proving
Read more about this topic: Elliptic Curve
Famous quotes containing the word curves:
“One way to do it might be by making the scenery penetrate the automobile. A polished black sedan was a good subject, especially if parked at the intersection of a tree-bordered street and one of those heavyish spring skies whose bloated gray clouds and amoeba-shaped blotches of blue seem more physical than the reticent elms and effusive pavement. Now break the body of the car into separate curves and panels; then put it together in terms of reflections.”
—Vladimir Nabokov (1899–1977)