 |
|
|
|
| HAL: inria-00071964, version 1 |
| See detailed view |  BibTeX,EndNote,... |
|
|
|
|
| CTRU, a polynomial analogue of NTRU |
|
|
| Philippe Gaborit 1Julien Ohler |
|
|
| (2002-11) |
|
|
|
| CTRU, a new public-key cryptosystem is introduced. In this analogue of NTRU, the ring of integers is replaced by the ring of polynomials in one variable over a finite field. Attacks based on either the LLL algorithm or the Chinese Remainder Theorem are avoided. An important tool of cryptanalys- is is the Popov normal form of matrices with polynomial entries. The speed of encryption/decryption of CTRU is the same as NTRU for the same value of N. An implementation in Aldor is described. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | CAFE (INRIA Sophia Antipolis) |
|
|
|
INRIA |
|
|
|
|
|
|
|
|
|
| Domain | : | Computer Science/Other |
|
|
| CRYPTOGRAPHY / NTRU / POPOV NORMAL FORM / VARSHAMOV GILBERT BOUND |
|
|
|
| Attached file list to this document: | ||||||||||
|
||||||||||
|
|
|
| inria-00071964, version 1 | |
| http://hal.inria.fr/inria-00071964 | |
| oai:hal.inria.fr:inria-00071964 | |
| From: Rapport De Recherche Inria | |
| Submitted on: Tuesday, 23 May 2006 19:22:30 | |
| Updated on: Wednesday, 31 May 2006 14:24:26 | |
