On the linear complexity of binary threshold sequences derived from Fermat quotients
From MaRDI portal
Publication:1949234
DOI10.1007/s10623-012-9608-3zbMath1296.94071OpenAlexW1981001466MaRDI QIDQ1949234
Publication date: 6 May 2013
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-012-9608-3
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) 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 (13)
Trace representation and linear complexity of binary sequences derived from Fermat quotients ⋮ On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients ⋮ On the k-error linear complexity of binary sequences derived from polynomial quotients ⋮ An extension of binary threshold sequences from Fermat quotients ⋮ The arithmetic of Carmichael quotients ⋮ Trace representation of pseudorandom binary sequences derived from Euler quotients ⋮ On the correlation measures of orders \(3\) and \(4\) of binary sequence of period \(p^2\) derived from Fermat quotients ⋮ Unnamed Item ⋮ On error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\) ⋮ Trace representation of the binary \(pq^2\)-periodic sequences derived from Euler quotients ⋮ Polynomial quotients: Interpolation, value sets and Waring's problem ⋮ Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus ⋮ Additive character sums of polynomial quotients
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
- Multiplicative character sums of Fermat quotients and pseudorandom sequences
- How many bits have to be changed to decrease the linear complexity?
- On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences
- Fermat quotients for composite moduli
- Additive character sums of polynomial 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 the 𝑝-divisibility of Fermat quotients
- Autocorrelation values of generalized cyclotomic sequences of order two
- On the k-error linear complexity of cyclotomic sequences
- A search for Wieferich and Wilson primes
This page was built for publication: On the linear complexity of binary threshold sequences derived from Fermat quotients
