R-2 composition tests: a family of statistical randomness tests for a collection of binary sequences

DOI10.1007/s12095-018-0334-1zbMath1419.94050OpenAlexW2896572193WikidataQ129090059 ScholiaQ129090059MaRDI QIDQ2325294

Muhiddin Uğuz, Ali Doğanaksoy, Fatih Sulak, Onur Koçak

Publication date: 25 September 2019

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-018-0334-1

zbMATH Keywords

compositionscryptographyrun teststatistical randomness testingGolomb's randomness postulates

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Uses Software

• TestU01
• Diehard
• NIST Statistical Test Suite

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Compositions with distinct parts
• New statistical randomness tests based on length of runs
• Some Inplace Identities for Integer Compositions
• Shift Register Sequences – A Retrospective Account
• TestU01
• CLOSED FORM FORMULA FOR THE NUMBER OF RESTRICTED COMPOSITIONS
• Evaluation of Randomness Test Results for Short Sequences
• Distribution Theory of Runs: A Markov Chain Approach
• The Distribution Theory of Runs

This page was built for publication: R-2 composition tests: a family of statistical randomness tests for a collection of binary sequences