Patent US5193115A successfully refreshed from Google Patents.
US5193115A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Pseudo-random choice cipher and method
Assignee: Individual
•
Filing: 1992-01-22
•
Granted: 1993-03-09
•
Expires: 2012-01-22
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. This collection of integers is secretly shared by a sender and receiver pair. The plaintext characters of a message are sequentially coded by pseudo-randomly selecting representatives from the integer collections corresponding to the plaintext characters. To this sequence of concatenated integers, regarded as a single integer, is added a pseudo-random integer of length equal to that of the coded-for-message integer string. This pseudo-random integer is generated by a pseudo-random number generator (The receiver has a corresponding generator.), the output of which is initialized by a "seed" integer concealed in the cryptogram. The summed pseudo-random integer plus the coding integer string is transmitted as the body of the cryptogram. To decrypt, the receiver subtracts the pseudo-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 R. Vobach
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 02:17
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: 26
Claim 1
Independent Claim
214 words
A cipher system for use by a sender and a receiver to generate cryptograms, the system comprising: (a) a plaintext alphabet, each character of which is coded by a collection of numerical synonyms comprising non-negative 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 non-negative 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 pseudo-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 pseudo-random sequence of digits, generated by an initializing seed, a new initializing seed for each cryptogram and the initializing seed concealed as a subset of the digits of an initializing integer, and added to the plaintext message string to form a ciphertext string.
Claim 2
Dependent Claim
214 words
A cipher system for use by a sender and a receiver to generate cryptograms, the system comprising: (a) a plaintext alphabet, each character of which is coded by a collection of numerical synonyms comprising non-negative 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 non-negative 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 pseudo-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 pseudo-random sequence of digits, generated by an initializing seed, a new initializing seed for each cryptogram and the initializing seed concealed as a subset of the digits of an initializing integer, and added to the plaintext message string to form a ciphertext string.
Claim 3
Dependent Claim
34 words
A cipher system for cryptographic use, as defined in claim 1, in which the initializing seed for generating the pseudo-random sequence of digits is concealed in an initializing integer transmitted with the encrypted message.
Claim 4
Dependent Claim
31 words
A cipher system for cryptographic use, as defined in claim 2, in which the initializing integer is coded to identify prefixes, suffixes, interspersions and block permutations in the ciphertext message string.
Claim 5
Dependent Claim
43 words
A cipher system for cryptographic use, as defined in claim 2, in which the initializing integer is coded to identify permutations of digits of numerical synonyms and additions of a common fixed integer to the numerical synonyms of a plaintext message string integer.
Claim 6
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 initializing integer and the ciphertext message string.
Claim 7
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 8
Dependent Claim
39 words
A cipher system for cryptographic use, as defined in claim 1, in which pseudo-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 9
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 10
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 initializing integer and the ciphertext message string.
Claim 11
Dependent Claim
33 words
A cipher system for cryptographic use, as defined in claim 1, in which the initializing integer-ciphertext string is superencrypted by addition to a second masking tape string identified by a second initializing integer.
Claim 12
Dependent Claim
35 words
A cipher system for cryptographic use, as defined in claim 1, in which a memory card containing a user number, a masking tape and functional algorithm is used to gain accesses to a secure network.
Claim 13
Dependent Claim
37 words
A cipher system for cryptographic use, as defined in claim 1, in which a memory card containing a user number, a pseudo-random number generator and a functional algorithm is used to gain access to a secure network.
Claim 14
Dependent Claim
207 words
A cryptographic method for generating cryptograms comprising the steps of: (a) generating a plaintext alphabet each character of which is coded by a collection of numerical synonyms comprising non-negative 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 non-negative 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 pseudo-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 pseudo-random sequence of digits, generated by an initializing seed, a new initializing seed for each cryptogram and the initializing seed concealed as a subset of the digits of an initializing integer, and added to the plaintext message string to form a ciphertext string.
Claim 15
Dependent Claim
207 words
A cryptographic method for generating cryptograms comprising the steps of: (a) generating a plaintext alphabet each character of which is coded by a collection of numerical synonyms comprising non-negative 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 non-negative 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 pseudo-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 pseudo-random sequence of digits, generated by an initializing seed, a new initializing seed for each cryptogram and the initializing seed concealed as a subset of the digits of an initializing integer, and added to the plaintext message string to form a ciphertext string.
Claim 16
Dependent Claim
31 words
A cryptographic method, as defined in claim 13, in which the initializing seed for generating the pseudo-random sequence of digits is concealed in an initializing integer transmitted with the encrypted message.
Claim 17
Dependent Claim
28 words
A cryptographic method, as defined in claim 14, in which the initializing integer is coded to identify prefixes, suffixes, interspersions and block permutations in the ciphertext message string.
Claim 18
Dependent Claim
40 words
A cryptographic method, as defined in claim 14, in which the initializing integer is coded to identify permutations of digits of numerical synonyms and additions of a common fixed integer to the numerical synonyms of a plaintext message string integer.
Claim 19
Dependent Claim
38 words
A cryptographic method, as defined in claim 13, in which a leader integer, coded to identify prefixes, suffixes, interspersions, and block permutations, is inserted into the transmitted digit string between the initializing integer and the ciphertext message string.
Claim 20
Dependent Claim
37 words
A cryptographic method, as defined in claim 13, 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 21
Dependent Claim
36 words
A cryptographic method, as defined in claim 13, in which pseudo-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 22
Dependent Claim
25 words
A cryptographic method, as defined in claim 13, in which permutations are applied to the digits of successive blocks of digits of the ciphertext string.
Claim 23
Dependent Claim
38 words
A cryptographic method, as defined in claim 13, 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 24
Dependent Claim
30 words
A cryptographic method, as defined in claim 13, in which the initializing integer-ciphertext string is superencrypted by addition to a second masking tape string identified by a second initializing integer.
Claim 25
Dependent Claim
33 words
A cryptographic method, as defined in claim 13, in which a memory card containing a user number, a masking tape and a functional algorithm is sued to gain access to a secure network.
Claim 26
Dependent Claim
34 words
A cryptographic method, as defined in claim 13, in which a memory card containing a user number, a pseudo-random number generator and a functional algorithm is used to gain access to a secure network.
References Cited (Backward Citations)
US2949501A
Cited
US3067280A
Cited
US3911216A
Cited
US4202051A
Cited
US4193131A
Cited
US4441095A
Cited
US4206315A
Cited
US4341925A
Cited
US4301327A
Cited
US4418275A
Cited
US4369434A
Cited
US4638120A
Cited
US4326098A
Cited
US4667301A
Cited
US4776011A
Cited
US4791669A
Cited
US4853962A
Cited
US5113444A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-03-08 | 1996-09-07 | 1997-03-09 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-03-08 | 2000-09-07 | 2001-03-09 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-03-08 | 2004-09-07 | 2005-03-09 | $7700.00 | Window Closed / Lapsed |