Primality testing using elliptic curves
From MaRDI portal
Publication:3158545
DOI10.1145/320211.320213zbMath1064.11503OpenAlexW2126295036MaRDI QIDQ3158545
Publication date: 25 January 2005
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/320211.320213
Applications to coding theory and cryptography of arithmetic geometry (14G50) Elliptic curves over local fields (11G07) Primality (11Y11)
Related Items
Spreading alerts quietly and the subgroup escape problem ⋮ Knottedness is in NP, modulo GRH ⋮ Metrics on the sets of nonsupersingular elliptic curves in simplified Weierstrass form over finite fields of characteristic two ⋮ Primality Tests Using Algebraic Groups ⋮ Huff’s Model for Elliptic Curves ⋮ A framework for deterministic primality proving using elliptic curves with complex multiplication ⋮ Some remarks on primality proving and elliptic curves ⋮ Arithmetic of the level four theta model of elliptic curves ⋮ Proving primality in essentially quartic random time ⋮ Implementing the asymptotically fast version of the elliptic curve primality proving algorithm ⋮ Prime Number Generation Based On Pocklington's Theorem ⋮ Ranks of elliptic curves
