On the Inversive Pseudorandom Number Generator

Wilfried Meidl () and Alev Topuzoğlu ()
Additional contact information
Wilfried Meidl: Sabancı University, MDBF
Alev Topuzoğlu: Sabancı University, MDBF

A chapter in Recent Developments in Applied Probability and Statistics, 2010, pp 103-125 from Springer

Abstract: Abstract The inversive generator was introduced by J. Eichenauer and J. Lehn in 1986. A large number of papers on this generator have appeared in the last three decades, some investigating its properties, some generalizing it. It has been shown that the generated sequence and its variants behave very favorably with respect to most measures of randomness. In this survey article we present a comprehensive overview of results on the inversive generator, its generalizations and variants. As regards to recent work, our emphasis is on a particular generalization, focusing on the underlying permutation P(x)=ax p−2+b of $\mathbb{F}_{p}$ .

Keywords: Linear Complexity; Pseudorandom Number; Turbo Code; Pseudorandom Number Generator; Cycle Structure (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-7908-2598-5_5

Ordering information: This item can be ordered from
http://www.springer.com/9783790825985

DOI: 10.1007/978-3-7908-2598-5_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().