TOC
Djiby Sow
生駒 : 奈良先端科学技術大学院大学, 2016.10
Lecture Archive
| No. | Printing year | Location | Call Number | Material ID | Circulation class | Status | Waiting |
|---|---|---|---|---|---|---|---|
|
1 |
|
|
M013953 |
|
|
|
In 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.
2016
電子化映像資料(52分47秒)
情報科学研究科・ゼミナール講演 ; 平成28年度
講演者所属: University Cheikh Anta Diop of Dakar
講演日: 平成28年10月17日
講演場所: 情報科学研究科大講義室L1
Japan
English (eng)
English (eng)
