|
|
| Line 1: |
Line 1: |
| == Summary ==
| |
|
| |
|
| This documentary gives a brief introduction into elliptic curve cryptography
| |
|
| |
| ==Elliptic Curve Cryptography ==
| |
|
| |
| Elliptic curve cryptography is a part of asymmetric cryptography, it is based on the mathematical hard problem to find a solution for the elliptic curve discrete logarithm. The calculations are performed on the algebraic structure of elliptic curves over finite fields, which means we compute points on a elliptic curve over finite field by applying the group operations double and add.
| |
|
| |
| The scalar multiplication of a point on an elliptic curve over a finite field is equivalent to the exponentation of a number in a prime field, therefore the inversion is also called discrete logarithm.
| |
|
| |
|
| |
| First proposed application of elliptic curves in cryptography was random number generations, now ECC is widely used for key establishment and digital signature schemes.
| |
|
| |
|
| |
| ==Elliptic Curve Presentations==
| |
|
| |
| * Weierstrass form
| |
| <math>x^2=y^3</math>
| |
|
| |
|
| |
|
| |
|
| |
| ==Standardized ECC==
| |
|
| |
|
| |
|
| |
| ==ECC problems==
| |
|
| |
|
| |
| [[Category:Basic]]
| |