scientific article; zbMATH DE number 7821973
From MaRDI portal
Publication:6118308
DOI10.12386/a20200128MaRDI QIDQ6118308
Publication date: 21 March 2024
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Pseudo-random numbers; Monte Carlo methods (11K45)
Cites Work
- Unnamed Item
- 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
- Collision and avalanche effect in families of pseudorandom binary sequences
- Trace representation and linear complexity of binary sequences derived from Fermat quotients
- On the linear complexity of binary threshold sequences derived from Fermat quotients
- Modular constructions of pseudorandom binary sequences with composite moduli
- 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
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- Interpolation of Fermat Quotients
This page was built for publication: