A New Result on the Random Residue Sequence Algorithm

TL;DR

This paper explores an improved algorithm for generating random residue sequences, significantly increasing the number of sequences available for applications like cryptography and communication systems.

Contribution

It introduces a variation of the existing RR sequence algorithm that produces a larger set of sequences of specific lengths.

Findings

More RR sequences of lengths 16 and 24 are generated.

Experimental results demonstrate the increased variety of sequences.

Potential applications in cryptography are highlighted.

Abstract

Random residue sequences (RR) may be used in many random number applications including those related to multiple access in communications. This paper investigates variations on an algorithm to generate RR sequences that was proposed earlier by the author. This makes it possible to obtain many more random sequences than was possible to do by the previous algorithm. Experimental results are presented on a variety of sequences of length 16 and 24. To obtain a variety of RR sequences of a specific length can have obvious applications in cryptography.