The Past, Evolving Present, and Future of the Discrete Logarithm

DOI10.1007/978-3-319-10683-0_2zbMath1314.94006OpenAlexW402685281MaRDI QIDQ5255841

Cécile Pierrot, Antoine Joux, Andrew M. Odlyzko

Publication date: 22 June 2015

Published in: Open Problems in Mathematics and Computational Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-10683-0_2

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) History of mathematics in the 20th century (01A60) Cryptography (94A60) History of information and communication theory (94-03)

Related Items (11)

A new authentication procedure for client-server applications using HMAC ⋮ Bootstrapping for approximate homomorphic encryption ⋮ Type-II polyadic constacyclic codes over finite fields ⋮ Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity ⋮ ON BOUNDS FOR BALANCED EMBEDDING DEGREE ⋮ Indiscreet logarithms in finite fields of small characteristic ⋮ A new generalization of the KMOV cryptosystem ⋮ Curves, Jacobians, and cryptography ⋮ Interpolation of the Zech's logarithm: explicit forms ⋮ Computing groups of Hecke characters ⋮ Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs

This page was built for publication: The Past, Evolving Present, and Future of the Discrete Logarithm