Scholarlink

In 2022, Moriya, Onuki, Aikawa, and Takagi proposed a new framework named generalized Montgomery coordinates to treat one-coordinate type formulas to compute isogenies. This framework generalizes some already known one-coordinate type formulas of elliptic curves. Their result shows that a formula to compute image points under isogenies is unique in the framework of generalized Montogmery coordinates; however, a formula to compute image curves is not unique. Therefore, we have a question: What formula is the most efficient to compute image curves in the framework of generalized Montogmery coordinates? In this paper, we analyze the costs of formulas to compute image curves of 3-isogenies in the framework of generalized Montgomery coordinates. From our result, the lower bound of the costs is \(1\textbf{M}+1\textbf{S}\) as a formula whose output and input are in affine coordinates, \(2\textbf{S}\) as an affine formula whose output is projective, and \(2\textbf{M}+3\textbf{S}\) as a projective formula.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Lower Bounds of Costs of 3-Isogenies Formulas in the Framework of Generalized Montgomery Coordinates

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Tomoki Moriya,
  • Hiroshi Onuki,
  • Yusuke Aikawa,
  • Tsuyoshi Takagi

摘要

In 2022, Moriya, Onuki, Aikawa, and Takagi proposed a new framework named generalized Montgomery coordinates to treat one-coordinate type formulas to compute isogenies. This framework generalizes some already known one-coordinate type formulas of elliptic curves. Their result shows that a formula to compute image points under isogenies is unique in the framework of generalized Montogmery coordinates; however, a formula to compute image curves is not unique. Therefore, we have a question: What formula is the most efficient to compute image curves in the framework of generalized Montogmery coordinates? In this paper, we analyze the costs of formulas to compute image curves of 3-isogenies in the framework of generalized Montgomery coordinates. From our result, the lower bound of the costs is \(1\textbf{M}+1\textbf{S}\) as a formula whose output and input are in affine coordinates, \(2\textbf{S}\) as an affine formula whose output is projective, and \(2\textbf{M}+3\textbf{S}\) as a projective formula.