The following pages link to (Q3154878):
Displaying 14 items.
- A shorter proof for an explicit formula for discrete logarithms in finite fields (Q947813) (← links)
- Aitken and Neville inverse interpolation methods for the Lucas logarithm problem (Q1008623) (← links)
- Measures of pseudorandomness for binary sequences constructed using finite fields (Q1024437) (← links)
- On the linear complexity of bounded integer sequences over different moduli (Q1044731) (← links)
- Linear complexity of the discrete logarithm (Q1869823) (← links)
- On the linear complexity of Legendre-Sidelnikov sequences (Q2260798) (← links)
- On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields (Q2325205) (← links)
- On lattice profile of the elliptic curve linear congruential generators (Q2453814) (← links)
- Polynomial representations of the Lucas logarithm (Q2500606) (← links)
- Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms (Q2938855) (← links)
- Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields (Q2948326) (← links)
- Advances in Cryptology – CRYPTO 2004 (Q5311533) (← links)
- Cryptography and Coding (Q5428162) (← links)
- A new perspective on the powers of two descent for discrete logarithms in finite fields (Q6165875) (← links)
