Efficient Algorithms for Isogeny Sequences and Their Cryptographic Applications
Efficient Algorithms for Isogeny Sequences and Their Cryptographic Applications
复制标题
同源序列的高效算法及其密码应用
DOI：
--
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
K. Takashima
中科院分区：
文献类型：
--
作者：
K. Takashima
总结了椭圆雅可比和亏格2雅可比上高效的同源序列计算。出于密码学的目的，低度同源序列很重要。然后，我们重点研究椭圆曲线上的2-和3-同源序列以及2亏格Jacobian上的(2，2)-和(3，3)-同源序列。我们的目标是显式地描述低次同源序列计算，并改进它们以用于后量子密码系统和离散对数问题的随机自约性(DLP)等密码学应用。
We summarize efficient isogeny sequence computations on elliptic and genus 2 Jacobians. For cryptographic purposes, sequences of low-degree isogenies are important. Then we focus on sequences of 2- and 3-isogenies on elliptic curves and (2, 2)- and (3, 3)-isogenies on genus 2 Jacobians. Our aim is to explicitly describe the low-degree isogeny sequence computations and improve them for cryptographic applications such as post-quantum cryptosystems and random self-reducibility of discrete logarithm problem (DLP).