Deterministic Computation of Pseudorandomness in Sequences of Cryptographic Application

被引：0
作者：
Fuster-Sabater, A. [1 ]
Caballero-Gil, P. [2 ]
Delgado-Mohatar, O. [1 ]
机构：
[1] CSIC, Inst Appl Phys, Serrano 144, Madrid 28006, Spain
[2] Univ La Laguna, Fac Math, DEIOC, E-38271 Tenerife, Spain
来源：
COMPUTATIONAL SCIENCE - ICCS 2009, PART I | 2009年 / 5544卷
关键词：
Pseudorandomness; bit-string; balancedness; run dirtribution; cryptography; LARGE LINEAR SPAN; GENERATORS;
D O I：
暂无
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
An easy method of checking balancedness degree as well as run quantification in sequences obtained from LFSR-based keystream generators has been developed. The procedure is a deterministic alternative to the traditional application of statistical tests. The computation method allows one to check deviation of balancedness and run distribution goodness from standard values. The method here developed can be considered as a first selective criterium for acceptance/rejection of this type of generators of cryptographic application.
引用
收藏
页码：621 / +
页数：2
相关论文
共 50 条
12345