On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders

被引：0
|
作者：
Alev Topuzoğlu
Arne Winterhof
机构：
[1] Sabanci University,Johann Radon Institute for Computational and Applied Mathematics
[2] Austrian Academy of Sciences,undefined
来源：
Applicable Algebra in Engineering, Communication and Computing | 2005年 / 16卷
关键词：
Linear complexity profile; Nonlinear pseudorandom number generators; Inversive generators; Sequences over finite fields; Recurrences of higher order;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Nonlinear congruential methods are attractive alternatives to the classical linear congruential method for pseudorandom number generation. Generators of higher orders are of interest since they admit longer periods. We obtain lower bounds on the linear complexity profile of nonlinear pseudorandom number generators of higher orders. The results have applications in cryptography and in quasi-Monte Carlo methods.
引用
收藏
页码：219 / 228
页数：9
相关论文
共 50 条
12345