====== ECC ======

===== Elliptic Curve Cryptography =====

Cryptographie sur les courbes elliptiques.

The Lenstra elliptic curve factorization or the elliptic curve factorization method ( ECM).

Elliptic Curve Discrete Logarithm Problem (ECDLP).

An elliptic curve is an equation of the form y^2=x^3 + ax + b (sort of, technically the full form is slightly more general but they can more or less all be reduced to this case).

Appliqué à la crypto avec le problème du logarithme discret, l'équation devient: y^2 mod p = (x^3+ax+b) mod p.

Voir:
  * [[wpfr>Cryptographie_sur_les_courbes_elliptiques]]
  * [[http://www.techno-science.net/?onglet=glossaire&definition=6158]]
  * [[http://fr.wikipedia.org/wiki/Algorithme_de_Schoof|Algorithme de Schoof]] sur Wikipedia (fr).
  * [[http://it.slashdot.org/story/09/07/12/1620240/New-Elliptic-Curve-Cryptography-Record|Solving a 112-bit Prime Elliptic Curve Discrete Logarithm Problem on Game Consoles using Sloppy Reduction]]

Implémentations en Javascript... Introuvable pour de la crypto, par contre quelques démos de calcul:
  * [[http://vorlon.case.edu/~lxl106/gfeccalc.htm|GF(2m) Elliptic Curve Calculator]]
  * [[http://www.alpertron.com.ar/ECM.HTM|Factorization using the Elliptic Curve Method]]