Trifork, a New Pseudorandom Number Generator Based on Lagged Fibonacci Maps
A new family of cryptographically secure pseudorandom number generators, is described. It is based on the combination of the sequences generated by three coupled Lagged Fibonacci generators, mutually perturbed. The mutual perturbation method consists of the bitwise XOR cross-addition of the output o...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2010 |
| País: | España |
| Institución: | Consejo Superior de Investigaciones Científicas (CSIC) |
| Repositorio: | DIGITAL.CSIC. Repositorio Institucional del CSIC |
| OAI Identifier: | oai:digital.csic.es:10261/32669 |
| Acceso en línea: | http://hdl.handle.net/10261/32669 |
| Access Level: | acceso abierto |
| Palabra clave: | Pseudo random number generator Lagged Fibonacci map |
| Sumario: | A new family of cryptographically secure pseudorandom number generators, is described. It is based on the combination of the sequences generated by three coupled Lagged Fibonacci generators, mutually perturbed. The mutual perturbation method consists of the bitwise XOR cross-addition of the output of each generator with the right-shifted output of the nearby generator. The proposed generator has better entropy and much longer repetition period than the conventional Lagged Fibonacci Generator. It passed successfully the most stringent randomness test suites. The effective speed of generation is approximately of one bit per computer clock cycle. The algorithm was programmed in C99 with 64 bits of word size |
|---|