Fast Construction of Pseudorandom Binary Sequences and Lattices
Studia Scientiarum Mathematicarum Hungarica · 20.04.2026 · 63 (1) · 40-50
DOI: 10.1556/012.2026.04344 ↗Kurz gefasst
Fachartikel in der Zeitschrift Studia Scientiarum Mathematicarum Hungarica, erschienen am 20.04.2026. Verfasst von Károly Müllner. Die Arbeit nennt 17 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
In the practical application of pseudorandom binary sequences (e.g., in cryptography or signal processing), a need often arises for a long binary sequence while only much shorter binary sequences with suitable properties are readily available. In this paper, an 𝑁 2 -element pseudorandom binary lattice is constructed from two shorter, 𝑁-length binary sequences with strong pseudorandom properties. Next, this 𝑁 2 -element binary lattice is ‘unrolled’ (using a row-major order) to generate a significantly longer 𝑁 2 -element pseudorandom sequence. While optimal upper bounds for the pseudorandom measures of this new lattice and sequence are not established, we provide non-trivial upper bounds for these measures, demonstrating their strong pseudorandom properties.
Zitieren
APA
Müllner, K. (2026). Fast Construction of Pseudorandom Binary Sequences and Lattices. Studia Scientiarum Mathematicarum Hungarica, 63(1), 40-50. https://doi.org/10.1556/012.2026.04344
Vancouver
Müllner K. Fast Construction of Pseudorandom Binary Sequences and Lattices. Studia Scientiarum Mathematicarum Hungarica. 2026;63(1):40-50. doi:10.1556/012.2026.04344
BibTeX
@article{Mllner2026,
author = {Müllner, Károly},
title = {Fast Construction of Pseudorandom Binary Sequences and Lattices},
journal = {Studia Scientiarum Mathematicarum Hungarica},
year = {2026},
volume = {63},
number = {1},
pages = {40--50},
doi = {10.1556/012.2026.04344}
}
EUVIMED