Computing 2-isogenies between Kummer lines

Damien Robert, Nicolas Sarkis
{"title":"Computing 2-isogenies between Kummer lines","authors":"Damien Robert, Nicolas Sarkis","doi":"10.62056/abvua69p1","DOIUrl":null,"url":null,"abstract":"<jats:p> We use theta groups to study <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\n <mml:mrow>\n <mml:mn>2</mml:mn>\n </mml:mrow>\n </mml:math>-isogenies between Kummer lines, with a particular focus on the Montgomery model. This allows us to recover known formulas, along with more efficient forms for translated isogenies, which require only <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\n <mml:mrow>\n <mml:mn>2</mml:mn>\n <mml:mi>S</mml:mi>\n <mml:mo>+</mml:mo>\n <mml:mn>2</mml:mn>\n <mml:msub>\n <mml:mi>m</mml:mi>\n <mml:mn>0</mml:mn>\n </mml:msub>\n </mml:mrow>\n </mml:math> for evaluation. We leverage these translated isogenies to build a hybrid ladder for scalar multiplication on Montgomery curves with rational <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\n <mml:mrow>\n <mml:mn>2</mml:mn>\n </mml:mrow>\n </mml:math>-torsion, which cost <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\n <mml:mrow>\n <mml:mn>3</mml:mn>\n <mml:mi>M</mml:mi>\n <mml:mo>+</mml:mo>\n <mml:mn>6</mml:mn>\n <mml:mi>S</mml:mi>\n <mml:mo>+</mml:mo>\n <mml:mn>2</mml:mn>\n <mml:msub>\n <mml:mi>m</mml:mi>\n <mml:mn>0</mml:mn>\n </mml:msub>\n </mml:mrow>\n </mml:math> per bit, compared to <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\n <mml:mrow>\n <mml:mn>5</mml:mn>\n <mml:mi>M</mml:mi>\n <mml:mo>+</mml:mo>\n <mml:mn>4</mml:mn>\n <mml:mi>S</mml:mi>\n <mml:mo>+</mml:mo>\n <mml:mn>1</mml:mn>\n <mml:msub>\n <mml:mi>m</mml:mi>\n <mml:mn>0</mml:mn>\n </mml:msub>\n </mml:mrow>\n </mml:math> for the standard Montgomery ladder. </jats:p>","PeriodicalId":508905,"journal":{"name":"IACR Cryptol. ePrint Arch.","volume":"7 2","pages":"37"},"PeriodicalIF":0.0000,"publicationDate":"2024-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IACR Cryptol. ePrint Arch.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.62056/abvua69p1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We use theta groups to study 2 -isogenies between Kummer lines, with a particular focus on the Montgomery model. This allows us to recover known formulas, along with more efficient forms for translated isogenies, which require only 2 S + 2 m 0 for evaluation. We leverage these translated isogenies to build a hybrid ladder for scalar multiplication on Montgomery curves with rational 2 -torsion, which cost 3 M + 6 S + 2 m 0 per bit, compared to 5 M + 4 S + 1 m 0 for the standard Montgomery ladder.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
计算库默线之间的 2-isogenies
我们使用 Theta 群来研究库默尔线间的 2 -同源关系,尤其侧重于蒙哥马利模型。这使我们能够恢复已知公式,以及更有效的翻译同源形式,只需 2 S + 2 m 0 即可进行评估。我们利用这些翻译同源建立了一个混合梯子,用于具有有理 2 -扭转的蒙哥马利曲线上的标量乘法,每比特的成本为 3 M + 6 S + 2 m 0,而标准蒙哥马利梯子的成本为 5 M + 4 S + 1 m 0。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
MOSFHET: Optimized Software for FHE over the Torus 1/0 Shades of UC: Photonic Side-Channel Analysis of Universal Circuits White-box filtering attacks breaking SEL masking: from exponential to polynomial time Optimized Homomorphic Evaluation of Boolean Functions Time Sharing - A Novel Approach to Low-Latency Masking
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1