Sciweavers

Share
IACR
2016

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

5 years 6 months ago
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
Qian Guo, Thomas Johansson 0001
Added 03 Apr 2016
Updated 03 Apr 2016
Type Journal
Year 2016
Where IACR
Authors Qian Guo, Thomas Johansson 0001
Comments (0)
books