EURASIP Journal on Embedded Systems 
Volume 2007 (2007), Article ID 98417, 13 pages
doi:10.1155/2007/98417
Research Article

Pseudorandom Recursions: Small and Fast Pseudorandom Number Generators for Embedded Applications

Laszlo Hars1 and Gyorgy Petruska2

 1Seagate Research, 1251 Waterfront Place, Pittsburgh 15222, PA, USA
2Department of Computer Science, Purdue University Fort Wayne, Fort Wayne 46805, IN, USA
Received 29 June 2006; Revised 2 November 2006; Accepted 19 November 2006

Recommended by Sandro Bartolini

Abstract

Many new small and fast pseudorandom number generators are presented, which pass the most common randomness tests. They perform only a few, nonmultiplicative operations for each generated number, use very little memory, therefore, they are ideal for embedded applications. We present general methods to ensure very long cycles and show, how to create super fast, very small ciphers and hash functions from them.