Cryptographic encoding process

• US 5,398,284 A
• Filed: 11/05/1993
• Issued: 03/14/1995
• Est. Priority Date: 11/05/1993
• Status: Expired due to Term

• Current Assignee: Lear Corporation Eeds & Interiors (Rtx Corporation)
• Original Assignee: United Technologies Automotive, Inc. (Lear Corporation)
• Inventors: Finn, Alan M., Koopman, Philip J. Jr.
• Primary Examiner(s): Cain, David C.
• Application Number:
  US08/148,667
• Time in Patent Office: 494 Days
• Field of Search: 380/28, 380/4, 380/49, 380/50, 380/30, 380/29, 380/37
• US Class Current: 380/28
• CPC Class Codes: H04L 2209/04 Masking or blinding
• CPC Class Codes: H04L 2209/34 Encoding or coding, e.g. Huffman coding or error correction
• CPC Class Codes: H04L 9/06 the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators

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.

Claims

1. 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.

2. The method of claim 1 wherein said digital information is an access code.

3. The method of claim 1 wherein said integer ring operation is an integer addition operation.

4. The method of claim 1 wherein said integer ring operation includes a carry operation.

5. The method of claim 1 wherein said integer ring operation alters the bits of the first resultant field in a data-dependent manner.

6. The method of claim 1 wherein said convolution operation is performed using a cyclic redundancy code process.

7. 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.

8. 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.

9. 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.

10. 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.