scientific article; zbMATH DE number 1951620
From MaRDI portal
Publication:4413871
Recommendations
Cited in
(23)- The twin Diffie-Hellman problem and applications
- Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring
- Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups
- Polynomial interpolation of the Naor-Reingold pseudo-random function
- scientific article; zbMATH DE number 1618043 (Why is no real title available?)
- DDH-like assumptions based on extension rings
- On relationship of computational Diffie-Hellman problem and computational square-root exponent problem
- A cryptographic primitive based on hidden-order groups
- A Note on Chosen-Basis Decisional Diffie-Hellman Assumptions
- Another look at non-standard discrete log and Diffie-Hellman problems
- A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness
- The co-Diffie-Hellman problem over elliptic curves
- scientific article; zbMATH DE number 1186931 (Why is no real title available?)
- scientific article; zbMATH DE number 2086715 (Why is no real title available?)
- scientific article; zbMATH DE number 1857540 (Why is no real title available?)
- Easy Decision Diffie-Hellman Groups
- Advances in Cryptology - EUROCRYPT 2004
- The Twin Diffie-Hellman Problem and Applications
- Public Key Cryptography - PKC 2005
- Algorithmic Number Theory
- Public Key Cryptography – PKC 2004
- The \(l\)-th power Diffie-Hellman problem and the \(l\)-th root Diffie-Hellman problem
- The Diffie-Hellman key exchange protocol and non-Abelian nilpotent groups
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 Q4413871)