Zuse Institute, Berlin and Free University of Berlin
R S Wikramaratna
3 - 6 March 2026
The Additive Congruential Random Number (ACORN) generator gives rise to sequences with long period approximating to uniformity in up to k dimensions (for any value of k). ACORN-QRE (Wikramaratna, REAMC Report-007, 2023, https://eprint.iacr.org/2023/1080) is a straightforward modification which avoids the linearity of ACORN, while preserving the uniformity. This can generate one-time pads that are demonstrably resistant to attack by current computers or by future computing developments (including quantum). The pads, which can use any alphabet, work with a Vernam-type cypher to securely encrypt both files and communications.
In this paper, we present performance data for a software implementation of ACORN-QRE with a key of 1079 bits, each bit assigned randomly as 0 or 1. On a standard laptop or desktop computer, this works to securely encrypt binary files of arbitrary size. Encrypted files can be safely shared over any public network or even left for collection on a publicly-accessible web site without fear of their being intercepted and later read by a malicious actor. Only the sender and the intended recipient (in possession of the relevant key, which must be kept secure) are able to decrypt the file. Thus, the problem of securely sharing GBs or even TBs of data is reduced to one of securely sharing a key comprising 1079 random-looking bits.
The ACORN-QRE algorithm is patented in UK (GB2591467) and USA (US11,831,7512); the patents are owned by REAMC
Download full document