An integer factoring algorithm based on elliptic divisibility sequences

スポンサーリンク

概要

• 論文の詳細を見る

• In 1948, Ward defined elliptic divisibility sequences satisfying a certain recurrence relation. An elliptic divisibility sequence arises from any choice of elliptic curve and initial point on that curve. In this paper, we propose a factorization algorithm based on elliptic divisibility sequences. We then discuss our implementations of the algorithm and its optimization, and estimate the computational complexity.

• The Japan Society for Industrial and Applied Mathematicsの論文

著者

• UCHIYAMA Shigenori

  Tokyo Metropolitan University

• OGURA Naoki

  Tokyo Metropolitan University

• Sakurada Naotoshi

  Tokyo Metropolitan University

• Yarimizu Junichi

  Tokyo Metropolitan University

関連論文

• The Vanstone-Zuccherato Schemes Revisited(Information Security)
• Simple Remarks on Carmichael Numbers
• On Patarin's Attack against the lIC Scheme
• On the reduction attack against the algebraic surface public-key cryptosystem(ASC04)
• An integer factoring algorithm based on elliptic divisibility sequences

スポンサーリンク