Binary primes sequence for cryptography and secure communication

This paper investigates the generalized binary primes sequence and proposes its use to enhance commonly used pseudorandom (PN) sequences in physical-layer security applications. It is shown that the bitwise addition of the generalized binary primes sequence to a PN sequence results in a sequence that is cryptographically stronger. The properties of the proposed sum sequences are compared to other established binary sequences. The problem of guessing the sequence by the attacker is shown to be the order of O(N
^N
). The complexity properties of the generalized binary primes sequence are examined.