Work Files Saved Searches
   My Account                                                  Search:   Quick/Number   Boolean   Advanced   Derwent    Help   


 The Delphion Integrated View

  Buy Now:   Buy PDF- 6pp  PDF  |   File History  |   Other choices   
  Tools:  Citation Link  |  Add to Work File:    
  View:  Expand Details   |  INPADOC   |  Jump to: 
  Go to:  Derwent  
 Email this to a friend  Email this to a friend 
       
Title: US5398284: Cryptographic encoding process
[ Derwent Title ]


Country: US United States of America

View Images High
Resolution

 Low
 Resolution

 
6 pages

 
Inventor: Koopman, Jr., Philip J.; Hebron, CT
Finn, Alan M.; Amston, CT

Assignee: United Technologies Automotive, Inc., Dearborn, MI
other patents from UNITED TECHNOLOGIES AUTOMOTIVE, INC. (597540) (approx. 411)
 News, Profiles, Stocks and More about this company

Published / Filed: 1995-03-14 / 1993-11-05

Application Number: US1993000148667

IPC Code: Advanced: G09C 1/00; H03M 13/00; H04L 9/06; H04L 9/26;
Core: H04L 9/18; more...
IPC-7: H04K 1/00; H04L 9/00;

ECLA Code: H04L9/26;

U.S. Class: Current: 380/028; 380/263;
Original: 380/028; 380/004; 380/049; 380/050;

Field of Search: 380/028,4,49,50,30,29,37

Priority Number:
1993-11-05  US1993000148667

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.

Attorney, Agent or Firm: Harness, Dickey & Pierce ;

Primary / Asst. Examiners: Cain, David C.;

Maintenance Status: CC Certificate of Correction issued

INPADOC Legal Status: Show legal status actions          Buy Now: Family Legal Status Report

Family: Show 9 known family members

First Claim:
Show all 10 claims
What is claimed is:     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.


Background / Summary: Show background / summary

Drawing Descriptions: Show drawing descriptions

Description: Show description

Forward References: Show 19 U.S. patent(s) that reference this one

       
U.S. References: Go to Result Set: All U.S. references   |  Forward references (19)   |   Backward references (14)   |   Citation Link

Buy
PDF
Patent  Pub.Date  Inventor Assignee   Title
Buy PDF- 10pp US4322577  1982-03 Brandstrom   Cryptosystem
Buy PDF- 9pp US4424414  1984-01 Hellman et al.  Board of Trustees of the Leland Stanford Junior University Exponentiation cryptographic apparatus and method
Buy PDF- 8pp US4771463  1988-09 Beeman  Siemens Transmission Systems, Inc. Digital scrambling without error multiplication
Buy PDF- 10pp US4797921  1989-01 Shiraishi  Hitachi, Ltd. System for enciphering or deciphering data
Buy PDF- 9pp US4876718  1989-10 Citta et al.  Zenith Electronics Corporation Secure data packet transmission system and method
Buy PDF- 29pp US5136642  1993-08 Kawamura et al.  Kabushiki Kaisha Toshiba Cryptographic communication method and cryptographic communication device
Buy PDF- 37pp US5146215  1992-09 Drori  Clifford Electronics, Inc. Electronically programmable remote control for vehicle security system
Buy PDF- 19pp US5191610  1993-03 Hill et al.  United Technologies Automotive, Inc. Remote operating system having secure communication of encoded messages and automatic re-synchronization
Buy PDF- 17pp US5220606  1993-06 Greenberg   Cryptographic system and method
Buy PDF- 16pp US5231667  1993-07 Kojima  Sony Corporation Scrambling/descrambling circuit
Buy PDF- 18pp US5272755  1993-12 Miyaji et al.  Matsushita Electric Industrial Co., Ltd. Public key cryptosystem with an elliptic curve
Buy PDF- 45pp US5313530  1994-05 Iwamura  Canon Kabushiki Kaisha Calculating apparatus and method of encrypting/decrypting communication data by using the same
Buy PDF- 47pp US5317639  1994-05 Mittenthal  Teledyne Industries, Inc. Non-linear block substitution devices derived by constructive corruption
Buy PDF- 55pp US5321752  1994-06 Iwamura et al.  Canon Kabushiki Kaisha Method of and apparatus for encryption and decryption of communication data
       
Foreign References: None

Inquire Regarding Licensing

Powered by Verity


Plaques from Patent Awards      Gallery of Obscure PatentsNominate this for the Gallery...

Thomson Reuters Copyright © 1997-2010 Thomson Reuters 
Subscriptions  |  Web Seminars  |  Privacy  |  Terms & Conditions  |  Site Map  |  Contact Us  |  Help