Linear complexity of binary threshold sequences derived from generalized polynomial quotient with prime-power modulus
DOI10.1142/S0129054120500264zbMATH Open1465.11233OpenAlexW3082410105MaRDI QIDQ5859634FDOQ5859634
Authors: Xiaoni Du, Lianhua Wang 
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
Recommendations
- Linear complexity of binary sequences derived from polynomial quotients
- 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
- An extension of binary threshold sequences from Fermat quotients
- Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)
Cites Work
- Title not available (Why is that?)
- Shift-register synthesis and BCH decoding
- Linear complexity and related complexity measures
- 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
- Title not available (Why is that?)
- Additive character sums of polynomial quotients
- Linear complexity of binary sequences derived from polynomial quotients
Cited In (7)
- The Binary Expansion of 1 p
- An extension of binary threshold sequences from Fermat quotients
- Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
- Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes
- Linear complexity of binary sequences derived from polynomial quotients
- Linear complexity of pseudorandom sequences based on summation of polynomial quotients
- On the linear complexity of binary threshold sequences derived from Fermat quotients
This page was built for publication: Linear complexity of binary threshold sequences derived from generalized polynomial quotient with prime-power modulus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5859634)
