Quantifying Randomness in Stochastic Bit Sequences
Sensors · 30.07.2026 · 26 (15) · 4825
DOI: 10.3390/s26154825 ↗Kurz gefasst
Fachartikel in der Zeitschrift Sensors, online erschienen am 30.07.2026. Verfasst von Christoph Lange und 4 weiteren Autor:innen. Beteiligte Einrichtung: School of Engineering-Energy and Information, Hochschule für Technik und Wirtschaft Berlin (University of Applied Sciences), Wilhelminenhofstraße 75 …. Die Arbeit nennt 26 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Recent advancements in the field of communications and cryptology have attracted significant research efforts in studying randomness of bit sequences. Randomised bit sequences play a vital role in sensor applications by ensuring security (i.e., protecting against brute-force, replay, and eavesdropping attacks in wireless networks) and reliable signal processing (i.e., in sensor multiplexing schemes such as code-division or time-division schemes). Such bit sequences enable spread-spectrum techniques, which allow an improved signal separation in dense networks such as structural health monitoring. Furthermore, unpredictability is essential for secure communication among sensors, as seen in fiber Bragg grating systems. The mentioned studies have led to the development of different test methodologies, such as the NIST (National Institute of Standards and Technology) test suite, whose main objectives are to verify the independence of the individual elements in the sequence and to test their distribution within the bitstream. In this article, industry-relevant use cases are discussed for the application of random bit sequences and a gap-based approach for analysing bit sequences is presented and used together with a NIST-specified test. We introduce a simplified non-IID test approach (independent and identical distribution) to indicate whether the commonly considered IID characteristics of random variables are violated. To validate the proposed approach, this study employs different polynomial and nonpolynomial sequence generation methods. Furthermore, random sequences generated by different methods in hardware are included in the verification tests. The results confirm that the proposed methods of randomness assessment effectively indicates the non-IID characteristics of randomised bit sequences.
Schlagwörter
Stichwörter der Autor:innen
Autor:innen und Institutionen
- School of Engineering-Energy and Information, Hochschule für Technik und Wirtschaft Berlin (University of Applied Sciences), Wilhelminenhofstraße 75 A, 12459 Berlin, Germany.
- Faculty of Engineering, Hochschule Wismar (University of Applied Sciences: Technology, Business and Design), Philipp-Müller-Straße 14, 23966 Wismar, Germany.
- Escuela Técnica Superior de Ingeniería y Sistemas de Telecomunicación (ETSIST), Universidad Politécnica de Madrid, Campus Sur, Calle Nikola Tesla s/n, 28031 Madrid, Spain.
- Telekom Innovation Laboratories, Deutsche Telekom, Winterfeldtstraße 21, 10781 Berlin, Germany.
ORCID-Profile: Christoph Lange, Andreas Ahrens, Yadu Krishnan Krishnakumar, Ming Yin
Zitieren
APA
Lange, C., Ahrens, A., Krishnakumar, Y. K., Engert, D., & Yin, M. (2026). Quantifying Randomness in Stochastic Bit Sequences. Sensors, 26(15), 4825. https://doi.org/10.3390/s26154825
Vancouver
Lange C, Ahrens A, Krishnakumar YK, Engert D, Yin M. Quantifying Randomness in Stochastic Bit Sequences. Sensors. 2026;26(15):4825. doi:10.3390/s26154825
BibTeX
@article{Lange2026,
author = {Lange, Christoph and Ahrens, Andreas and Krishnakumar, Yadu Krishnan and Engert, Denise and Yin, Ming},
title = {Quantifying Randomness in Stochastic Bit Sequences},
journal = {Sensors},
year = {2026},
volume = {26},
number = {15},
pages = {4825},
doi = {10.3390/s26154825}
}
EUVIMED