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

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F17%3A00094584" target="_blank" >RIV/00216224:14330/17:00094584 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1145/2988228" target="_blank" >http://dx.doi.org/10.1145/2988228</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/2988228" target="_blank" >10.1145/2988228</a>

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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ázev v anglickém jazyce

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

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2017

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

ACM Transactions on Mathematical Software

ISSN

0098-3500

e-ISSN

—

Svazek periodika

43

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

11

Strana od-do

27-37

Kód UT WoS článku

000395512100010

EID výsledku v databázi Scopus

2-s2.0-85006974268