Learn More
A method is presented for computing the number of elements in any collection of sets derived from other sets by statements that are reducible to conjunctions, disjunctions, and complementations. The technique also detects certain inconsistencies that may be present in the given data. The method is applicable to a wide range of problems in computer science,(More)
This thesis explores the general computational class of cryptanalysis, finds the relationship between two seemingly unrelated ciphers and explores some of the structure underlying the finite groups used by the RSA cryptosystem and others. In order to illustrate the structures found, a program is provided that minimizes a key function on certain quadratic(More)
  • 1