Discrete logarithms, Diffie-Hellman, and reductions

zbMATH Open1277.94029MaRDI QIDQ763576FDOQ763576

Igor E. Shparlinski, Alfred Menezes, Neal Koblitz

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)

Cited In (7)

• Title not available (Why is that?)
• Reduction of the integer factorization complexity upper bound to the complexity of the Diffie-Hellman problem
• 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
• 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)