Database encryption and decryption circuit and method using subkeys

• US 4,375,579 A
• Filed: 01/30/1980
• Issued: 03/01/1983
• Est. Priority Date: 01/30/1980
• Status: Expired due to Term

• Current Assignee: Wisconsin Alumni Research Foundation (University of Wisconsin System)
• Original Assignee: Wisconsin Alumni Research Foundation (University of Wisconsin System)
• Inventors: Davida, George I., Wells, David L., Kam, John B.
• Primary Examiner(s): Cangialosi, Sal
• Application Number:
  US06/117,140
• Time in Patent Office: 1,126 Days
• Field of Search: 178/22.10
• US Class Current: 380/28
• CPC Class Codes: G06F 21/6209 to a single file or object, e.g. in a secure envelope, encrypted and accessed using a key, or with access control rules appended to the object itself
• CPC Class Codes: G06F 21/72 in cryptographic circuits

Abstract

An encryption and decryption circuit and method using subkeys which is therefore particularly useful for the encryption and decryption of database information. Each data field has a corresponding write key and a different read key. A database record is encrypted by multiplying each field by its corresponding write key and adding up all such products modulo the product of all read keys. The read keys must be prime numbers and the write keys must satisfy a certain relationship with respect to the read keys. A database record may have a single field decrypted by dividing the encrypted record by the read key for that field and taking the remainder. The security of each field may thereby be individually controlled without compromising the security of the entire record.

Claims

1. A method for encryption of a data record consisting of a plurality of fields, f_i, and for decryption of a field, f_i, from the encrypted record, comprising the steps of:

choosing a read key, d_i, and write key, e_i, corresponding to each field, i, such that each d_i is a prime number, D is the product of all d_i and each e_i is chosen such that e_i =1 modulo d_i, and e_i =0 modulo d_j for all j≠

i;

multiplying each of said plurality of fields by said corresponding key field, e_i, to yield an intermediate product;

summing all of said intermediate products modulo D to yield an encrypted version of said data record;

decrypting a field f_i from said encrypted version of said data record by dividing said encrypted version of said data record by said read key d_i corresponding to said field f_i to yield a decrypted version of said field f_i ;

concatenating each of said plurality of fields, f_i, with a randomly chosed number prior to multiplication by said corresponding key field; and

removing said randomly chosen number from said decrypted version of said field f_i after decryption.

2. A method for encryption of a data record consisting of a plurality of fields, f_i, and for decryption of a field, f_i, from the encrypted record, comprising the steps of:

choosing a read key, d_i, and write key, e_i, corresponding to each field, i, such that each d_i is a prime number, D is the product of all d_i and each e_i is chosen such that e_i =1 modulo d_i, and e_i =0 modulo d_j for all j≠

i;

multiplying each of said plurality of fields by said corresponding key field, e_i, to yield an intermediate product;

summing all of said intermediate products modulo D to yield an encrypted version of said data record;

decrypting a field f_i from said encrypted version of said data record by dividing said encrypted version of said data record by said read key d_i corresponding to said field f_i to yield a decrypted version of said field f_i ;

concatenating each of said plurality of fields, f_i, with a signature field prior to multiplication by said corresponding key field; and

removing said signature field from said decrypted version of said field f_i after decryption.