中央研究院 資訊科學研究所

活動訊息

友善列印

列印可使用瀏覽器提供的(Ctrl+P)功能

McBits: fast constant-time code-based cryptography

:::

McBits: fast constant-time code-based cryptography

  • 講者Tung Chou 博士 (Technical University of Eindhoven)
    邀請人:楊柏因
  • 時間2013-04-17 (Wed.) 15:00 ~ 16:00
  • 地點資訊所新館106演講廳
摘要

This paper presents extremely fast algorithms for code-based public-key cryptography, including full protection against timing attacks. For example, this paper achieves a reciprocal throughput of just 36615 cycles per decryption at a $2^{80}$ security level on a single Ivy Bridge core. These algorithms rely on an additive FFT for fast root computation, a transposed additive FFT for fast syndrome computation, and a sorting network to avoid cache-timing attacks.