A database encryption system with subkeys

A new cryptosystem that is suitable for database encryption is presented. The system has the important property of having subkeys that allow the encryption and decryption of fields within a record. The system is based on the Chinese Remainder Theorem.

[1]  David L. Wells,et al.  Database Security , 1978, IEEE Transactions on Software Engineering.

[2]  Donald E. Knuth.  The Art of Computer Programming 2 / Seminumerical Algorithms , 1971 .

[3]  D. Wells.  Achieving data base protection through the use of subkey encryption , 1980 .

[4]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[5]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[6]  John B. Kam,et al.  Structured Design of Substitution-Permutation Encryption Networks , 1979, IEEE Transactions on Computers.

[7]  Lance J. Hoffman,et al.  Modern methods for computer security and privacy , 1973 .

[8]  Jeffrey D. Ullman,et al.  A model of statistical database their security , 1977, TODS.

[9]  G. I. Davida,et al.  Microprocessors And Data Encryption , 1979 .

[10]  Robert J. McEliece,et al.  A public key cryptosystem based on algebraic coding theory , 1978 .

[11]  Naftaly H. Minsky.  Intentional resolution of privacy protection in database systems , 1976, CACM.

[12]  L. E. Dickson.  Introduction to the theory of numbers , 1933 .

[13]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[14]  Martin E. Hellman,et al.  Hiding information and signatures in trapdoor knapsacks , 1978, IEEE Trans. Inf. Theory.

[15]  E. T..  An Introduction to the Theory of Numbers , 1946, Nature.

[16]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.