Algebraic Cryptanalysis of CTRU Cryptosystem

Vats, Nitin (2008) Algebraic Cryptanalysis of CTRU Cryptosystem. In: 14th Annual International Conference on Computing and Combinatorics (COCOON 2008), JUN 27-29, 2008, China, pp. 235-244.

PDF fulltext.pdf - Published Version Restricted to Registered users only Download (324kB) | Request a copy

Abstract

CTRU, a public key cryptosystem was proposed by Gaborit, Ohler and Sole. It is analogue of NTRU, the ring of integers replaced by the ring of polynomials $\mathbb{F}_2[T]$ . It attracted attention as the attacks based on either LLL algorithm or the Chinese Remainder Theorem are avoided on it, which is most common on NTRU. In this paper we presents a polynomial-time algorithm that breaks CTRU for all recommended parameter choices that were derived to make CTRU secure against popov normal form attack. The paper shows if we ascertain the constraints for perfect decryption then either plaintext or private key can be achieved by polynomial time linear algebra attack.

Item Type:	Conference Paper
Publication:	Lecture Notes in Computer Science
Publisher:	Springer
Additional Information:	Copyright of this article belongs to Springer.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	24 Feb 2010 10:35
Last Modified:	19 Sep 2010 05:55
URI:	http://eprints.iisc.ac.in/id/eprint/25867

Actions (login required)

View Item