An integer factoring algorithm based on elliptic divisibility sequences

DOI10.14495/JSIAML.4.21zbMath1271.65151OpenAlexW2100346102MaRDI QIDQ2843204

Naoki Ogura, Shigenori Uchiyama, Junichi Yarimizu, Naotoshi Sakurada

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 complexityfactorization algorithmrecurrence relationelliptic curveelliptic divisibility sequenceelliptic curve method

Mathematics Subject Classification ID

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

Related Items (1)

The elliptic curve Diffie-Hellman problem and an equivalent hard problem for elliptic divisibility sequences

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