The binary primes sequence for computational hardening of pseudorandom sequences

TL;DR

This paper introduces a method to enhance pseudorandom sequences with binary primes sequences, improving autocorrelation and computational hardness for cryptography.

Contribution

It presents a novel approach of combining binary primes sequences with pseudorandom sequences to strengthen cryptographic security.

Findings

Improved autocorrelation properties of the combined sequence

Enhanced computational hardness against eavesdroppers

Exponential complexity for cryptanalysis

Abstract

This paper proposes the use of the binary primes sequence to strengthen pseudorandom (PN) decimal sequences for cryptography applications. The binary primes sequence is added to the PN decimal sequence (where one can choose from many arbitrary shift values) and it is shown that the sum sequence has improved autocorrelation properties besides being computationally hard. Also, an analysis on the computational complexity is performed and it is shown that the complexity for the eavesdropper is of exponential complexity and therefore, the proposed method is an attractive procedure for cryptographic applications.