Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus
From MaRDI portal
Publication:5859634
DOI10.1142/S0129054120500264zbMath1465.11233OpenAlexW3082410105MaRDI QIDQ5859634
Publication date: 19 April 2021
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054120500264
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The arithmetic of Carmichael quotients
- Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
- Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
- Multiplicative character sums of Fermat quotients and pseudorandom sequences
- Fermat quotients for composite moduli
- On the linear complexity of binary threshold sequences derived from Fermat quotients
- Additive character sums of polynomial quotients
- ON THE DISTRIBUTION OF PSEUDORANDOM NUMBERS AND VECTORS DERIVED FROM EULER–FERMAT QUOTIENTS
- Linear Complexity of Binary Sequences Derived from Polynomial Quotients
- BOUNDS OF MULTIPLICATIVE CHARACTER SUMS WITH FERMAT QUOTIENTS OF PRIMES
- Pseudorandomness and Dynamics of Fermat Quotients
- CHARACTER SUMS WITH FERMAT QUOTIENTS
- Fermat quotients: exponential sums, value set and primitive roots
- Structure of Pseudorandom Numbers Derived from Fermat Quotients
- On the 𝑝-divisibility of Fermat quotients
- Solutions of the congruence 𝑎^{𝑝-1}≡1 (mod 𝑝^{𝑟})
- On the value set of Fermat quotients
- Shift-register synthesis and BCH decoding
This page was built for publication: Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus
