A hyperelliptic smoothness test. I

DOI10.1098/rsta.1993.0138zbMath0808.11073OpenAlexW2110640335MaRDI QIDQ4287023

Hendrik W. jun. Lenstra, Jonathan Pila, Carl B. Pomerance

Publication date: 9 March 1995

Published in: Philosophical Transactions of the Royal Society of London. Series A: Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1098/rsta.1993.0138

zbMATH Keywords

probabilistic algorithmsmooth numberssmall prime factorsfactorization of smooth numbershyperelliptic curve method

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05)

Related Items (11)

Compositeness test with nodal curves ⋮ Finding elliptic curves with a subgroup of prescribed size ⋮ A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point ⋮ Three Cousins of Recaman's Sequence ⋮ Analysis of the fault attack ECDLP over prime field ⋮ Faster individual discrete logarithms in finite fields of composite extension degree ⋮ Rigorous analysis of a randomised number field sieve ⋮ Finding the group structure of elliptic curves over finite fields ⋮ Detecting perfect powers in essentially linear time ⋮ Complexity of inverting the Euler function ⋮ Computing endomorphism rings of elliptic curves under the GRH

This page was built for publication: A hyperelliptic smoothness test. I