A structural comparison of the computational difficulty of breaking discrete log cryptosystems

DOI10.1007/S001459900033MaRDI QIDQ1382147zbMATH OpenOpenAlexFDO

Authors Kouichi Sakurai, Hiroki Shuzuya

Publication date 3 January 1999

Published in Journal of Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s001459900033

zbMATH Keywords

reducibilitydiscrete logarithmrelative complexitycryptographic scheme

Mathematics Subject Classification ID

Cryptography (94A60) Theory of computing (68Q99)

Recommendations

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

Cited in

(3)

• \texttt{NP}-complete sets for computing discrete logarithms and integer factorization
• Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
• Weakness of $\mathbb{F}_{3^{6 \cdot 509}}$ for Discrete Logarithm Cryptography

This page was built for publication: A structural comparison of the computational difficulty of breaking discrete log cryptosystems

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