On computing discrete logarithms in bulk and randomness extractors

DOI10.3233/FI-2015-1279MaRDI QIDQ3187049zbMATH OpenOpenAlexFDO

Authors Konrad Durnoga, Bartosz Źrałek

Publication date 15 August 2016

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2015-1279

zbMATH Keywords

baby-step giant-step methodfinite fieldnumber-theoretic construction of non-malleable extractorprimitive elementproblem of computing deterministically discrete logarithms

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Combinatorial codes (94B25) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Recommendations

• Randomness extraction in finite fields F_{p^n}
• Optimal Randomness Extraction from a Diffie-Hellman Element
• Simultaneous Security of Bits in the Discrete Log

Cited in

(2)

• Short paper: The proof is in the pudding. Proofs of work for solving discrete logarithms
• A Kilobit Hidden SNFS Discrete Logarithm Computation

This page was built for publication: On computing discrete logarithms in bulk and randomness extractors

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