Risk-oriented Model of the Object of Critical Information Statistical Criterion of Checking of Independence of Inner States and Outputs of Cryptoprimitive which Generates (Pseudo) Random Sequences

The article is devoted to creation and justification of new statistical criterion of pairwise independence of binary sequences from given set, which are considered as realization of random variables. The corresponding algorithm, which fulfills the checking of pairwise independence, is formulated in details. This algorithm is necessary tool for statistical veri-fication of cryptographic quality of different cryptoprimitives, which functioning is con-nected with random/ pseudorandom sequences generation — such as ran-dom/pseudorandom sequences generators or stream ciphers. Usage of the obtained criteri-on allows independence checking not only for output sequences, but also for its interme-diate state or inputs. Note that such independence is necessary for unpredictability of out-put sequences.

Authors

Publication Details

Journal
Èlektronnoe modelirovanie
Published
2024-10-11
DOI
https://doi.org/10.15407/emodel.46.05.003
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Risk-oriented Model of the Object of Critical Information Statistical Criterion of Checking of Independence of Inner States and Outputs of Cryptoprimitive which Generates (Pseudo) Random Sequences

A.Y. Davydenko, Lyudmila Kovalchuk, Tetiana Klymenko, O.Yu. Bespalov
Èlektronnoe modelirovanie
Coding theory and cryptography
article

Risk-oriented Model of the Object of Critical Information Statistical Criterion of Checking of Independence of Inner States and Outputs of Cryptoprimitive which Generates (Pseudo) Random Sequences

A.Y. Davydenko, Lyudmila Kovalchuk, Tetiana Klymenko, O.Yu. Bespalov
article en

Abstract

The article is devoted to creation and justification of new statistical criterion of pairwise independence of binary sequences from given set, which are considered as realization of random variables. The corresponding algorithm, which fulfills the checking of pairwise independence, is formulated in details. This algorithm is necessary tool for statistical veri-fication of cryptographic quality of different cryptoprimitives, which functioning is con-nected with random/ pseudorandom sequences generation — such as ran-dom/pseudorandom sequences generators or stream ciphers. Usage of the obtained criteri-on allows independence checking not only for output sequences, but also for its interme-diate state or inputs. Note that such independence is necessary for unpredictability of out-put sequences.

Èlektronnoe modelirovanieVol. 46(5)
Reduced inequalities
Openalex Percentile: Top 82%
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.