Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
From MaRDI portal
Publication:436622
DOI10.1016/J.IPL.2012.04.011zbMATH Open1243.94026OpenAlexW2006668161MaRDI QIDQ436622FDOQ436622
Authors: Xiaoni Du, Zhixiong Chen, Lei Hu 
Publication date: 25 July 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2012.04.011
Recommendations
- An extension of binary threshold sequences from Fermat quotients
- Linear complexity of binary threshold sequences derived from generalized polynomial quotient with prime-power modulus
- On the linear complexity of binary threshold sequences derived from Fermat quotients
- On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients
- Linear complexity of binary sequences derived from polynomial quotients
Cryptography (94A60) Bernoulli and Euler numbers and polynomials (11B68) Pseudo-random numbers; Monte Carlo methods (11K45)
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 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
- Title not available (Why is that?)
- Structure of Pseudorandom Numbers Derived from Fermat Quotients
- On the 𝑝-divisibility of Fermat quotients
- 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 (11)
- On error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\)
- Polynomial quotients: Interpolation, value sets and Waring's problem
- Trace representation of pseudorandom binary sequences derived from Euler quotients
- On Binary Sequences from Recursions “modulo 2e” Made Non-Linear by the Bit-By-Bit “XOR” Function
- On the k-error linear complexity of binary sequences derived from polynomial quotients
- Trace Representation and Linear Complexity of Binary $e$th Power Residue Sequences of Period $p$
- On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients
- An extension of binary threshold sequences from Fermat quotients
- Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus
- Additive character sums of polynomial quotients
- Trace representation and linear complexity of binary sequences derived from Fermat quotients
This page was built for publication: Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436622)
