Discrete logarithms, Diffie-Hellman, and reductions

MaRDI QIDQ763576zbMATH OpenFDO

Authors Neal Koblitz, Igor E. Shparlinski, Alfred Menezes

Publication date 29 March 2012

Published in Vietnam Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

discrete logarithm problemRiemann hypothesispolynomial timeprime numbersinteger factorizationsmooth numbersDiffie-Hellman problemyes-or-no oracle

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• scientific article; zbMATH DE number 4187705
• On the complexity of the discrete logarithm and Diffie-Hellman problems
• The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
• On the connection between the discrete logarithms and the Diffie-Hellman problem
• scientific article; zbMATH DE number 1722682

Cited in

(10)

• scientific article; zbMATH DE number 4187705 (Why is no real title available?)
• Reduction of the integer factorization complexity upper bound to the complexity of the Diffie-Hellman problem
• Another look at non-standard discrete log and Diffie-Hellman problems
• On reducing factorization to the discrete logarithm problem modulo a composite
• Short paper: The proof is in the pudding. Proofs of work for solving discrete logarithms
• Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
• Progress in Cryptology - INDOCRYPT 2004
• A simpler and more efficient reduction of DLog to CDH for abelian group actions
• Finding elliptic curves with a subgroup of prescribed size
• Weakness of $\mathbb{F}_{3^{6 \cdot 509}}$ for Discrete Logarithm Cryptography

This page was built for publication: Discrete logarithms, Diffie-Hellman, and reductions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763576)