On the Complexity of Computing Discrete Logarithms over Algebraic Tori

DOI10.1007/978-3-642-10433-6_29MaRDI QIDQ3648478zbMATH OpenOpenAlexFDO

Authors Shuji Isobe, Eisuke Koizumi, Yuji Nishigaki, Hiroki Shuzuya

Publication date 26 November 2009

Published in Cryptology and Network Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10433-6_29

zbMATH Keywords

algebraic toriorder certified discrete logarithmsTuring reduction

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Symbolic computation and algebraic computation (68W30) Cryptography (94A60)

Recommendations

• On the Discrete Logarithm Problem on Algebraic Tori
• Computation of discrete logarithms in an arbitrary finite field
• On asymptotic complexity of computing discrete logarithms over GF(p)
• Computing discrete logarithms in \(\mathbb F_{p^6}\)
• On the discrete logarithm problem in finite fields of fixed characteristic

Cited in

(1)

• On the Discrete Logarithm Problem on Algebraic Tori

This page was built for publication: On the Complexity of Computing Discrete Logarithms over Algebraic Tori

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3648478)