Pages that link to "Item:Q1869823"
From MaRDI portal
The following pages link to Linear complexity of the discrete logarithm (Q1869823):
Displaying 6 items.
- Aitken and Neville inverse interpolation methods for the Lucas logarithm problem (Q1008623) (← links)
- Number theoretic methods in cryptography. Complexity lower bounds (Q1276548) (← links)
- On the complexity of the discrete logarithm and Diffie-Hellman problems (Q1827563) (← links)
- Polynomial representations of the Lucas logarithm (Q2500606) (← links)
- Generic Hardness of the Multiple Discrete Logarithm Problem (Q2948404) (← links)
- On the k-error linear complexity of cyclotomic sequences (Q5443539) (← links)