Computing Small Discrete Logarithms Faster

DOI10.1007/978-3-642-34931-7_19zbMath1295.94022OpenAlexW2128141215MaRDI QIDQ2876940

Daniel J. Bernstein, Tanja Lange

Publication date: 20 August 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-34931-7_19

zbMATH Keywords

random walksdiscrete logarithmsprecomputation

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm ⋮ Generic construction of trace-and-revoke inner product functional encryption ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ An optimal distributed discrete log protocol with applications to homomorphic secret sharing ⋮ Fully Secure Functional Encryption for Inner Products, from Standard Assumptions ⋮ Solving discrete logarithm problems faster with the aid of pre-computation

This page was built for publication: Computing Small Discrete Logarithms Faster