Pages that link to "Item:Q4544724"
From MaRDI portal
The following pages link to Lower bounds on the linear complexity of the discrete logarithm in finite fields (Q4544724):
Displaying 6 items.
- 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 \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields (Q2325205) (← links)
- Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences (Q2491267) (← links)
- Polynomial representations of the Lucas logarithm (Q2500606) (← links)
- On the k-error linear complexity of cyclotomic sequences (Q5443539) (← links)
