3115	 Orderly Enumeration of Nonsingular Binary Matrices Applied to Text Encryption	 Nonsingular binary matrices of order N i.e. nonsingular over the field and an initial segment of the natural numbers are placed in one-to-one correspondence. Each natural number corresponds to two intermediate vectors. These vectors are mapped into a nonsingular binary matrix. Examples of complete enumeration of all x and x nonsingular binary matrices were produced by mapping the intermediate vectors to the matrices. The mapping has application to the Vernam encipherment method using pseudorandom number sequences. A bit string formed form bytes of text of a data encryption key can be used as a representation of a natural number. This natural number is transformed to a nonsingular binary matrix. key leverage is obtained by using the matrix as a seed in a shift register sequence pseudorandom number generator. Binary matrices combinatorics combinations nonsingular matrices encryption Vernam pseudorandom numbers feedback shiftregister sequences random numbers.
