HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

CTRU, a polynomial analogue of NTRU

Philippe Gaborit 1 Julien Ohler Patrick Solé
1 CAFE - Computer algebra and functional equations
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : 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.
Document type :
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 7:22:30 PM
Last modification on : Friday, February 4, 2022 - 3:24:41 AM
Long-term archiving on: : Sunday, April 4, 2010 - 10:46:39 PM


  • HAL Id : inria-00071964, version 1



Philippe Gaborit, Julien Ohler, Patrick Solé. CTRU, a polynomial analogue of NTRU. RR-4621, INRIA. 2002. ⟨inria-00071964⟩



Record views


Files downloads