On the linear complexity profile of nonlinear congruential pseudorandom number generators with Dickson polynomials

被引：2

作者：

Aly, H ^{[1
]}

Winterhof, A

机构：

[1] Cairo Univ, Fac Sci, Dept Math, Giza, Egypt

[2] Austrian Acad Sci, Johann Radon Inst Computat & Appl Math, RICAM, A-4040 Linz, Austria

来源：

DESIGNS CODES AND CRYPTOGRAPHY | 2006年 / 39卷 / 02期

基金：

奥地利科学基金会;

关键词：

linear complexity profile; nonlinear congruential generator; Dickson polynomials; cryptography;

D O I：

10.1007/s10623-005-3190-x

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Linear complexity and linear complexity profile are important characteristics of a sequence for applications in cryptography and Monte-Carlo methods. The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. Recently, a weak lower bound on the linear complexity profile of a general nonlinear congruential pseudorandom number generator was proven by Gutierrez, Shparlinski and the first author. For most nonlinear generators a much stronger lower bound is expected. Here, we obtain a much stronger lower bound on the linear complexity profile of nonlinear congruential pseudorandom number generators with Dickson polynomials.

引用

页码：155 / 162

页数：8

共 50 条

[1] On the Linear Complexity Profile of Nonlinear Congruential Pseudorandom Number Generators with Dickson Polynomials
Hassan Aly
Arne Winterhof
[J]. Designs, Codes and Cryptography, 2006, 39 : 155 - 162
[2] On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders
Topuzoglu, A
Winterhof, A
[J]. APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2005, 16 (04) : 219 - 228
[3] On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders
Alev Topuzoğlu
Arne Winterhof
[J]. Applicable Algebra in Engineering, Communication and Computing, 2005, 16 : 219 - 228
[4] On the linear complexity profile of nonlinear congruential pseudorandom number generators with Redei functions
Meidl, Wilfried
Winterhof, Arne
[J]. FINITE FIELDS AND THEIR APPLICATIONS, 2007, 13 (03) : 628 - 634
[5] On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators
Gutierrez, J
Shparlinski, IE
Winterhof, A
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (01) : 60 - 64
[6] ON THE DISTRIBUTION AND LINEAR COMPLEXITY OF COUNTER-DEPENDENT NONLINEAR CONGRUENTIAL PSEUDORANDOM NUMBER GENERATORS
El-Mahassni, Edwin D.
Winterhof, Arne
[J]. JP JOURNAL OF ALGEBRA NUMBER THEORY AND APPLICATIONS, 2006, 6 (02): : 411 - 423
[7] Lattice structure and linear complexity profile of nonlinear pseudorandom number generators
Dorfer, G
Winterhof, A
[J]. APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2003, 13 (06) : 499 - 508
[8] Lattice Structure and Linear Complexity Profile of Nonlinear Pseudorandom Number Generators
Gerhard Dorfer
Arne Winterhof
[J]. Applicable Algebra in Engineering, Communication and Computing, 2003, 13 : 499 - 508
[9] Exponential sums of nonlinear congruential pseudorandom number generators with Redei functions
Gutierrez, Jaime
Winterhof, Arne
[J]. FINITE FIELDS AND THEIR APPLICATIONS, 2008, 14 (02) : 410 - 416
[10] AUTOCORRELATION PEAKS IN CONGRUENTIAL PSEUDORANDOM NUMBER GENERATORS
NEUMAN, F
MERRICK, RB
[J]. IEEE TRANSACTIONS ON COMPUTERS, 1976, 25 (05) : 457 - 460

← 1 2 3 4 5 →