An extension of binary threshold sequences from Fermat quotients
DOI10.3934/AMC.2016038zbMATH Open1353.94027OpenAlexW2548318495MaRDI QIDQ340165FDOQ340165
Authors: Xiaoni Du, Chenhuang Wu, 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
Recommendations
- Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
- On the linear complexity of binary threshold sequences derived from Fermat quotients
- Linear complexity of binary threshold sequences derived from generalized polynomial quotient with prime-power modulus
- Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
- Trace representation and linear complexity of binary sequences derived from Fermat quotients
Random number generation in numerical analysis (65C10) Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)
Cites Work
- Shift-register synthesis and BCH decoding
- Linear complexity and related complexity measures
- A search for Wieferich and Wilson primes
- On Cryptosystems Based on Polynomials and Finite Fields
- Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
- 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
- The arithmetic of Carmichael quotients
- Title not available (Why is that?)
- Structure of Pseudorandom Numbers Derived from Fermat Quotients
- On the π-divisibility of Fermat quotients
- Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
- Multiplicative character sums of Fermat quotients and pseudorandom sequences
- Solutions of the congruence π^{π-1}β‘1 (mod π^{π})
- On the value set of Fermat quotients
Cited In (8)
- Linear complexity of binary threshold sequences derived from generalized polynomial quotient with prime-power modulus
- Hamming correlation of higher order
- Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
- Linear complexity of binary sequences derived from polynomial quotients
- 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\)
- Trace representation and linear complexity of binary sequences derived from Fermat quotients
- On the linear complexity of binary threshold sequences derived from Fermat quotients
This page was built for publication: An extension of binary threshold sequences from Fermat quotients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340165)
