All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

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

The result's identifiers

  • Result code in 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>

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

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

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

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

Others

  • Publication year

    2017

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    ACM Transactions on Mathematical Software

  • ISSN

    0098-3500

  • e-ISSN

  • Volume of the periodical

    43

  • Issue of the periodical within the volume

    3

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    11

  • Pages from-to

    27-37

  • UT code for WoS article

    000395512100010

  • EID of the result in the Scopus database

    2-s2.0-85006974268