In this age of information, there is increasing need not only for speed as well as accuracy in th... more In this age of information, there is increasing need not only for speed as well as accuracy in the storage, retrieval, and transmission of data. Error correcting codes are a kind of safety net- the mathematical insurance against the vagaries of an imperfect digital world, due to faulty transmission channel, manmade and non-manmade errors, to recover the original data from the corrupted one. Here the approach is to take the unsystematic variant of cyclic code and its implementation in the Motorola DSP 56F8300 hybrid board. This chip has the luxury of having both microcontroller and digital signal processor characteristics on board. Processor Expert® based IDE was used for this purpose and the implementation has been checked with respect to MATLAB® program based output as well as digital TTL gate based hardware. The unsystematic variant has been chosen to eradicate the necessity of the look up tables as required in case of the systematic cyclic codes and on board it has been checked for (3, 1), (7, 4), (15, 11), (31, 26) and (63, 57) codes.
Traditionally message authentication codes (MACs) and the process of encryption are treated as or... more Traditionally message authentication codes (MACs) and the process of encryption are treated as orthogonal security mechanisms, where MACs are used to prove data authenticity while encryption is used to preserve confidentiality. In this paper we propose to integrate the two in a framework where the parameterized hash value of an encrypted image is designed to be the same as the hash value of the parent unencrypted original image. This form of privacy preserving authentication has applications in database searches containing sensitive files such as sets of patient's X-ray records. The main challenge here is to develop a parametric hashing algorithm that is invariant to encryption by allowing a small part of the statistical signature of the original image to emerge despite the encryption process. Since the hash value is computed without decrypting the original data, one can prove authenticity without actually revealing the information. Our contribution is twofold: (1) Formulation of this new problem of authenticating encrypted data and (2) Development of a simple hashing algorithm applicable to encrypted images.
In this age of information, there is increasing need not only for speed as well as accuracy in th... more In this age of information, there is increasing need not only for speed as well as accuracy in the storage, retrieval, and transmission of data. Error correcting codes are a kind of safety net- the mathematical insurance against the vagaries of an imperfect digital world, due to faulty transmission channel, manmade and non-manmade errors, to recover the original data from the corrupted one. Here the approach is to take the unsystematic variant of cyclic code and its implementation in the Motorola DSP 56F8300 hybrid board. This chip has the luxury of having both microcontroller and digital signal processor characteristics on board. Processor Expert® based IDE was used for this purpose and the implementation has been checked with respect to MATLAB® program based output as well as digital TTL gate based hardware. The unsystematic variant has been chosen to eradicate the necessity of the look up tables as required in case of the systematic cyclic codes and on board it has been checked for (3, 1), (7, 4), (15, 11), (31, 26) and (63, 57) codes.
Traditionally message authentication codes (MACs) and the process of encryption are treated as or... more Traditionally message authentication codes (MACs) and the process of encryption are treated as orthogonal security mechanisms, where MACs are used to prove data authenticity while encryption is used to preserve confidentiality. In this paper we propose to integrate the two in a framework where the parameterized hash value of an encrypted image is designed to be the same as the hash value of the parent unencrypted original image. This form of privacy preserving authentication has applications in database searches containing sensitive files such as sets of patient's X-ray records. The main challenge here is to develop a parametric hashing algorithm that is invariant to encryption by allowing a small part of the statistical signature of the original image to emerge despite the encryption process. Since the hash value is computed without decrypting the original data, one can prove authenticity without actually revealing the information. Our contribution is twofold: (1) Formulation of this new problem of authenticating encrypted data and (2) Development of a simple hashing algorithm applicable to encrypted images.
Uploads
Papers by Sachin Kashyap