Progress in Cryptology - INDOCRYPT 2003

From MaRDI portal
Publication:5429114

DOI10.1007/b94593zbMath1123.94331OpenAlexW753701005MaRDI QIDQ5429114

Harald Niederreiter

Publication date: 29 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b94593




Related Items

Construction of k-ary pseudorandom elliptic curve sequencesOn finite length nonbinary sequences with large nonlinear complexity over the residue ring \(\mathbb{Z}_m\)Linear complexity of some sequences derived from hyperelliptic curves of genus 2On the linear complexity profile of some sequences derived from elliptic curvesRemarks on the \(k\)-error linear complexity of \(p^n\)-periodic sequencesOn the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequencesNew generalized cyclotomic binary sequences of period \(p^2\)Pseudorandom sequences derived from automatic sequencesThe asymptotic behavior of the joint linear complexity profile of multisequencesImproved results on periodic multisequences with large error linear complexityError linear complexity measures for multisequencesThe minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequenceThe independence of two randomness properties of sequences over finite fieldsLinear complexity profile of \(m\)-ary pseudorandom sequences with small correlation measurePseudo-randomness of certain sequences of \(k\) symbols with length \(pq\)Multiplicative character sums of Fermat quotients and pseudorandom sequencesAddendum to Sidel'nikov sequences over nonprime fieldsAsymptotic analysis on the normalized \(k\)-error linear complexity of binary sequencesOn the counting function of the lattice profile of periodic sequencesOn the elliptic curve endomorphism generatorOn the \(N\)th linear complexity of automatic sequencesOn the linear complexity of Sidel'nikov sequences over nonprime fieldsOn the pseudorandomness of binary and quaternary sequences linked by the Gray mappingEnumeration results on linear complexity profiles and lattice profilesOn the joint linear complexity profile of explicit inversive multisequencesOn the linear complexity of the Naor-Reingold sequence with elliptic curvesFinite length sequences with large nonlinear complexityHamming correlation of higher orderRemarks on the New Attack on the Filter Generator and the Role of High Order ComplexityEnumeration results on the joint linear complexity of multisequencesReducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithmPeriodic multisequences with large error linear complexityRemarks on a cyclotomic sequenceBinary sequences with period \(N\) and nonlinear complexity \(N - 2\)Correlation measure, linear complexity and maximum order complexity for families of binary sequencesJoint linear complexity of multisequences consisting of linear recurring sequencesBinary sequences derived from differences of consecutive quadratic residuesThe minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\)On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher ordersThe expectation and variance of the joint linear complexity of random periodic multisequencesLinear complexity of sequences on Koblitz curves of genus 2On Pseudorandom Properties of Certain Sequences of Points on Elliptic CurveLinear Complexity and Expansion Complexity of Some Number Theoretic Sequences