Random number generation and quasi-Monte Carlo methods
Random number generation and quasi-Monte Carlo methods
On the distribution of inversive congruential pseudorandom numbers in parts of the period
Mathematics of Computation
On the linear complexity profile of explicit nonlinear pseudorandom numbers
Information Processing Letters
On the linear complexity profile of some new explicit inversive pseudorandom numbers
Journal of Complexity - Special issue on coding and cryptography
On the distribution of some new explicit nonlinear congruential pseudorandom numbers
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators
IEEE Transactions on Information Theory
The Period Lengths of Inversive Pseudorandom Vector Generations
Finite Fields and Their Applications
A Study on the Pseudorandom Properties of Sequences Generated Via the Additive Order
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
On the structure of inversive pseudorandom number generators
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
A family of binary threshold sequences constructed by using the multiplicative inverse
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
| Hi-index | 0.00 |
Some families of finite binary sequences with strong pseudo-random properties are constructed by explicit inversive methods. Two important pseudo-random measures, the well-distribution measure and the correlation measure of small order k, are evaluated for the binary sequences by using some estimates of certain exponential sums over finite fields. These constructions may provide a very attractive alternative to traditional methods in applications.