On the Discrete Logarithm Problem on Algebraic Tori

DOI10.1007/11535218_5zbMATH Open1145.94442OpenAlexW2136830460MaRDI QIDQ5451019FDOQ5451019

Authors: Robert Granger, Frederik Vercauteren 

Publication date: 17 March 2008

Published in: Advances in Cryptology – CRYPTO 2005 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11535218_5

Recommendations

• scientific article; zbMATH DE number 2154291
• Algebraic groups and discrete logarithm
• A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
• Algorithms to solve the finite field discrete logarithm problem
• On the Complexity of Computing Discrete Logarithms over Algebraic Tori

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cited In (14)

• Index calculus attack for Jacobian of hyperelliptic curves of small genus using two large primes
• Index calculus in the trace zero variety
• Performance analysis of index calculus method
• Title not available (Why is that?)
• On the Complexity of Computing Discrete Logarithms over Algebraic Tori
• Computing discrete logarithms in \(\mathbb F_{p^6}\)
• Point compression for the trace zero subgroup over a small degree extension field
• Applications to cryptography of twisting commutative algebraic groups
• Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
• Title not available (Why is that?)
• Algorithms to solve the finite field discrete logarithm problem
• The Function Field Sieve in the Medium Prime Case
• Analysis of possible pre-computation aided DLP solving algorithms
• Algorithmic Number Theory

Uses Software

• FGb

This page was built for publication: On the Discrete Logarithm Problem on Algebraic Tori

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