Increasing Randomness Using Permutations on Blocks

TL;DR

This paper explores how applying permutations to blocks of prime reciprocal sequences can enhance their randomness, potentially strengthening their cryptographic security by increasing unpredictability.

Contribution

It introduces a method of permuting blocks within prime reciprocal sequences to improve their randomness and cryptographic robustness.

Findings

Permutation on blocks increases sequence randomness

Relationship between number of permutations and performance improvement

Potential application in cryptographic strength enhancement

Abstract

This paper investigates the effect of permutations on blocks of a prime reciprocal sequence on its randomness. A relationship between the number of permutations used and the improvement of performance is presented. This can be used as a method for increasing the cryptographic strength of pseudorandom sequences.