← Back to Patent Explorer
US5398284A Expired / Lapsed US ⏱️ 0.0 years remaining

Cryptographic encoding process

Assignee: Lear Corp EEDS and Interiors
•
Filing: 1993-11-05
•
Granted: 1995-03-14
•
Expires: 2013-11-05
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The digital information is encrypted by first performing a preselected number of CRC iterations or partial convolutions by multiplication with a mask in the Galois Field. Before the CRC operation is completed, the intermediate resultant is subjected to an Integer Ring operation, such as addition, which injects a nonlinearity over the Galois Field due to possible arithmetic carry operations. After the Integer Ring operation, the Galois Field CRC process is continued to completion. The result is an encrypted value which is not readily decrypted by Galois Field techniques.

Inventors

  • 👤 Philip J. Koopman, Jr.
  • 👤 Alan M. Finn

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-29 08:32
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/06; H04L2209/00; H04L2209/04; H04L2209/34

Claims Analysis

Total Claims: 11
Claim 1
Independent Claim 219 words
A method of encrypting digital information comprising a first predetermined number of bits, comprising: selecting a mask comprising a second predetermined number of bits; representing the digital information and the mask in a Galois field and commencing a convolution operation of the digital information with the mask by multiplying and adding in the Galois field a first portion of the first predetermined number of bits with a first portion of the second predetermined number of bits to obtain a first resultant; temporarily halting said convolution operation after a predetermined number of intermediate steps or shifts; selecting an offset integer of a third predetermined number of bits; representing the first resultant and the offset integer in the integer ring and performing an integer ring operation between the first resultant and said offset integer to obtain a second resultant of the first predetermined number of bits; substituting said second resultant for said first resultant; representing the second resultant and the mask in the Galois field and resuming said convolution operation using said second resultant in place of said first resultant by multiplying and adding in the Galois field the remaining portion of the first predetermined number of bits of the second resultant with the remaining portion of the second predetermined number of bits of the mask to obtain encrypted digital information.
Claim 2
Independent Claim 219 words
A method of encrypting digital information comprising a first predetermined number of bits, comprising: selecting a mask comprising a second predetermined number of bits; representing the digital information and the mask in a Galois field and commencing a convolution operation of the digital information with the mask by multiplying and adding in the Galois field a first portion of the first predetermined number of bits with a first portion of the second predetermined number of bits to obtain a first resultant; temporarily halting said convolution operation after a predetermined number of intermediate steps or shifts; selecting an offset integer of a third predetermined number of bits; representing the first resultant and the offset integer in the integer ring and performing an integer ring operation between the first resultant and said offset integer to obtain a second resultant of the first predetermined number of bits; substituting said second resultant for said first resultant; representing the second resultant and the mask in the Galois field and resuming said convolution operation using said second resultant in place of said first resultant by multiplying and adding in the Galois field the remaining portion of the first predetermined number of bits of the second resultant with the remaining portion of the second predetermined number of bits of the mask to obtain encrypted digital information.
Claim 3
Dependent Claim 13 words
The method of claim 1 wherein said digital information is an access code.
Claim 4
Dependent Claim 15 words
The method of claim 1 wherein said integer ring operation is an integer addition operation.
Claim 5
Dependent Claim 14 words
The method of claim 1 wherein said integer ring operation includes a carry operation.
Claim 6
Dependent Claim 22 words
The method of claim 1 wherein said integer ring operation alters the bits of the first resultant field in a data-dependent manner.
Claim 7
Dependent Claim 17 words
The method of claim 1 wherein said convolution operation is performed using a cyclic redundancy code process.
Claim 8
Dependent Claim 39 words
The method of claim 1 further comprising selecting a first value; using said first value to determine said predetermined number of intermediate steps or shifts and providing said first value as a key to decrypt said encrypted digital information.
Claim 9
Dependent Claim 35 words
The method of claim 1 further comprising selecting a first value; using said first value in performing said integer ring operation and providing said first value as a key to decrypt said encrypted digital information.
Claim 10
Dependent Claim 30 words
The method of claim 1 wherein said integer ring operation is an integer addition operation and wherein said offset integer comprises a fewer number of bits than said first resultant.
Claim 11
Dependent Claim 26 words
The method of claim 1 wherein said integer ring operation is an integer addition operation and wherein any carry bit resulting from such addition is ignored.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1998-03-13 1998-09-12 1999-03-14 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2002-03-13 2002-09-12 2003-03-14 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2006-03-13 2006-09-12 2007-03-14 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag