A New Birthday-Type Algorithm for Attacking the Fresh Re-Keying Countermeasure

The fresh re-keying scheme is a countermeasure designed to protect low-cost devices against side-channel attacks. In this paper, we present a new birthdaytype attack based on a refined reduction to Ring-LPN with a reducible polynomial. Compared with the previous research, our algorithm significantly reduces the time complexity in the 128-bit leakage model—with an SNR equal to 8 and at most 220

• Type: Journal
• Year: 2016
• Where: IACR
• Authors: Qian Guo, Thomas Johansson 0001
• Keywords: Biometrics, IACR 2016