Intractable problems in cryptography

MaRDI QIDQ3062282zbMATH OpenFDO

Authors Neal Koblitz, Alfred Menezes

Publication date 3 January 2011

zbMATH Keywords

Diffie-Hellman problemsecurity of cryptographic protocolsDiscrete Log problem

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Recommendations

• Fundamental problems in provable security and cryptography
• The brave new world of bodacious assumptions in cryptography
• On the complexity of the discrete logarithm and Diffie-Hellman problems
• scientific article; zbMATH DE number 4053510
• Publication:3211422

Cited in

(6)

• Recent progress on the elliptic curve discrete logarithm problem
• Bootstrapping for approximate homomorphic encryption
• Fundamental problems in provable security and cryptography
• Hierarchical deterministic bitcoin wallets that tolerate key leakage
• Cryptoschemes based on difficulty of simultaneous solving two different difficult problems
• An authenticated key scheme over elliptic curves for topological networks

This page was built for publication: Intractable problems in cryptography

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