Generalized Feedback Shift Register Pseudorandom Number Algorithm
Journal of the ACM (JACM)
Permutation enumeration: four new permutation algorithms
Communications of the ACM
Algorithm 452: enumerating combinations of m out of n objects [G6]
Communications of the ACM
Algorithm 382: combinations of M out of N objects [G6]
Communications of the ACM
Algorithm 466: four combinatorial algorithm [G6]
Communications of the ACM
Algorithm 154: combination in lexicographical order
Communications of the ACM
Communications of the ACM
Algorithm 199: conversions between calendar date and Julian day number
Communications of the ACM
Security, Accuracy, and Privacy in Computer Systems
Security, Accuracy, and Privacy in Computer Systems
Initializing generalized feedback shift register pseudorandom number generators
Journal of the ACM (JACM)
A model to order the encryption algorithms according to their quality
ACM SIGCOMM Computer Communication Review
The k-distribution of generalized feedback shift register pseudorandom numbers
Communications of the ACM
| Hi-index | 48.23 |
Nonsingular binary matrices of order N, i.e., nonsingular over the field {0, 1}, 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 2 × 2 and 3 × 3 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 from 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.