This paper discusses the implementation of number theoretic transforms defined in complex residue rings. A selection of transform parameters for lookup table and microprocessor realizations are discussed. When the length of the convolution is moderate, the lookup table approach offers greater flexibility in the choice of dynamic range. The microprocessor implementation is shown to handle a number theoretic transform of 840 complex samples.

Residue number system implementations of number theoretic transforms in complex residue rings

In this paper, we propose a multilevel database encryption system with subkeys. This new system is called the record-oriented cryptosystem which encrypts each record with different field-subkeys according to a security class of the data element. Each field is decrypted individually by the field-subkeys of which security class is higher than or equal to that of the encrypted field-subkeys. This system is based on the Chinese Remainder Theorem. Our scheme can protect the finest level of granularity such as relation level, attribute level, tuple level, or data element level in the relational database model.

/pdf/multilevel-secure-database-encryption-with-subkeys-3ajvxeoelv.pdf

Multilevel secure database encryption with subkeys

https://ir.nctu.edu.tw/bitstream/11536/1614/1/A1995TG01800006.pdf

A two-phase encryption scheme for enhancing database security

Fast and efficient implementation of a residue number to integer converters will be required to design fast residue number systems. This paper addresses the question of hardware implementation and presents several distinctly different supporting archi- tectures. Both designs are analyzed and compared in terms of their speed-complexity tradeoffs.

William. Dirr

Papers

On implementing the CRT in residue arithmetic