Trace representation of pseudorandom binary sequences derived from Euler quotients
DOI10.1007/S00200-015-0265-4zbMATH Open1343.94032arXiv1408.2385OpenAlexW1835999485MaRDI QIDQ893348FDOQ893348
Authors: N. E. Zubov 
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
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
Random number generation in numerical analysis (65C10) Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Bernoulli and Euler numbers and polynomials (11B68)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the divisibility of Fermat quotients
- Shift-register synthesis and BCH decoding
- Linear complexity and related complexity measures
- A search for Wieferich and Wilson primes
- Trace Representation and Linear Complexity of Binary $e$th Power Residue Sequences of Period $p$
- Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
- Fermat quotients for composite moduli
- On the linear complexity of binary threshold sequences derived from Fermat quotients
- On the distribution of pseudorandom numbers and vectors derived from Euler-Fermat 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
- The arithmetic of Carmichael quotients
- Structure of Pseudorandom Numbers Derived from Fermat Quotients
- On the 𝑝-divisibility of Fermat quotients
- Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
- Multiplicative character sums of Fermat quotients and pseudorandom sequences
- On the value set of Fermat quotients
- Trace representation and linear complexity of binary sequences derived from Fermat quotients
- Short character sums with Fermat quotients
- Additive character sums of polynomial quotients
- Boolean functions derived from Fermat quotients
- A trace representation of binary Jacobi sequences
- Title not available (Why is that?)
- Transform Techniques for Error Control Codes
- Distribution of values of polynomial Fermat quotients
- Linear Complexity of Binary Sequences Derived from Polynomial Quotients
- Interpolation of Fermat Quotients
- On the k-error linear complexity of binary sequences derived from polynomial quotients
Cited In (4)
- Trace representation of the binary \(pq^2\)-periodic sequences derived from Euler quotients
- 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\)
- 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)
