A new perspective on the powers of two descent for discrete logarithms in finite fields

DOI10.2140/obs.2019.2.343arXiv1805.00093MaRDI QIDQ6165875

Benjamin Wesolowski, Thorsten Kleinjung

Publication date: 2 August 2023

Published in: The Open Book Series (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.00093

zbMATH Keywords

finite fielddiscrete logarithm

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)

Related Items (1)

Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic

Cites Work

• Unnamed Item
• Weil bounds for singular curves
• A general framework for subexponential discrete logarithm algorithms
• On the Function Field Sieve and the Impact of Higher Splitting Probabilities
• A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic
• On the discrete logarithm problem in elliptic curves
• Generators and irreducible polynomials over finite fields
• On the discrete logarithm problem in finite fields of fixed characteristic

This page was built for publication: A new perspective on the powers of two descent for discrete logarithms in finite fields