Pages that link to "Item:Q763576"
From MaRDI portal
The following pages link to Discrete logarithms, Diffie-Hellman, and reductions (Q763576):
Displaying 8 items.
- On reducing factorization to the discrete logarithm problem modulo a composite (Q445245) (← links)
- Reduction of the integer factorization complexity upper bound to the complexity of the Diffie-Hellman problem (Q1996838) (← 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)
- Finding elliptic curves with a subgroup of prescribed size (Q3179510) (← links)
- Progress in Cryptology - INDOCRYPT 2004 (Q5712196) (← links)
- Weakness of $\mathbb{F}_{3^{6 \cdot 509}}$ for Discrete Logarithm Cryptography (Q5746220) (← links)
- (Q5752487) (← links)
