Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Elliptic curve
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Algorithms that use elliptic curves== Elliptic curves over finite fields are used in some [[cryptography|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 Diffie–Hellman]] key exchange (ECDH) ** [[Supersingular isogeny key exchange]] ** [[Elliptic Curve Digital Signature Algorithm|Elliptic curve digital signature algorithm]] (ECDSA) ** [[EdDSA]] digital signature algorithm ** [[Dual EC DRBG]] random number generator * [[Lenstra elliptic-curve factorization]] * [[Elliptic curve primality proving]]
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)