all InfoSec news
Families of sequences with good family complexity and cross-correlation measure
May 8, 2024, 4:11 a.m. | Kenan Do\u{g}an, Murat \c{S}ahin, O\u{g}uz Yayla
cs.CR updates on arXiv.org arxiv.org
Abstract: In this paper we study pseudorandomness of a family of sequences in terms of two measures, the family complexity ($f$-complexity) and the cross-correlation measure of order $\ell$. We consider sequences not only on binary alphabet but also on $k$-symbols ($k$-ary) alphabet. We first generalize some known methods on construction of the family of binary pseudorandom sequences. We prove a bound on the $f$-complexity of a large family of binary sequences of Legendre-symbols of certain irreducible …
alphabet arxiv binary complexity correlation cs.cr cs.it families family good math.it math.nt measure order study terms
More from arxiv.org / cs.CR updates on arXiv.org
A Privacy Preserving System for Movie Recommendations Using Federated Learning
2 days, 13 hours ago |
arxiv.org
Jobs in InfoSec / Cybersecurity
Information Security Engineers
@ D. E. Shaw Research | New York City
Technology Security Analyst
@ Halton Region | Oakville, Ontario, Canada
Senior Cyber Security Analyst
@ Valley Water | San Jose, CA
Senior Security Analyst
@ Oracle | United States
Associate Vulnerability Management Specialist
@ Diebold Nixdorf | Hyderabad, Telangana, India
Cybersecurity Architect, Infrastructure & Technical Security
@ KCB Group | Kenya