Discrete logarithms: The past and the future

DOI10.1023/A:1008350005447zbMath1033.11057OpenAlexW1618261469MaRDI QIDQ1976037

Andrew M. Odlyzko

Publication date: 8 May 2000

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008350005447

zbMATH Keywords

discrete logarithmsDiffie-Hellman key exchange algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items

Computation of lattice isomorphisms and the integral matrix similarity problem, Inverse problems of chaotic dynamics and statistical analysis in providing information security in communication systems and networks, Bootstrapping for approximate homomorphic encryption, Discrete logarithms for finite groups, Studying the performance of artificial neural networks on problems related to cryptography, RSA: a number of formulas to improve the search for \(p+q\), Generalized fraction-free \(LU\) factorization for singular systems with kernel extraction, Performance analysis of index calculus method, Generating more MNT elliptic curves, Speeding up exponentiation using an untrusted computational resource, Algorithmic problems in Engel groups and cryptographic applications, Indiscreet logarithms in finite fields of small characteristic, Решение систем линейных уравнений при вычислении логарифмов в конечном простом поле, Structure computation and discrete logarithms in finite abelian $p$-groups, On the Efficient Implementation of Pairing-Based Protocols, Interpolation of the Zech's logarithm: explicit forms, A new cryptosystem based on a twisted Hessian curve \(H^4_{a,d}\)