Royal Holloway College, London
R S Wikramaratna
12 – 14 December 2023
The Additive Congruential Random Number (ACORN) generator is straightforward to implement; it has been demonstrated in previous papers to give rise to sequences with long period which can be proven from theoretical considerations to approximate to uniformly distribution on the unit interval in up to k dimensions for any given k. The theoretical analysis is supported by the results of extensive empirical testing using standard test packages, see for example.
ACORN-QRE is a straightforward modification of ACORN which effectively avoids the linearity of the original algorithm, while preserving the uniformity of the modified sequence. It provides a new method for generating one-time pads that are resistant to attack either by current computers or by future computing developments, including quantum computers. The pads can use any alphabet (including both binary and alphanumeric) and can be used with a Vernam-type cypher to securely encrypt both files and communications.
We explain how the ACORN-QRE algorithm works and provide evidence for the claim that the resulting one-time pads are inherently not susceptible to cryptanalysis and that they will remain secure against foreseeable developments in computing, including the potential development of quantum computers. We go on to address some practical considerations for implementation of the method and provide some performance data for encryption and decryption of large binary files using a standard laptop computer.
The ACORN-QRE algorithm is patented in the UK under Patent No. GB2591467 “One-time pad generation”; patent applied for in the US under Application No. 17/795632. The relevant patents are owned by REAMC Limited, 4 Nuthatch Close, Poole, Dorset BH17 7XR, United Kingdom.