Algorithm 970: Optimizing the NIST Statistical Test Suite and
the Berlekamp-Massey Algorithm

J 2017

Algorithm 970: Optimizing the NIST Statistical Test Suite and the Berlekamp-Massey Algorithm

SÝS, Marek, Zdeněk ŘÍHA a Václav MATYÁŠ

Základní údaje

Originální název

Algorithm 970: Optimizing the NIST Statistical Test Suite and the Berlekamp-Massey Algorithm

Autoři

SÝS, Marek (703 Slovensko, domácí), Zdeněk ŘÍHA (203 Česká republika, domácí) a Václav MATYÁŠ (203 Česká republika, garant, domácí)

Vydání

ACM Transactions on Mathematical Software, Association for Computing Machinery, 2017, 0098-3500

Další údaje

Jazyk

angličtina

Typ výsledku

Článek v odborném periodiku

Obor

10201 Computer sciences, information science, bioinformatics

Stát vydavatele

Spojené státy

Utajení

není předmětem státního či obchodního tajemství

Odkazy

URL

Impakt faktor

Impact factor: 2.905

Kód RIV

RIV/00216224:14330/17:00094584

Organizační jednotka

Fakulta informatiky

DOI

http://dx.doi.org/10.1145/2988228

UT WoS

000395512100010

Klíčová slova anglicky

Berlekamp-Massey algorithm; NIST STS; statistical randomness testing; design; algorithms; performance

Příznaky

Mezinárodní význam, Recenzováno

Změněno: 2. 2. 2021 10:32, prof. RNDr. Václav Matyáš, M.Sc., Ph.D.

Anotace

V originále

The NIST Statistical Test Suite (NIST STS) is one of the most popular tools for the analysis of randomness. This test battery is widely used, but its implementation is quite inefficient. A complete randomness analysis using the NIST STS can take hours on a standard computer when the tested data volume is on the order of GB. We improved the most time-consuming test (Linear Complexity) from the previous most efficient implementation of the NIST STS. We also optimized other tests and achieved an overall speedup of 50.6x compared with the reference implementation. This means that 20 MB of data can be tested within a minute using our new optimized version of the NIST STS. To speed up the Linear Complexity test, we proposed a new version of the Berlekamp-Massey algorithm that computes only the linear complexity of a sequence. This new variant does not construct a linear feedback shift register and is approximately 187x faster than the original NIST implementation of the Berlekamp-Massey algorithm.

Návaznosti

EE2.3.30.0037, projekt VaV

Název: Zaměstnáním nejlepších mladých vědců k rozvoji mezinárodní spolupráce

GA16-08565S, projekt VaV

Název: Rozvoj kryptoanalytických metod prostřednictvím evolučních výpočtů

Investor: Grantová agentura ČR, Advancing cryptanalytic methods through evolutionary computing

Citovat

SÝS, Marek, Zdeněk ŘÍHA a Václav MATYÁŠ. Algorithm 970: Optimizing the NIST Statistical Test Suite and the Berlekamp-Massey Algorithm. ACM Transactions on Mathematical Software. Association for Computing Machinery, 2017, roč. 43, č. 3, s. 27-37. ISSN 0098-3500. Dostupné z: https://dx.doi.org/10.1145/2988228.

@article{1365192,
   author = {Sýs, Marek and Říha, Zdeněk and Matyáš, Václav},
   article_number = {3},
   doi = {http://dx.doi.org/10.1145/2988228},
   keywords = {Berlekamp-Massey algorithm; NIST STS; statistical randomness testing; design; algorithms; performance},
   language = {eng},
   issn = {0098-3500},
   journal = {ACM Transactions on Mathematical Software},
   title = {Algorithm 970: Optimizing the NIST Statistical Test Suite and the Berlekamp-Massey Algorithm},
   url = {http://dl.acm.org/citation.cfm?id=2988228},
   volume = {43},
   year = {2017}
}

TY  - JOUR
ID  - 1365192
AU  - Sýs, Marek - Říha, Zdeněk - Matyáš, Václav
PY  - 2017
TI  - Algorithm 970: Optimizing the NIST Statistical Test Suite and the Berlekamp-Massey Algorithm
JF  - ACM Transactions on Mathematical Software
VL  - 43
IS  - 3
SP  - 27-37
EP  - 27-37
PB  - Association for Computing Machinery
SN  - 00983500
KW  - Berlekamp-Massey algorithm
KW  - NIST STS
KW  - statistical randomness testing
KW  - design
KW  - algorithms
KW  - performance
UR  - http://dl.acm.org/citation.cfm?id=2988228
L2  - http://dl.acm.org/citation.cfm?id=2988228
N2  - The NIST Statistical Test Suite (NIST STS) is one of the most popular tools for the analysis of randomness. This test battery is widely used, but its implementation is quite inefficient. A complete randomness analysis using the NIST STS can take hours on a standard computer when the tested data volume is on the order of GB. We improved the most time-consuming test (Linear Complexity) from the previous most efficient implementation of the NIST STS. We also optimized other tests and achieved an overall speedup of 50.6x compared with the reference implementation. This means that 20 MB of data can be tested within a minute using our new optimized version of the NIST STS. To speed up the Linear Complexity test, we proposed a new version of the Berlekamp-Massey algorithm that computes only the linear complexity of a sequence. This new variant does not construct a linear feedback shift register and is approximately 187x faster than the original NIST implementation of the Berlekamp-Massey algorithm.
ER  -

SÝS, Marek, Zdeněk ŘÍHA a Václav MATYÁŠ. Algorithm 970: Optimizing the NIST Statistical Test Suite and the Berlekamp-Massey Algorithm. \textit{ACM Transactions on Mathematical Software}. Association for Computing Machinery, 2017, roč.~43, č.~3, s.~27-37. ISSN~0098-3500. Dostupné z: https://dx.doi.org/10.1145/2988228.

Podrobný výpis o publikaci