Describes simple, compound, and complex conversion arrays and then presents a simple, easily programmed, zero-overhead, readily modified, relatively low security, serial encryption algorithm containing the first two types. It also discusses the third type. From shooting craps at the Modulus M Casino to One Time Pads Shows how the triangular distribution of possible sums facing a crap shooter can become a rectangular distribution as the modulus value used to add the dice decreases. From there it proceeds to show ways of how lengthy sequences of values from a rectangular distribution can be generated using rectangular distributions of varying length. Presents all of the possible ways in which sequences containing from one to eight elements can be partitioned, the general expression for computing the number of possible ways in which sequences containing n elements can be partitioned, and some encryption related use for partitioning.
Title adequately explains paper.
Encryption related data types and structures plus some functions and procedures to manipulate them Describes a variety of encryption related data types and structures and the functions and procedures to manipulate them. It next gives some of the properties of these matrices. It then presents ways to create one such matrix and then to use it to create additional ones. Finally, it presents some encryption related uses for these matrices. Begins by defines various sub-sets of the set of nxn mod m matrices.