US5113444A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Random choice cipher system and method
Assignee: Individual
•
Filing: 1990-09-05
•
Granted: 1992-05-12
•
Expires: 2010-09-05
Abstract
Abstract A cipher system is disclosed in which each character of a plaintext alphabet has associated with it a randomly distributed collection of integers of a given length. These collections of integers are secretly shared by a sender and receiver pair. The plaintext characters of a message are sequentially coded by randomly selecting representatives from the integer collections corresponding to the plaintex characters. To this sequence of concatenated integers, regarded as a single integer, is added a random integer of length equal to that of the coded-for-message integer stiring. This random integer is taken from a random digits shared by the sender and receiver. The indexing of the random integer in the digit string is transmitted as part of the cryptogram. The summed random integer plus the coding integer string is transmitted as the body of the cryptogram. To decrypt, the receiver subtracts the random integer from the transmitted integer, breaks up the remaining integer into the blocks numerically coding the plaintext characters and retrieves the plaintext characters of the message. Provision is made for further obscuring the cryptogram integer.
Inventors
- 👤 Arnold Vobach
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-06 12:05
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/06; H04L9/0618; H04L9/0631; H04L9/065; H04L9/0656; H04L9/0662; H04L2209/00; H04L2209/04
Claims Analysis
Total Claims: 22
Claim 1
Independent Claim
181 words
A cipher system for use by a sender and a receiver comprising: (a) a plaintext alphabet, each character of which is coded by a collection of numerical synonyms comprising nonnegative integers of a common fixed length such that: (i) the fraction, of all the numerical synonyms, for all the plaintext alphabet characters, corresponding to a given plaintext alphabet character is substantially equal to the relative frequency of use of that plaintext alphabet character in constructing meaningful plaintext messages; (ii) the numerical synonyms for each plaintext alphabet character are randomly distributed in the collection of all nonnegative integers, in their natural ordering, which have the common fixed length of the numerical synonyms; and (iii) the choice of a numerical synonym to represent a plaintext alphabet character is randomly made from the collection of numerical synonyms corresponding to that plaintext alphabet character; (b) a concatenation of the numerical synonyms comprising a plaintext message string integer corresponding to a plaintext message; and (c) a masking tape string comprising a sequence of random digits added to the plaintext message string to form a ciphertext string.
Claim 2
Dependent Claim
181 words
A cipher system for use by a sender and a receiver comprising: (a) a plaintext alphabet, each character of which is coded by a collection of numerical synonyms comprising nonnegative integers of a common fixed length such that: (i) the fraction, of all the numerical synonyms, for all the plaintext alphabet characters, corresponding to a given plaintext alphabet character is substantially equal to the relative frequency of use of that plaintext alphabet character in constructing meaningful plaintext messages; (ii) the numerical synonyms for each plaintext alphabet character are randomly distributed in the collection of all nonnegative integers, in their natural ordering, which have the common fixed length of the numerical synonyms; and (iii) the choice of a numerical synonym to represent a plaintext alphabet character is randomly made from the collection of numerical synonyms corresponding to that plaintext alphabet character; (b) a concatenation of the numerical synonyms comprising a plaintext message string integer corresponding to a plaintext message; and (c) a masking tape string comprising a sequence of random digits added to the plaintext message string to form a ciphertext string.
Claim 3
Dependent Claim
36 words
A cipher system for cryptographic use, as defined in claim 1, in which the starting digit in the masking tape string is chosen by randomly selecting a starting integer to be transmitted with the encrypted message.
Claim 4
Dependent Claim
45 words
A cipher system for cryptographic use, as defined in claim 1, in which the starting integers of successive messages have their digits permuted, and subsequently restored to their original sequence, by a sequence of permutations and their inverses known exclusively to both sender and receiver.
Claim 5
Dependent Claim
40 words
A cipher system for cryptographic use, as defined in claim 1, in which the masking tape string integer is added to the right, with carries to the right, to the plaintext message string integer to form the ciphertext string integer.
Claim 6
Dependent Claim
39 words
A cipher system for cryptographic use, as defined in claim 1, in which random integers, of possibly variable length, are prefixed, suffixed or interspersed amoung the digits of the ciphertext string according to prior arrangements between sender and receiver.
Claim 7
Dependent Claim
28 words
A cipher system for cryptographic use, as defined in claim 1, in which permutations are applied to the digits of successive blocks of digits of the ciphertext string.
Claim 8
Dependent Claim
41 words
A cipher system for cryptographic use, as defined in claim 1, in which a leader integer, coded to identify prefixes, suffixes, interspersions and block permutations, is inserted into the transmitted digit string between the starting integer and the ciphertext message string.
Claim 9
Dependent Claim
33 words
A cipher system for cryptographic use, as defined in claim 1, in which the starting integer-ciphertext string is superencrypted by addition to a second masking tape string identified by a second starting integer.
Claim 10
Dependent Claim
45 words
A cipher system for cryptographic use, as defined in claim 1, in which the sender transmits as part of the plaintext message string a passcode encrypted by a cipher system known only to the sender and a neutral third party, but not to potential receivers.
Claim 11
Dependent Claim
28 words
A cipher system for cryptographic use, as defined in claim 9, in which decryption of the encrypted passcode by a neutral third party authenticates a transmitted encrypted message.
Claim 12
Dependent Claim
176 words
A cryptographic method comprising the steps of: (a) generating a plaintext alphabet each character of which is coded by a collection of numerical synonyms comprising nonnegative integers of a common fixed length such that: (i) the fraction, of all the numerical synonyms, for all the plaintext alphabet characters, corresponding to a given plaintext alphabet character is substantially equal to the relative frequency of use of that plaintext alphabet character in constructing meaningful plaintext messages; (ii) the numerical synonyms for each plaintext alphabet character are randomly distributed in the collection of all nonnegative integers, in their natural ordering, which have the common fixed length of the numerical synonyms; and (iii) the choice of a numerical synonym to represent a plaintext alphabet character is randomly made from the collection of numerical synonyms corresponding to that plaintext alphabet character; (b) concatenating the numerical synonyms, comprising a plaintext message string integer corresponding to a plaintext message; and (c) forming a masking tape string, comprising a sequence of random digits added to the plaintext message string to form a ciphertext string.
Claim 13
Dependent Claim
176 words
A cryptographic method comprising the steps of: (a) generating a plaintext alphabet each character of which is coded by a collection of numerical synonyms comprising nonnegative integers of a common fixed length such that: (i) the fraction, of all the numerical synonyms, for all the plaintext alphabet characters, corresponding to a given plaintext alphabet character is substantially equal to the relative frequency of use of that plaintext alphabet character in constructing meaningful plaintext messages; (ii) the numerical synonyms for each plaintext alphabet character are randomly distributed in the collection of all nonnegative integers, in their natural ordering, which have the common fixed length of the numerical synonyms; and (iii) the choice of a numerical synonym to represent a plaintext alphabet character is randomly made from the collection of numerical synonyms corresponding to that plaintext alphabet character; (b) concatenating the numerical synonyms, comprising a plaintext message string integer corresponding to a plaintext message; and (c) forming a masking tape string, comprising a sequence of random digits added to the plaintext message string to form a ciphertext string.
Claim 14
Dependent Claim
33 words
A cryptographic method, as defined in claim 11, in which the starting digit in the masking tape string is chosen by randomly selecting a starting integer to be transmitted with the encrypted message.
Claim 15
Dependent Claim
42 words
A cryptographic method, as defined in claim 11, in which the starting integers of successive messages have their digits permuted, and subsequently restored to their original sequence, by a sequence of permutations and their inverses known exclusively to both sender and receiver.
Claim 16
Dependent Claim
37 words
A cryptographic method, as defined in claim 11, in which the masking tape string integer is added to the right, with carries to the right, to the plaintext message string integer to form the ciphertext string integer.
Claim 17
Dependent Claim
36 words
A cryptographic method, as defined in claim 11, in which random integers, of possibly variable length, are prefixed, suffixed or interspersed among the digits of the ciphertext string according to prior arrangements between sender and receiver.
Claim 18
Dependent Claim
25 words
A cryptographic method, as defined in claim 11, in which permutations are applied to the digits of successive blocks of digits of the ciphertext string.
Claim 19
Dependent Claim
38 words
A cryptographic method, as defined in claim 11, in which a leader integer, coded to identify prefixes, suffixes, interspersions, and block permutations, is inserted into the transmitted digit string between the starting integer and the ciphertext message string.
Claim 20
Dependent Claim
30 words
A cryptographic method, as defined in claim 11, in which the starting integer-ciphertext string is superencrypted by addition to a second masking tape string identified by a second starting integer.
Claim 21
Dependent Claim
42 words
A cryptographic method, as defined in claim 11, in which the sender transmits as part of the plaintext message string a passcode encrypted by a cipher system known only to the sender and a neutral third party, but not to potential receivers.
Claim 22
Dependent Claim
25 words
A cryptographic method, as defined in claim 19, in which decryption of the encrypted passcode by a neutral third party authenticates a transmitted encrypted message.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1995-05-12 | 1995-11-11 | 1996-05-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-05-12 | 1999-11-11 | 2000-05-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-05-12 | 2003-11-11 | 2004-05-12 | $7700.00 | Window Closed / Lapsed |