Parametrizations for Families of ECM-Friendly Curves | Zendy

Alexandre Gélin | Zendy; Thorsten Kleinjung | Zendy; Arjen K. Lenstra | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Parametrizations for Families of ECM-Friendly Curves

Author(s) -

Alexandre Gélin,

Thorsten Kleinjung,

Arjen K. Lenstra

Publication year - 2017

Publication title -

hal (le centre pour la communication scientifique directe)

Language(s) - English

Resource type - Conference proceedings

DOI - 10.1145/3087604.3087606

Subject(s) - speedup , elliptic curve , integer (computer science) , schoof's algorithm , factorization , division polynomials , computer science , parallel computing , counting points on elliptic curves , elliptic curve point multiplication , mathematics , algorithm , mathematical analysis , quarter period , operating system

International audienceWe 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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research