A new lower bound on the family complexity of Legendre sequences

DOI10.1007/s00200-020-00442-yzbMath1484.11164OpenAlexW3036851818MaRDI QIDQ2121576

Yağmur Çakıroğlu, Oğuz Yayla

Publication date: 4 April 2022

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-020-00442-y

zbMATH Keywords

pseudo-randomnessLambert \(W\) functionfamily complexitypolynomials over finite fieldsfamily of Legendre sequences

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Pseudo-random numbers; Monte Carlo methods (11K45)

Uses Software

• SageMath

Cites Work

• Family complexity and cross-correlation measure for families of binary sequences
• On the complexity of families of pseudo-random subsets
• On pseudorandomness of families of binary sequences
• Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). II
• On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences
• Concatenation of pseudorandom binary sequences
• On the Lambert \(w\) function
• Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
• A complexity measure for families of binary sequences
• On the complexity of a family of Legendre sequences with irreducible polynomials
• Handbook of Finite Fields
• Counting Irreducible Polynomials over Finite Fields Using the Inclusion-Exclusion Principle
• Measures of pseudorandomness of families of binary lattices, II (A further construction)
• Applied Number Theory
• On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
• Measures of Pseudorandomness: Arithmetic Autocorrelation and Correlation Measure
• On Orthogonal Matrices
• A finite pseudorandom binary sequence
• Family Complexity and VC-Dimension
• Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part I
• Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part II
• On Pseudorandom Sequences and Their Application
• The Linear Generation of the Legendre Sequence
• Construction of large families of pseudorandom binary sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A new lower bound on the family complexity of Legendre sequences