Finite binary sequences constructed by explicit inversive methods
From MaRDI portal
Publication:938755
DOI10.1016/J.FFA.2007.08.002zbMath1162.11040OpenAlexW1978246545MaRDI QIDQ938755
Publication date: 27 August 2008
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2007.08.002
Exponential sums (11T23) Estimates on character sums (11L40) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (6)
Generalized explicit inversive generators of small \(p\)-weight degree ⋮ On the Structure of Inversive Pseudorandom Number Generators ⋮ A Study on the Pseudorandom Properties of Sequences Generated Via the Additive Order ⋮ Modified constructions of binary sequences using multiplicative inverse ⋮ On k-error linear complexity of some explicit nonlinear pseudorandom sequences ⋮ Digital inversive vectors can achieve polynomial tractability for the weighted star discrepancy and for multivariate integration
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The period lengths of inversive pseudorandom vector generations
- On the measures of pseudorandomness of binary sequences.
- On the linear complexity profile of some new explicit inversive pseudorandom numbers
- On the linear complexity profile of explicit nonlinear pseudorandom numbers.
- Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
- Lattice structure and linear complexity of nonlinear pseudorandom numbers
- Construction of pseudorandom binary sequences using additive characters
- On the multidimensional distribution of inversive congruential pseudorandom numbers in parts of the period
- On the distribution of pseudorandom numbers and vectors generated by inversive methods
- On the correlation of pseudorandom numbers generated by inversive methods
- Modular constructions of pseudorandom binary sequences with composite moduli
- On a family of pseudorandom binary sequences
- Construction of pseudorandom binary sequences by using the multiplicative inverse
- On the distribution of inversive congruential pseudorandom numbers in parts of the period
- Exponential Sums and Goppa Codes: I
- On pseudorandom binary lattices
- The Serial Test for Congruential Pseudorandom Numbers Generated by Inversions
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators
- On finite pseudorandom binary sequences VII: The measures of pseudorandomness
- Predicting nonlinear pseudorandom number generators
- On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators
- Cryptography and Coding
- On the Distribution of Some New Explicit Nonlinear Congruential Pseudorandom Numbers
- Construction of large families of pseudorandom binary sequences
- On the distribution of compound inversive congruential pseudorandom numbers
- On the lattice structure of pseudorandom numbers generated over arbitrary finite fields
This page was built for publication: Finite binary sequences constructed by explicit inversive methods
