US5335280A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Random sum cipher system and method
Assignee: Individual
•
Filing: 1993-01-28
•
Granted: 1994-08-02
•
Expires: 2013-01-28
Abstract
Abstract A cipher system for use by a sender and receiver provides a plaintext alphabet, each character of which is coded by a numerical synonym, the set of numerical synonyms comprising a collection of non-negative integers of common length and known to both sender and receiver. The system further provides a concatenation of the numerical synonyms comprising a plaintext message string integer corresponding to a plaintext message and a masking tape string integer comprising a randomly or pseudo-randomly accessed sequence of digits extracted from a string of digits accessible to both sender and receiver and added to the plaintext message string to form a ciphertext string. The numerical synonyms of plaintext alphabet characters may be permuted, relative to the normal listing of the alphabet, from message to message according to prior secret arrangement of sender and receiver. Also, the ciphertext string may be adulterated by prefixing, suffixing, or inserting integers of possibly variable length generated by a number generator, according to secret prior arrangement between sender and receiver. Still further, the ciphertext string may be subjected to permutations of blocks of its (adulterated) digits, according to secret prior arrangement between sender and receiver.
Inventors
- 👤 Arnold R. Vobach
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 05:45
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/12; H04L9/002; H04L9/06; H04L9/065; H04L9/0656; H04L9/0662; H04L2209/00; H04L2209/04
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
155 words
A cipher system for use by a sender and receiver, comprising: a. a source of plaintext alphabet characters, each character of which is coded by a numerical synonym, the set of numerical synonyms comprising a collection of non-negative integers of common length and known to both sender and receiver; b. a central processing unit, coupled to the source of characters, for developing a concatenation of the numerical synonyms comprising a plaintext message string integer corresponding to a plaintext message; and c. a masking tape memory coupled to the central processing unit to store a masking tape string integer, accessed by a randomly or pseudo-randomly selected starting position integer, and extracted from a string of digits accessible to both sender and receiver, and added to the plaintext message string to form a ciphertext string, the masking tape string integer differing only from one message to another as determined by the location of a starting position integer.
Claim 2
Dependent Claim
155 words
A cipher system for use by a sender and receiver, comprising: a. a source of plaintext alphabet characters, each character of which is coded by a numerical synonym, the set of numerical synonyms comprising a collection of non-negative integers of common length and known to both sender and receiver; b. a central processing unit, coupled to the source of characters, for developing a concatenation of the numerical synonyms comprising a plaintext message string integer corresponding to a plaintext message; and c. a masking tape memory coupled to the central processing unit to store a masking tape string integer, accessed by a randomly or pseudo-randomly selected starting position integer, and extracted from a string of digits accessible to both sender and receiver, and added to the plaintext message string to form a ciphertext string, the masking tape string integer differing only from one message to another as determined by the location of a starting position integer.
Claim 3
Dependent Claim
28 words
The system of claim 1, wherein the starting position integer for extraction of the masking tape string from the shared string of digits is transmitted with the cryptogram.
Claim 4
Dependent Claim
20 words
The method of claim 2, wherein the starting position integer is concealed in an initializing integer transmitted with the cryptogram.
Claim 5
Dependent Claim
15 words
The system of claim 3, wherein the initializing integer is generated by a number generator.
Claim 6
Dependent Claim
24 words
The system of claim 1, wherein the starting position integer for extraction of the masking tape string is transmitted concealed in a prior cryptogram.
Claim 7
Dependent Claim
40 words
The system of claim 1, wherein the numerical synonyms of plaintext alphabet characters are permuted, relative to the normal listing of the alphabet and associated numerical synonyms, from message to message according to prior secret arrangement of sender and receiver.
Claim 8
Dependent Claim
35 words
The system of claim 1, wherein the ciphertext string is adulterated by prefixing, suffixing, or inserting integers of possibly variable length generated by a number generator, according to secret prior arrangement between sender and receiver.
Claim 9
Dependent Claim
26 words
The system of claim 1, wherein the ciphertext string is subjected to block permutations of its digits, according to secret prior arrangement between sender and receiver.
Claim 10
Dependent Claim
146 words
A cryptographic method, comprising the steps of: a. generating a plaintext alphabet from a source of plaintext alphabet characters, each character of which is coded by a numerical synonym, the set of numerical synonyms comprising a collection of non-negative integers of common length and known to both sender and receiver; b. concatenating the numerical synonyms in a central processing unit, comprising a plaintext message; string integer corresponding to a plaintext message; and c. forming a masking tape string integer in a masking tape memory, accessed by a randomly or pseudo-randomly selected starting position integer, and extracted from a string of digits accessible to both sender and receiver, and adding this masking tape string integer to the plaintext message integer to form a ciphertext string, the masking tape string integer differing only from one message to another as determined by the location of a starting position integer.
Claim 11
Dependent Claim
146 words
A cryptographic method, comprising the steps of: a. generating a plaintext alphabet from a source of plaintext alphabet characters, each character of which is coded by a numerical synonym, the set of numerical synonyms comprising a collection of non-negative integers of common length and known to both sender and receiver; b. concatenating the numerical synonyms in a central processing unit, comprising a plaintext message; string integer corresponding to a plaintext message; and c. forming a masking tape string integer in a masking tape memory, accessed by a randomly or pseudo-randomly selected starting position integer, and extracted from a string of digits accessible to both sender and receiver, and adding this masking tape string integer to the plaintext message integer to form a ciphertext string, the masking tape string integer differing only from one message to another as determined by the location of a starting position integer.
Claim 12
Dependent Claim
28 words
The method of claim 9, wherein the starting position integer for extraction of the masking tape string from the shared string of digits is transmitted with the cryptogram.
Claim 13
Dependent Claim
20 words
The method of claim 10, wherein the starting position integer is concealed in an initializing integer transmitted with the cryptogram.
Claim 14
Dependent Claim
15 words
The method of claim 11, wherein the initializing integer is generated by a number generator.
Claim 15
Dependent Claim
24 words
The method of claim 9, wherein the starting position integer for extraction of the masking tape string is transmitted concealed in a prior cryptogram.
Claim 16
Dependent Claim
40 words
The method of claim 9, wherein the numerical synonyms of plaintext alphabet characters are permuted, relative to the normal listing of the alphabet and associated numerical synonyms, from message to message according to prior secret arrangement of sender and receiver.
Claim 17
Dependent Claim
35 words
The method of claim 9, wherein the ciphertext string is adulterated by prefixing, suffixing, or inserting integers of possibly variable length generated by a number generator, according to secret prior arrangement between sender and receiver.
Claim 18
Dependent Claim
26 words
The method of claim 9, wherein the ciphertext string is subjected to block permutations of its digits, according to secret prior arrangement between sender and receiver.
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
US4447672A
Cited
US4667301A
Cited
US4776011A
Cited
US4751733A
Cited
US4791669A
Cited
US4853962A
Cited
US5113444A
Cited
US5193115A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-08-01 | 1998-01-31 | 1998-08-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-08-01 | 2002-01-31 | 2002-08-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-08-01 | 2006-01-31 | 2006-08-02 | $7700.00 | Window Closed / Lapsed |