On the Inversive Pseudorandom Number Generator

被引:4
|
作者
Meidl, Wilfried [1 ]
Topuzoglu, Alev [1 ]
机构
[1] Sabanci Univ, MDBF, TR-34956 Istanbul, Turkey
关键词
LINEAR COMPLEXITY PROFILE; LATTICE STRUCTURE; PERIOD LENGTH; FINITE-FIELDS; DECOMPOSITION; POLYNOMIALS; PARTS; POWER;
D O I
10.1007/978-3-7908-2598-5_5
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
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 F-p.
引用
收藏
页码:103 / 125
页数:23
相关论文
共 50 条