Author:
Gilreath, William Fletcher
Category:
Research Papers
Sub-Category:
Mathematics and Applied Mathematics
Date Published:
December 11, 2025
Keywords:
cryptography, encryption, hash function, hashing, one-time pad, random number generator, secure hash, secure random number generation, XOR function
Abstract:
Random number generators are utilized in various fields of mathematics and computer science. However, they are pseudo-random, not truly random. Given an initial seed value, a sequence is generated that can be repeated. For cryptographic purposes of data encryption, a regular pseudorandom number generator is insufficient; thus, there is a need for a cryptographically secure random number generator. One efficient and effective approach is to simply encrypt each integral value in the series. Hence, even a linear integer progression from zero onwards becomes securely random. This idea is used with the CHARIBDIS secure random number generator algorithm. Each integral value is encrypted using a one-time pad using an XOR operation with a series of hash values. The series of hash values is generated using a secure hash algorithm, and then using the intermediate values that are reused in the next hash value. This process continues ad infinitum, in a potentially infinite loop with an infinite series of encrypted integral values that are secure random numbers.
<<< Back