scientific article; zbMATH DE number 4187705

MaRDI QIDQ5752487zbMATH OpenFDO

Authors Bert Den Boer

Publication date 1990

zbMATH Keywords

cryptographyDiffie-Hellman key exchange protocoldiscrete logarithms

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1406786
• On the connection between the discrete logarithms and the Diffie-Hellman problem
• Discrete logarithms, Diffie-Hellman, and reductions
• The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
• Oracle-assisted static Diffie-Hellman is easier than discrete logarithms
• Another look at non-standard discrete log and Diffie-Hellman problems
• On the complexity of the discrete logarithm and Diffie-Hellman problems
• Advances in Cryptology - CRYPTO 2003
• Public Key Cryptography - PKC 2006
• The security of all RSA and discrete log bits

Cited in

(19)

• A structural comparison of the computational difficulty of breaking discrete log cryptosystems
• Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring
• On the distribution of the Diffie-Hellman pairs
• Improved lower bound for Diffie-Hellman problem using multiplicative group of a finite field as auxiliary group
• Safety in numbers: on the need for robust Diffie-Hellman parameter validation
• On the connection between the discrete logarithms and the Diffie-Hellman problem
• Security Analysis of the Strong Diffie-Hellman Problem
• The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
• scientific article; zbMATH DE number 1024034 (Why is no real title available?)
• scientific article; zbMATH DE number 1406786 (Why is no real title available?)
• Progress in Cryptology - INDOCRYPT 2003
• Algebraic curves and cryptography
• Discrete logarithm problems with auxiliary inputs
• Full quantum equivalence of group action DLog and CDH, and more
• Cryptographic multilinear maps using pro-p groups
• Full quantum equivalence of group action DLog and CDH, and more
• Revisiting discrete logarithm reductions
• Discrete logarithms, Diffie-Hellman, and reductions
• Fast generators for the Diffie-Hellman key agreement protocol and malicious standards

This page was built for publication:

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