Trace representation of pseudorandom binary sequences derived from Euler quotients
From MaRDI portal
Publication:893348
DOI10.1007/S00200-015-0265-4zbMath1343.94032arXiv1408.2385OpenAlexW1835999485MaRDI QIDQ893348
Publication date: 19 November 2015
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.2385
Bernoulli and Euler numbers and polynomials (11B68) 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 (3)
On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients ⋮ A further study of the linear complexity of new binary cyclotomic sequence of length \(p^r\) ⋮ Trace representation of the binary \(pq^2\)-periodic sequences derived from Euler quotients
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The arithmetic of Carmichael quotients
- 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
- A trace representation of binary Jacobi sequences
- Fermat quotients for composite moduli
- Trace representation and linear complexity of binary sequences derived from Fermat quotients
- 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 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
- On the 𝑝-divisibility of Fermat quotients
- Interpolation of Fermat Quotients
- 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 the value set of Fermat quotients
- Shift-register synthesis and BCH decoding
- A search for Wieferich and Wilson primes
This page was built for publication: Trace representation of pseudorandom binary sequences derived from Euler quotients
