An extension of binary threshold sequences from Fermat quotients
From MaRDI portal
Publication:340165
DOI10.3934/amc.2016038zbMath1353.94027OpenAlexW2548318495MaRDI QIDQ340165
Chenhuang Wu, Xiaoni Du, Wanyin Wei
Publication date: 11 November 2016
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2016038
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Random number generation in numerical analysis (65C10)
Related Items
Linear Complexity of New q-ary Generalized Cyclotomic Sequences of Period $$2p^n$$, A further study of the linear complexity of new binary cyclotomic sequence of length \(p^r\), Hamming correlation of higher order
Cites Work
- 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
- ON THE DISTRIBUTION OF PSEUDORANDOM NUMBERS AND VECTORS DERIVED FROM EULER–FERMAT 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 Cryptosystems Based on Polynomials and Finite Fields
- 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
- A search for Wieferich and Wilson primes
