On Computing Discrete Logarithms in Bulk and Randomness Extractors

DOI10.3233/FI-2015-1279zbMath1401.94152OpenAlexW2283490837MaRDI QIDQ3187049

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

finite fieldprimitive elementbaby-step giant-step methodnumber-theoretic construction of non-malleable extractorproblem of computing deterministically discrete logarithms

Mathematics Subject Classification ID

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

This page was built for publication: On Computing Discrete Logarithms in Bulk and Randomness Extractors