Parametrizations for Families of ECM-Friendly Curves
| Autor: | Thorsten Kleinjung, Alexandre Gélin, Arjen K. Lenstra |
|---|---|
| Přispěvatelé: | ALgorithms for coMmunicAtion SecuriTY (ALMASTY), Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Laboratory for Cryptologic Algorithms (LACAL), Ecole Polytechnique Fédérale de Lausanne (EPFL) |
| Rok vydání: | 2017 |
| Předmět: |
Discrete mathematics
010102 general mathematics Hessian form of an elliptic curve 02 engineering and technology 01 natural sciences Lenstra elliptic curve factorization Supersingular elliptic curve [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR] Elliptic curve Family of curves 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing 0101 mathematics Schoof's algorithm Tripling-oriented Doche–Icart–Kohel curve Division polynomials Mathematics |
| Zdroj: | Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation-ISSAC 17 Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation -ISSAC '17 ISSAC Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, Kaiserslautern, Germany, July 25-28, 2017 ISSAC 2017 The 42nd International Symposium on Symbolic and Algebraic Computation ISSAC 2017 The 42nd International Symposium on Symbolic and Algebraic Computation, Jul 2017, Kaiserslautern, Germany. pp.165--171, ⟨10.1145/3087604.3087606⟩ Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation |
| DOI: | 10.1145/3087604.3087606 |
| Popis: | International audience; We provide a new family of elliptic curves that results in a one to two percent performance improvement of the elliptic curve integer factoriza-tion method. The speedup is confirmed by extensive tests for factors ranging from 15 to 63 bits. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|