Lattice Structure and Linear Complexity Profile of Nonlinear Pseudorandom Number Generators

被引：0
|
作者：
Gerhard Dorfer
Arne Winterhof
机构：
[1] Department of Algebra and Computational Mathematics,
[2] Vienna University of Technology,undefined
[3] Wiedner Hauptstr. 8–10/118,undefined
[4] 1040 Vienna,undefined
[5] Austria (e-mail: g.dorfer@tuwien.ac.at),undefined
[6] Institute of Discrete Mathematics,undefined
[7] Austrian Academy of Sciences,undefined
[8] Fleischmarkt 20–22/2,undefined
[9] 1010 Vienna,undefined
[10] Austria (e-mail: gerhard.dorfer@oeaw.ac.at,undefined
[11] arne.winterhof@oeaw.ac.at),undefined
[12] Temasek Laboratories,undefined
[13] National University of Singapore,undefined
[14] 10 Kent Ridge Crescent,undefined
[15] Singapore 119260,undefined
[16] Republic of Singapore (e-mail: tslwa@nus.edu.sg),undefined
来源：
Applicable Algebra in Engineering, Communication and Computing | 2003年 / 13卷
关键词：
Number Generator; Quality Measure; Lattice Structure; Generalize Version; Finite Field;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
 We extend a generalized version of Marsaglia's lattice test for sequences over finite fields to segments of sequences over an arbitrary field and show that linear complexity profile and this lattice test provide essentially equivalent quality measures for randomness.
引用
收藏
页码：499 / 508
页数：9
相关论文
共 50 条
12345