scientific article
From MaRDI portal
Publication:3154878
zbMath1063.11052MaRDI QIDQ3154878
Publication date: 14 January 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Other character sums and Gauss sums (11T24)
Related Items (7)
On lattice profile of the elliptic curve linear congruential generators ⋮ On the linear complexity of Legendre-Sidelnikov sequences ⋮ Polynomial representations of the Lucas logarithm ⋮ Aitken and Neville inverse interpolation methods for the Lucas logarithm problem ⋮ Measures of pseudorandomness for binary sequences constructed using finite fields ⋮ On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields ⋮ On the linear complexity of bounded integer sequences over different moduli
This page was built for publication:
