Patent US243612A successfully refreshed from Google Patents.
Patent US5159634A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5159634A Expired / Lapsed US ⏱️ 0.0 years remaining

Cryptosystem for cellular telephony

Assignee: Nokia of America Corp
•
Filing: 1991-09-13
•
Granted: 1992-10-27
•
Expires: 2011-09-13
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A relatively secure, self-inverting, symmetric key cryptosystem designed for efficient implementation on an 8-bit microcomputer. The cryptosystem is especially well suited use in cellular telephony. The method of encryption is comprised of three stages: 1) an autokeyed encryption, 2) the use of a one-time pad encryption where the key is derived from a portion of the message as encrypted by the first stage, and 3) a second autokeyed decryption that is the inverse of the first.

Inventors

  • 👤 James A. Reeds, III

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-30 21:22
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/32; H04L9/3236; H04K; H04K1/00; H04K1/02; H04L9/3271; H04L2209/00; H04L2209/80

Claims Analysis

Total Claims: 26
Claim 1
Independent Claim 133 words
In a communications system, a method of transforming a set of message signals representing a message, the method which includes the steps of encrypting said set of message signals with an encryption process and a set of key signals to form a set of first intermediate signals, altering said set of first intermediate signals in accordance with an involutory transformation to form a set of second intermediate signals, and decrypting said set of second intermediate signals with a decryption process which is the inverse of said encryption process to form a set of output signals, Characterized in that: said step of altering comprises the step of modifying a first subset of said set of first intermediate signals with an unkeyed transformation based on a second subset of said set of first intermediate signals.
Claim 2
Dependent Claim 133 words
In a communications system, a method of transforming a set of message signals representing a message, the method which includes the steps of encrypting said set of message signals with an encryption process and a set of key signals to form a set of first intermediate signals, altering said set of first intermediate signals in accordance with an involutory transformation to form a set of second intermediate signals, and decrypting said set of second intermediate signals with a decryption process which is the inverse of said encryption process to form a set of output signals, Characterized in that: said step of altering comprises the step of modifying a first subset of said set of first intermediate signals with an unkeyed transformation based on a second subset of said set of first intermediate signals.
Claim 3
Dependent Claim 50 words
The method of claim 1 wherein said step of encrypting comprises the step of forming said set of first intermediat signals in accordance with a first autokey process and said step of decrypting comprises the step of forming said set of output signals in accordance with a second autokey process.
Claim 4
Dependent Claim 22 words
The method of claim 1 further comprising the step of deriving said set of key signals from a set of source signals.
Claim 5
Dependent Claim 33 words
The method of claim 3 wherein said step of deriving comprises the step of hashing a set of pattern signals with said set of source signals to form said set of key signals.
Claim 6
Dependent Claim 28 words
The method of claim 4 wherein said set of key signals and the said set of pattern signals each have N elements, where N is a positive integer.
Claim 7
Dependent Claim 26 words
The method of claim 5 wherein said step of deriving comprises the step of making said set of pattern signals available for said step of hashing.
Claim 8
Dependent Claim 30 words
The method of claim 1 wherein said set of key signals has N elements and said set of message signals has D elements, where N and D are positive integers.
Claim 9
Dependent Claim 147 words
The method of claim 7 wherein said step of emcrypting said set of message signals comprises the steps of: setting a signal z to a selected magnitude; and for different integral magnitudes of a signal i, spanning the range 0≦i<D, setting a signal q based on the respective magnitudes of said signals i and z; setting a signal k based on the respective magnitudes of said signal q and on a signal T, where T is the q th element of said set of key signals; creating an i th element of said set of first intermediate signals based on the respective magnitude of said i th element of said set of message signals and said signal k; and updating the magnitude of said signal z based on the respective magnitudes of said i th element of said set of first intermediate signals and said signal z.
Claim 10
Dependent Claim 152 words
The method of claim 7 wherein said step of encrypting said set of message signals comprises the steps of: setting an n-tet signal z to a selected value; and for successive integer values of index i, spanning the rang 0 ≦i<D, setting an n-tet signal q to z⊕m, where ⊕ is the bit-wise boolean Exclusive-OR operator and m is i modulo 2 n ; setting an n-tet signal k to T, where T is said q th n-tet element of said set of key signals; creating an i th n-tet element of said set of first intermediate signals by adding, modulo 2 n , said i th n-tet element of said set of message signals and said n-tet signal k; and updating the value of said n-tet signal z by adding, modulo 2 n , said i th n-tet element of said set of first intermediate signals and said n-tet signal z.
Claim 11
Dependent Claim 18 words
The method of claim 9 wherein each of said n-tets is an eight-tet and 2 n eauals 256.
Claim 12
Dependent Claim 90 words
The method of claim 7 wherein said step of altering said set of first intermediate signals creates, in the range ##EQU1## an i th element of said set of second intermediate signals equal to b(i), ⊕q, where b(i) is the i th element of said set of first intermediate signals, where q is based on b(x), where x is based on the values of D and i, where b(x) is the x th element of said set of first intermediate signals, and where ⊕ is the bit-wise boolean Exclusive-OR operator.
Claim 13
Dependent Claim 148 words
The method of claim 7 wherein said step of decrypting said set of second intermediate signals comprises the steps of: setting a signal z to a selected magnitude; and for different integral magnitudes of a signal i, spanning the range 0≦i<D, setting a signal q based on the respective magnitudes of said signals i and z; setting a signal k based on the respective magnitudes of said signal q and on a signal T, where T is the q th element of said set of key signals; updating the magnitude of said signal z based on the respective magnitudes of said i th element of said set of second intermediate signals and said signal z; and creating an i th element of said set of output signals based on the respective magnitudes of said i th element of said set of second intermediate signals and said signal k.
Claim 14
Dependent Claim 149 words
The method of claim 7 wherein said step of decrypting said set of second intermediate signals comprises the steps of: setting an n-tet signal z to a selected magnitude; and for successive integer values of index i spanning the range 0≦i<D, setting an n-tet signal q to z⊕m, where ⊕ is the bit-wise boolean Exclusive-OR operator and m is i modulo 2 n ; setting an n-tet signal k to T, where T is said q th n-tet element of said set of key signals; updating the value of said n-tet signal z by adding, modulo 2 n , said i th n-tet element of said set of second intermediate signals and said signal z; and creating an i th n-tet element of said set of output signals by subtracting, modulo 2 n , n-tet signal k from the i th element of said set of second intermediate signals.
Claim 15
Dependent Claim 18 words
The method of claim 12 wherein each of said n-tets is an eight-tet and 2 n equals 256.
Claim 16
Dependent Claim 19 words
The method of claim 1 wherein said set of message signals represents a message in a cellular telephone system.
Claim 17
Dependent Claim 13 words
The method of claim 1 wherein said set of message signals represent speech.
Claim 18
Dependent Claim 14 words
The method of claim 1 wherein said set of message signals represent non-speech data.
Claim 19
Dependent Claim 19 words
The method of claim 1 wherein said set of message signals represents a message in a wirless communications system.
Claim 20
Dependent Claim 132 words
A cryptographic system for transforming a set of message signals which set represents a message comprising: means for encrypting said set of message signals with an encryption process and a set of key signals to form a set of first intermediate signals; means for altering said set of first intermediate signals in accordance with an involutory transformation to form a set of second intermediate signals; and means for decrypting said set of second intermediate signals with a decryption process which is the inverse of said encryption process to form a set of output signals, Characterized in that: said means for altering comprises means for modifying a first subset of said set of first intermediate signals with an unkeyed transformation in accordance with a second subset of said set of first intermediate signals.
Claim 21
Dependent Claim 132 words
A cryptographic system for transforming a set of message signals which set represents a message comprising: means for encrypting said set of message signals with an encryption process and a set of key signals to form a set of first intermediate signals; means for altering said set of first intermediate signals in accordance with an involutory transformation to form a set of second intermediate signals; and means for decrypting said set of second intermediate signals with a decryption process which is the inverse of said encryption process to form a set of output signals, Characterized in that: said means for altering comprises means for modifying a first subset of said set of first intermediate signals with an unkeyed transformation in accordance with a second subset of said set of first intermediate signals.
Claim 22
Dependent Claim 49 words
The communications systems of claim 19 wherein said means for encrypting comprises means for forming said set of first intermediate signals in accordance with a first autokey process and said means for decrypting comprises means for forming said set of output signals in accordance with a second autokey process.
Claim 23
Dependent Claim 31 words
The communications system of claim 19 wherein said set of key signals has N elements and said set of message signals had D elements, where N and D are positive integers.
Claim 24
Dependent Claim 157 words
The communications system of claim 21 wherein said means for encrypting said set of message signals comprises: means for setting a signal z to a selected magnitude; and means for setting a signal i to different integral magnitudes spanning the range 0≦i<D, means for setting a signal q based on the respective magnitudes of said signals i and z; means for setting a signal k based on the respective magnitudes of said signal q and on a signal K(q), where K(q) is the q th element of said set of key signals; means for creating an i th element of said set of first intermediate signals based on the respective magnitudes of said i th element of said set of message signals and said signal k; and means for updating the magnitude of said signal z based on the respective magnitudes of said i th element of said set of first intermediate signals and said signal z.
Claim 25
Dependent Claim 92 words
The communications system of claim 21 wherein said means for altering said set of first intermediate signals creates, in the range ##EQU2## an i th element of said set of second intermediate signals equal to b(i) ⊕ q, where b(i) is the i th element of said set of first intermediate signals, where q is based on b(x), where x is based on the values of D and i, where b(x) is the x th element of said set of first intermediate signals, and where ⊕ is the bit-wise boolean Exclusive-OR operator.
Claim 26
Dependent Claim 158 words
The communications system of claim 21 wherein said means for decrypting said set of second intermediate signals comprises: means for setting a signal z to a selected magnitude; and means for setting a signal i to different integral magnitudes spanning the range 0≦i<D, means for setting a signal q based on the respective magnitudes of said signals i and z; means for setting a signal k based on the respective magnitudes of said signal q and on a signal K(q), where K(q) is the q th element of said set of key signals; means for updating the magnitude of said signal z based on the respective magnitudes of said i th element of said set of second intermediate signals and said signal z; and means for creating an i th element of said set of output signals based on the respective magnitudes of said i th element of said set of second intermediate signals and said signal k.

References Cited (Backward Citations)

US4223182A Cited
US4074066A Cited
US4078152A Cited
US4157454A Cited
US4316055A Cited
US4399323A Cited
US4471164A Cited
US4731843A Cited
US4815130A Cited
US4969190A Cited
US5014313A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1995-10-27 1996-04-27 1996-10-27 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1999-10-27 2000-04-27 2000-10-27 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2003-10-27 2004-04-27 2004-10-27 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag