An integer factoring algorithm based on elliptic divisibility sequences

DOI10.14495/JSIAML.4.21MaRDI QIDQ2843204zbMATH OpenOpenAlexFDO

Authors Naotoshi Sakurada, Junichi Yarimizu, Naoki Ogura, Shigenori Uchiyama

Publication date 9 August 2013

Published in JSIAM Letters (Search for Journal in Brave)

Full work available at URL https://www.jstage.jst.go.jp/A_PRedirectJournalInit?sryCd=jsiaml&kijiCd=4_21&screenID=AF06S010&noVol=4&noIssue=0

zbMATH Keywords

computational complexityelliptic curveelliptic curve methodelliptic divisibility sequencefactorization algorithmrecurrence relation

Mathematics Subject Classification ID

Curves over finite and local fields (11G20) Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Algorithm of factorization based on elliptic curve
• scientific article; zbMATH DE number 784875
• scientific article; zbMATH DE number 3959522
• Factoring integers with elliptic curves
• A deterministic algorithm for integer factorization
• scientific article; zbMATH DE number 515378
• An exponent one-fifth algorithm for deterministic integer factorisation
• Elliptic curve and integer factorization

Cited in

(3)

• A deterministic algorithm for integer factorization
• The elliptic curve Diffie-Hellman problem and an equivalent hard problem for elliptic divisibility sequences
• A simplified proof of Ward's formula for elliptic sequences

This page was built for publication: An integer factoring algorithm based on elliptic divisibility sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2843204)