On the Complexity of Computing Discrete Logarithms over Algebraic Tori

被引：0
|
作者：
Isobe, Shuji [1 ]
Koizumi, Eisuke [1 ]
Nishigaki, Yuji [1 ]
Shizuya, Hiroki [1 ]
机构：
[1] Tohoku Univ, Grad Sch Informat Sci, Sendai, Miyagi 9808576, Japan
来源：
CRYPTOLOGY AND NETWORK SECURITY, PROCEEDINGS | 2009年 / 5888卷
关键词：
algebraic ton; order certified discrete logarithms; Tuning reduction; CRYPTOGRAPHY; CRYPTOSYSTEMS;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
This paper studies the complexity of computing discrete logarithms oven algebraic ton We show that the ordel certified version of the disciete logarithm over general finite fields (OCDL in symbols) reduces to the discrete logarithm over algebraic ton (TDL, in symbols) with respect to the polynomial-nine Turing leducibility This reduction means that if the integer factorization can be computed in polynomial time, then TDL is equivalent to the discrete logarithm DL over general finite fields with respect to the Turing reducibility
引用
收藏
页码：433 / 442
页数：10
相关论文
共 50 条
12345