Binary sequences derived from differences of consecutive quadratic residues
From MaRDI portal
Publication:2070259
DOI10.3934/amc.2020100zbMath1481.94079arXiv2005.08651OpenAlexW3046006259MaRDI QIDQ2070259
Publication date: 24 January 2022
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.08651
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Congruences; primitive roots; residue systems (11A07) Special sequences and polynomials (11B83) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite length sequences with large nonlinear complexity
- On finite pseudorandom sequences of \(k\) symbols.
- Binary sequences with period \(N\) and nonlinear complexity \(N - 2\)
- Constructing sequences with high nonlinear complexity using the Weierstrass semigroup of a pair of distinct points of a Hermitian curve
- Investigations on Periodic Sequences With Maximum Nonlinear Complexity
- Construction of Sequences With High Nonlinear Complexity From Function Fields
- Pattern distributions of Legendre sequences
- A LINEAR COMPLEXITY ANALYSIS OF QUADRATIC RESIDUES AND PRIMITIVE ROOTS SPACINGS
- On the Maximum Order Complexity of the Thue-Morse and Rudin-Shapiro Sequence
- Measures of pseudorandomness for finite sequences: typical values
- Progress in Cryptology - INDOCRYPT 2003
This page was built for publication: Binary sequences derived from differences of consecutive quadratic residues