log in  |  register  |  feedback?  |  help  |  web accessibility
Logo
Chinese Reminder Theorem and Small Field Attack in R-LWE
Huijing Gong - UMD
3460 A.V. Williams Building (AVW)
Friday, November 18, 2016, 11:00 am-12:00 pm Calendar
  • You are subscribed to this talk through .
  • You are watching this talk through .
  • You are subscribed to this talk. (unsubscribe, watch)
  • You are watching this talk. (unwatch, subscribe)
  • You are not subscribed to this talk. (watch, subscribe)
Abstract

This talk presents a one-pass authenticated key exchange protocol Π1 proposed by [ZZDS14] and present a new type of attack, small field attack (SFA), against the one-pass protocol Π1 [GZ16]. By this attack, adversary can recover the static secret key from honest party in Π1 with high probability. The SFA attack is efficient and powerful in practice, which is hard for honest party to prevent, or even detect.  In addition, this talk covers some properties regarding the Chinese Reminder Theorem basis of Rq, which is essential for the small field attack ([GZ16], [LPR13a]).

 

Source:

[GZ16] https://eprint.iacr.org/2016/913

[LPR13a] https://eprint.iacr.org/2012/230

[ZZDS14] https://eprint.iacr.org/2014/589

 

This talk is organized by Mukul