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 条

[1] Aspects of pseudorandomness in nonlinear generators of binary sequences
Fúster-Sabater, A
THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2003, 2841 : 329 - 341
[2] Aspects of pseudorandomness in nonlinear generators of binary sequences
Fúster-Sabater, Amparo
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2003, 2841 : 329 - 341
[3] On the pseudorandomness of quaternary sequences derived from sequences over
Su, Ming
Winterhof, Arne
PERIODICA MATHEMATICA HUNGARICA, 2017, 74 (01) : 79 - 87
[4] Computation of Filtering Functions for Cryptographic Applications
Fuster-Sabater, A.
2014 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, 2014, 29 : 2013 - 2023
[5] Balancedness in binary sequences with cryptographic applications
Hernandez-Goya, Candelaria
Fuster-Sabater, Amparo
PARALLEL PROCESSING AND APPLIED MATHEMATICS, 2008, 4967 : 499 - +
[6] On the pseudorandomness of binary and quaternary sequences linked by the gray mapping
Marzouk, Radwa
Winterhof, Arne
PERIODICA MATHEMATICA HUNGARICA, 2010, 60 (01) : 13 - 23
[7] Pseudorandomness of binary sequences derived from linear recursions
László Mérai
Periodica Mathematica Hungarica, 2015, 71 : 64 - 77
[8] Pseudorandomness of binary sequences derived from linear recursions
Merai, Laszlo
PERIODICA MATHEMATICA HUNGARICA, 2015, 71 (01) : 64 - 77
[9] On the pseudorandomness of binary and quaternary sequences linked by the gray mapping
Radwa Marzouk
Arne Winterhof
Periodica Mathematica Hungarica, 2010, 60 : 13 - 23
[10] Threshold computation and cryptographic security
Han, YN
Hemaspaandra, LA
Thierauf, T
SIAM JOURNAL ON COMPUTING, 1997, 26 (01) : 59 - 78

← 1 2 3 4 5 →