Key-to-address transformations

Claim 1

In storing and retrieving data in and from memory locations in a computer by direct addressing wherein a computer assigns data to specific external memory locations derived from data key characters, the method comprising: (a) storing as an array in computer memory a table of n unordered data key characters by the use of a program module, n being the number of data key characters available for the data, each data key character being randomly assigned to a distinct position in the array, each data key character having a unique position in the array, (b) accessing the numbered position in the array of the first data key character using its unique numerical equivalent and a calling module, (c) using the numerical equivalent of a new character at that numbered position in the array, translating the first data key character into still another, more random, character by a key-to-address transformation using a hashing module, (d) iteratively translating each data key character into new randomized characters by the use of the calling module, the hashing module, and steps (b) and (c), (e) selecting each new randomized character and adjacent characters in the array by an operation in the hashing module to form a composite numerical equivalent for each data key character, (f) combining and scaling the composite character numerical equivalents thus obtained by the use of a predetermined operation to generate a data memory address, and (g) storing and retrieving data in and from that data memory address by the use of the calling module.