Pages that link to "Item:Q1827563"
From MaRDI portal
The following pages link to On the complexity of the discrete logarithm and Diffie-Hellman problems (Q1827563):
Displaying 20 items.
- The \(l\)-th power Diffie-Hellman problem and the \(l\)-th root Diffie-Hellman problem (Q683912) (← links)
- The Diffie-Hellman problem and generalization of Verheul's theorem (Q735041) (← links)
- Discrete logarithms, Diffie-Hellman, and reductions (Q763576) (← links)
- The Diffie-Hellman key exchange protocol and non-Abelian nilpotent groups (Q940767) (← links)
- A structural comparison of the computational difficulty of breaking discrete log cryptosystems (Q1382147) (← links)
- Small generic hardcore subsets for the discrete logarithm: short secret DL-keys. (Q1603445) (← links)
- Improved lower bound for Diffie-Hellman problem using multiplicative group of a finite field as auxiliary group (Q1640704) (← links)
- Discrete logarithm like problems and linear recurring sequences (Q1948461) (← links)
- Reduction of the integer factorization complexity upper bound to the complexity of the Diffie-Hellman problem (Q1996838) (← links)
- On the index of the Diffie-Hellman mapping (Q2081557) (← links)
- On the bit security of the Diffie-Hellman key (Q2502165) (← links)
- Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography (Q2512887) (← links)
- Short paper: The proof is in the pudding. Proofs of work for solving discrete logarithms (Q2656918) (← links)
- Algebraic groups and discrete logarithm (Q2764230) (← links)
- Generic Hardness of the Multiple Discrete Logarithm Problem (Q2948404) (← links)
- On the connection between the discrete logarithms and the Diffie-Hellman problem (Q3125957) (← links)
- Security in Communication Networks (Q5491685) (← links)
- On the Bit Security of Elliptic Curve Diffie–Hellman (Q5738794) (← links)
- (Q5752487) (← links)
- Algorithmic Number Theory (Q5899277) (← links)
