The following pages link to (Q5752487):
Displaying 13 items.
- Discrete logarithms, Diffie-Hellman, and reductions (Q763576) (← links)
- Fast generators for the Diffie-Hellman key agreement protocol and malicious standards (Q845702) (← links)
- A structural comparison of the computational difficulty of breaking discrete log cryptosystems (Q1382147) (← links)
- Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring (Q1606932) (← links)
- On the distribution of the Diffie-Hellman pairs (Q1609391) (← links)
- Improved lower bound for Diffie-Hellman problem using multiplicative group of a finite field as auxiliary group (Q1640704) (← links)
- On the connection between the discrete logarithms and the Diffie-Hellman problem (Q3125957) (← links)
- Security Analysis of the Strong Diffie-Hellman Problem (Q3593084) (← links)
- Algebraic curves and cryptography (Q5921638) (← links)
- Discrete logarithm problems with auxiliary inputs (Q5962223) (← links)
- Full quantum equivalence of group action DLog and CDH, and more (Q6135389) (← links)
- Cryptographic multilinear maps using pro-\(p\) groups (Q6163788) (← links)
- Full quantum equivalence of group action DLog and CDH, and more (Q6639503) (← links)
