Patent US4957298A successfully refreshed from Google Patents.
US4957298A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Permutation group games
Assignee: Individual
•
Filing: 1989-03-22
•
Granted: 1990-09-18
•
Expires: 2009-03-22
Abstract
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.
Inventors
- 👤 Jack Silverman
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 05:41
CPC Classifications
A; A63; A63F; A63F3/00; A63F3/04; A63F3/0423; A63F2003/0431; A63F3/0457; A63F2003/046; A63F2003/0465
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
120 words
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.
Claim 2
Dependent Claim
120 words
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.
Claim 3
Dependent Claim
97 words
The method of claim 1 wherein the permutation group is defined by a lookup table for the operation * and the step of decoding the encoded symbol pairs comprises the steps of: for each encoded symbol pair (a,b) determining from the lookup table each possible third symbol c where two of the three symbols a, b, c are arguments of the operation * and the remaining symbol is the result of such operation on the other two symbols, and selecting from the third symbols c determined for each symbol pair a best estimate of the plaintext symbols.
Claim 4
Dependent Claim
37 words
The method of claim 1 wherein the permutation group is defined by a lookup table which associates each symbol of set X with a multidigit set of symbols and by a mapping which simulates the operation *.
Claim 5
Dependent Claim
121 words
The method of claim 1 wherein each symbol of set X including the identity element is associated with a multidigit set of symbols and the operation * is implemented on first and second arguments by an algorithm which: associates each digit of the first argument with a digit in the same position in the identity element; reorders the digits in the identity element so that they are in the order of the digits in the second argument and reorders the digits of the first argument in the same fashion so that each digit continues to be associated with the digit of the identity element with which it was associated; and provides as a result the reordered digits of the first argument.
Claim 6
Dependent Claim
95 words
The method of claim 1 wherein each symbol of set X including the identity element is associated with a multidigit set of symbols and the operation * is implemented on first and second arguments by rearranging the digits of the first argument so that each of the i digits of the first argument where i is the initial position of the digit in the argument is in the same position in the rearranged digits of the first argument as that digit of the second argument which is also the ith digit of the identity element.
Claim 7
Dependent Claim
58 words
The method of claim 1 wherein each symbol of set X including the identity element is associated with a multidigit set of symbols and the operation * is implemented on first and second arguments by rearranging the symbols of the first argument in the order in which the symbols of the identity element appear in the second argument.
Claim 8
Dependent Claim
99 words
The method of claim 1 wherein each symbol of set X including the identity element is associated with a four digit set of symbols and the operation * is implemented on first and second arguments by a lookup table and a cube, the cube being marked so as to represent the twenty-four permutations of four digits and the lookup table specifying for each symbol of set X one of the twenty-four permutations of four digits and a series of manipulations of the cube so as to move a representation of that permutation on the cube to a reference position.
References Cited (Backward Citations)
US1318366A
Cited
US4509758A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1993-09-17 | 1994-03-19 | 1994-09-18 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-09-17 | 1998-03-19 | 1998-09-18 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-09-17 | 2002-03-19 | 2002-09-18 | $7700.00 | Window Closed / Lapsed |