Trace representation and linear complexity of binary sequences derived from Fermat quotients
From MaRDI portal
Publication:1616173
DOI10.1007/s11432-014-5092-xzbMath1398.94085arXiv1306.5648OpenAlexW2071352202MaRDI QIDQ1616173
Publication date: 1 November 2018
Published in: Science China. Information Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.5648
binary sequencescryptographylinear complexityLegendre symbolFermat quotientstrace functionsdefining pairs
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Related Items (10)
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 ⋮ The arithmetic of Carmichael quotients ⋮ Trace representation of pseudorandom binary sequences derived from Euler quotients ⋮ Linear complexity and trace representation of balanced quaternary cyclotomic sequences of prime period \(p\) ⋮ 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 ⋮ Additive character sums of polynomial quotients
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
- Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
- Multiplicative character sums of Fermat quotients and pseudorandom sequences
- Boolean functions derived from Fermat quotients
- Trace representation of some generalized cyclotomic sequences of length \(pq\)
- A trace representation of binary Jacobi sequences
- Fermat quotients for composite moduli
- Distribution of values of polynomial Fermat quotients
- On the linear complexity of binary threshold sequences derived from Fermat quotients
- On the divisibility of Fermat quotients
- Additive character sums of polynomial quotients
- ON HEILBRONN'S EXPONENTIAL SUM
- ON THE DISTRIBUTION OF PSEUDORANDOM NUMBERS AND VECTORS DERIVED FROM EULER–FERMAT QUOTIENTS
- Linear Complexity of Binary Sequences Derived from 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
- Short character sums with Fermat quotients
- Structure of Pseudorandom Numbers Derived from Fermat Quotients
- Transform Techniques for Error Control Codes
- Trace representation of Legendre sequences of Mersenne prime period
- On the 𝑝-divisibility of Fermat quotients
- Linear complexity over F/sub P/ and trace representation of Lempel-Cohn-Eastman sequences
- Interpolation of Fermat Quotients
- Trace Representation and Linear Complexity of Binary $e$th Power Residue Sequences of Period $p$
- On the value set of Fermat quotients
- Shift-register synthesis and BCH decoding
- A search for Wieferich and Wilson primes
- Trace representation of Legendre sequences
This page was built for publication: Trace representation and linear complexity of binary sequences derived from Fermat quotients
