Paper 2014/923
New Cryptosystem Using The CRT And The Jordan Normal Form
Hemlata Nagesh and Birendra Kumar Sharma
Abstract
In this paper we introduce a method for improving the implementation of GGH cryptosystem using the Chinese Remainder Theorem (CRT) and jordan normal form. In this paper we propose a method for improving the speed of Babai’s Round- Off CVP approximation algorithm [1] in lattices using the Chinese Remainder Theorem (CRT) then formulate a new lattice-based cryptosystem usng jordan normal form instead of hermite normal form would improve substantially the efficiency of the lattice based cryptosystem having Goldreich-Goldwaser-Halevi cryptosystem.
Note: The IACR Ethics Committee has determined that this paper plagiarises published work of others by copying substantial material without properly acknowledging this. The paper has been removed by the administrator and can no longer be updated; the authors have been informed.
Metadata
- Available format(s)
- -- withdrawn --
- Category
- Public-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- LatticesJordan Normal FormCRT
- Contact author(s)
- 5hemlata5 @ gmail com
- History
- 2015-02-06: withdrawn
- 2014-11-11: received
- See all versions
- Short URL
- https://ia.cr/2014/923
- License
-
CC BY