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 条

[11] Computing Low-Weight Discrete Logarithms
Kacsmar, Bailey
Plosker, Sarah
Henry, Ryan
SELECTED AREAS IN CRYPTOGRAPHY - SAC 2017, 2018, 10719 : 106 - 126
[12] Computing discrete logarithms with the parallelized kangaroo method
Teske, E
DISCRETE APPLIED MATHEMATICS, 2003, 130 (01) : 61 - 82
[13] ON COMPUTING ALGEBRAIC-FUNCTIONS USING LOGARITHMS AND EXPONENTIALS
GRIGORIEV, D
SINGER, M
YAO, A
SIAM JOURNAL ON COMPUTING, 1995, 24 (02) : 242 - 246
[14] Computing Discrete Logarithms in Fp6
Gremy, Laurent
Guillevic, Aurore
Morain, Francois
Thome, Emmanuel
SELECTED AREAS IN CRYPTOGRAPHY - SAC 2017, 2018, 10719 : 85 - 105
[15] Computing discrete logarithms with quadratic number rings
Weber, D
ADVANCES IN CRYPTOLOGY - EUROCRYPT '98, 1998, 1403 : 171 - 183
[16] Improved Pollard rho method for computing discrete logarithms over finite extension fields
Wang, Ping
Zhang, Fangguo
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2012, 236 (17) : 4336 - 4343
[17] Integral Models of Algebraic Tori Over Fields of Algebraic Numbers
Grekhov M.V.
Journal of Mathematical Sciences, 2016, 219 (3) : 413 - 426
[18] Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions
Rotem, Lior
Segev, Gil
THEORY OF CRYPTOGRAPHY, TCC 2020, PT III, 2020, 12552 : 366 - 389
[19] A SUBEXPONENTIAL-TIME ALGORITHM FOR COMPUTING DISCRETE LOGARITHMS OVER GF(P2)
ELGAMAL, T
IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (04) : 473 - 481
[20] Computing elliptic curve discrete logarithms with the negation map
Wang, Ping
Zhang, Fangguo
INFORMATION SCIENCES, 2012, 195 : 277 - 286

← 1 2 3 4 5 →