Trace representation of pseudorandom binary sequences derived from Euler quotients
From MaRDI portal
Publication:893348
Abstract: We give the trace representation of a family of binary sequences derived from Euler quotients by determining the corresponding defining polynomials. Trace representation can help us producing the sequences efficiently and analyzing their cryptographic properties, such as linear complexity.
Recommendations
- Trace representation of binary sequences derived from Euler quotients
- Trace representation of \(r\)-ary sequences derived from Euler quotients with prime-power modulus
- Trace representation of the binary \(pq^2\)-periodic sequences derived from Euler quotients
- Trace representation and linear complexity of binary sequences derived from Fermat quotients
- Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
Cites work
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 204179 (Why is no real title available?)
- scientific article; zbMATH DE number 2238187 (Why is no real title available?)
- A search for Wieferich and Wilson primes
- A trace representation of binary Jacobi sequences
- Additive character sums of polynomial quotients
- Boolean functions derived from Fermat quotients
- Bounds of multiplicative character sums with Fermat quotients of primes
- Character sums with Fermat quotients
- Distribution of values of polynomial Fermat quotients
- Fermat quotients for composite moduli
- Fermat quotients: exponential sums, value set and primitive roots
- Interpolation of Fermat quotients
- Linear complexity and related complexity measures
- 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 pseudorandom sequences generated by Fermat quotients and their generalizations
- Multiplicative character sums of Fermat quotients and pseudorandom sequences
- On the distribution of pseudorandom numbers and vectors derived from Euler-Fermat quotients
- On the divisibility of Fermat quotients
- On the k-error linear complexity of binary sequences derived from polynomial quotients
- On the linear complexity of binary threshold sequences derived from Fermat quotients
- On the value set of Fermat quotients
- On the 𝑝-divisibility of Fermat quotients
- Pseudorandomness and dynamics of Fermat quotients
- Shift-register synthesis and BCH decoding
- Short character sums with Fermat quotients
- Structure of Pseudorandom Numbers Derived from Fermat Quotients
- The arithmetic of Carmichael quotients
- Trace Representation and Linear Complexity of Binary $e$th Power Residue Sequences of Period $p$
- Trace representation and linear complexity of binary sequences derived from Fermat quotients
- Transform Techniques for Error Control Codes
Cited in
(7)- Trace representation of the binary \(pq^2\)-periodic sequences derived from Euler quotients
- A further study of the linear complexity of new binary cyclotomic sequence of length \(p^r\)
- Trace representation of binary sequences derived from Euler quotients
- Trace representation and linear complexity of binary sequences derived from Fermat quotients
- Trace representation of \(r\)-ary sequences derived from Euler quotients with prime-power modulus
- On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients
- On the pseudorandomness of binary and quaternary sequences linked by the Gray mapping
This page was built for publication: Trace representation of pseudorandom binary sequences derived from Euler quotients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q893348)
