Xorshift random number generators from primitive polynomials
| Autor: | Susil Kumar Bishoi, Surya Narayan Maharana |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Discrete mathematics
FOS: Computer and information sciences Polynomial Computer Science - Cryptography and Security Computer science Random number generation 020206 networking & telecommunications Xorshift 94A55 94A60 15B33 12E20 and 12E05 0102 computer and information sciences 02 engineering and technology 01 natural sciences Weakness present 010201 computation theory & mathematics 0202 electrical engineering electronic engineering information engineering Cryptography and Security (cs.CR) Generator (mathematics) |
| DOI: | 10.48550/arxiv.1705.00098 |
| Popis: | A class of xorshift random number generators (RNGs) are introduced by Marsaglia. We have proposed an algorithm which constructs a full period xorshift RNG from a given primitive polynomial. It is shown there is a weakness present in those RNGs and is suggested its improvement. A separate algorithm is also proposed which returns a full period xorshift generator with desired number of xorshift operations.%We also introduce the notion of tweaked primitive multiple-recursive matrix method with improved linear complexity. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|