On Computing Logarithms Over Finite Fields
From MaRDI portal
Publication:3719828
DOI10.1007/3-540-39799-X_28zbMath0591.68045MaRDI QIDQ3719828
Publication date: 1986
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
cyclotomic fieldcryptologycyclotomic extensionsubexponential time algorithmscomputing logarithms over finite fields
Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items
Reusing nonces in Schnorr signatures (and keeping it secure...), Backtracking-assisted multiplication, Optimal Randomness Extraction from a Diffie-Hellman Element