This work introduces a novel pseudo-random number generation algorithm incorporating modulo arithmetic, XORShift, and entropy modulation. The method is designed to enhance randomness and ...

Abstract: As digital services offered through the cloud have proliferated over the last decade, ensuring the privacy of user data has become increasingly critical. To preserve data encryption through ...

This is a pseudo-random number generator, which is based on the results of its previously generated values and a prime number of any choice. The algorithm formula is as follows: R = (prev1 + prev2 + ...

In this paper, the authors propose the application of cryptography algorithm to ensure secure communication across the virtual networks. In cryptography, encryption is the process of encoding messages ...

Generating a string of random numbers is easy. The hard part is proving that they’re random. As Dilbert creator Scott Adams once pointed out, “that’s the problem with randomness: you can never be sure ...