Computing Small Discrete Logarithms Faster
From MaRDI portal
Publication:2876940
DOI10.1007/978-3-642-34931-7_19zbMath1295.94022MaRDI 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
94A60: Cryptography
Related Items
An optimal distributed discrete log protocol with applications to homomorphic secret sharing, Recent progress on the elliptic curve discrete logarithm problem, Solving discrete logarithm problems faster with the aid of pre-computation, Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm, Fully Secure Functional Encryption for Inner Products, from Standard Assumptions