CRFeb 1, 2012
Increasing Randomness Using Permutations on Blocks
arXiv:1202.0200v1
AI Analysis
This addresses the need for stronger pseudorandom sequences in cryptography, but it appears incremental as it builds on existing methods.
The paper tackled the problem of improving randomness in prime reciprocal sequences by applying permutations on blocks, finding a relationship between the number of permutations and performance enhancement, which can boost cryptographic strength.
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.