Permutation group games
OwnerJack Silvermaninventor
Life of this patent
Estimating the term…
Abstract
A game is described involving operations on a permutation group (X,*) where X is a set of symbols, illustratively the alphabet, and * is a two argument operation on the symbols of said set, said group having closure, associativity, an identity element and an inverse for each element of the set. A series of plaintext symbols of the set X is encoded by replacing each plaintext symbol with a symbol pair comprising two of the three symbols x, y, z in the relation x*y=z and where x, y, and z are each elements of the set X and one of x, y and z is the plaintext symbol to be encoded. The encoded symbol pairs are then decoded to recover the series of plaintext symbols.
Claims7
A game comprising the steps of:
- defining a permutation group (X,*) where X is a set of symbols and * is a two argument operation on the symbols of said set, said group having closure, associativity, an identity element and an inverse for each element of the set;
- encoding a series of plaintext symbols of the set X by replacing each plaintext symbol with a symbol pair comprising two of the three symbols x, y, z in the relation x*y=z and where x, y, and z are each elements of the set X and one of x, y and z is the plaintext symbol to be encoded;
- and
- decoding the encoded symbol pairs to recover the series of plaintext symbols.
Dependencies are inferred from the claim text.