Sow, Djiby

video/mp4In this talk, a new IND-CCA2 NTRU-like Cryptosystem is presented. First, we introduce a new hard problem, namely the Decisional Ring Bounded Distance Decoding problem (DR-BDD), and after we propose an NTRU-like encryption scheme over Ideal-lattices (with non-sparse polynomials) which is IND-CPA secure in the standard model relatively to DR-BDD. This last scheme is the same as in NTRU Prime, which is known to block the classical attacks that exploit special structures of the classical rings used in R-LWE based cryptosystems, namely rings of cyclotomic number fields.講演者所属: University Cheikh Anta Diop of Dakar講演日: 平成28年10月17日講演場所: 情報科学研究科大講義室L

A new IND-CCA2 NTRU-like Cryptosystem for post-quantum cryptography with security proof in the standard model

Abstract

Similar works

Full text

Available Versions

Institutional Repositories DataBase (IRDB)