| HAL : hal-00671948, version 1 |
| arXiv : 1202.4285 |
| Voir la fiche détaillée | BibTeX,EndNote,... |
|
|
| Algorithmic Number Theory Symposium, San Diego : États-Unis (2012) |
|
|
| Versions disponibles | v1 (20-02-2012) | v2 (04-09-2012) |
|
|
|
|
| Finding ECM-friendly curves through a study of Galois properties |
|
|
| Razvan Barbulescu 1Joppe W. Bos 2 |
|
|
| (20/02/2012) |
|
|
| In this paper we prove some divisibility properties of the cardinality of elliptic curves modulo primes. These proofs explain the good behavior of certain parameters when using Montgomery or Edwards curves in the setting of the elliptic curve method (ECM) for integer factorization. The ideas of the proofs help us to find new families of elliptic curves with good division properties which increase the success probability of ECM. |
|
|
|
|
|
|
|
|
|
|
| 1 : | CARAMEL (INRIA Nancy - Grand Est / LORIA) |
| INRIA – CNRS : UMR7503 – Université de Lorraine | |
| 2 : | Laboratory for Cryptologic Algorithms (LACAL) |
| École Polytechnique Fédérale de Lausanne | |
| 3 : | Microsoft Research [Redmond] |
| Microsoft | |
|
|
|
|
|
|
|
|
| CARAMEL |
|
|
|
|
| Domaine | : | Informatique/Cryptographie et sécurité Informatique/Arithmétique des ordinateurs Mathématiques/Théorie des nombres |
|
|
| Elliptic Curve Method (ECM) – Edwards curves – Montgomery curves – torsion properties – Galois groups |
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|
|
| hal-00671948, version 1 | |
| http://hal.inria.fr/hal-00671948 | |
| oai:hal.inria.fr:hal-00671948 | |
| Contributeur : Razvan Barbulescu | |
| Soumis le : Lundi 20 Février 2012, 09:47:24 | |
| Dernière modification le : Vendredi 20 Avril 2012, 17:21:03 | |