Generalized explicit inversive generators of small p-weight degree
From MaRDI portal
Publication:2434411
Recommendations
- Exponential sums and linear complexity of nonlinear pseudorandom number generators with polynomials of small \(p\)-weight degree
- Exponential sums of nonlinear congruential pseudorandom number generators with Rédei functions
- Bounds for exponential sums and their applications to pseudorandom numbers
- A construction of pseudorandom binary sequences using rational functions
- Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators
Cites work
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 967590 (Why is no real title available?)
- A Study on the Pseudorandom Properties of Sequences Generated Via the Additive Order
- Bounds for exponential sums over finite fields
- Distribution of digital explicit inversive pseudorandom numbers and their binary threshold sequence
- Exponential Sums and Goppa Codes: I
- Exponential sums and linear complexity of nonlinear pseudorandom number generators with polynomials of small \(p\)-weight degree
- Finite binary sequences constructed by explicit inversive methods
- General discrepancy estimates: the Walsh function system
- Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators
- On a new class of inversive pseudorandom numbers for parallelized simulation methods
- On the lattice structure of pseudorandom numbers generated over arbitrary finite fields
- On the structure of digital explicit nonlinear and inversive pseudorandom number generators
- Some estimates for character sums and applications
Cited in
(2)
This page was built for publication: Generalized explicit inversive generators of small \(p\)-weight degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2434411)