A new birthday-type algorithm for attacking the fresh re-keying countermeasure

DOI10.1016/J.IPL.2019.02.005zbMath1481.94105OpenAlexW2899902177WikidataQ122888364 ScholiaQ122888364MaRDI QIDQ1739216

Qian Guo, Thomas Johansson

Publication date: 26 April 2019

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2019.02.005

zbMATH Keywords

cryptographyLPNbirthday attacks\textsc{ring}-LPNfresh re-keying

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (1)

Learning with physical rounding for linear and quadratic leakage functions

Cites Work

• Unnamed Item
• Improved side-channel analysis of finite-field multiplication
• Enhancing Side-Channel Analysis of Binary-Field Multiplication with Bit Reliability
• A New Algorithm for Solving Ring-LPN With a Reducible Polynomial
• An Improved LPN Algorithm
• Fresh Re-keying: Security against Side-Channel and Fault Attacks for Low-Cost Devices
• Lapin: An Efficient Authentication Protocol Based on Ring-LPN
• Cryptographic Hardware and Embedded Systems - CHES 2004
• Noise-tolerant learning, the parity problem, and the statistical query model

This page was built for publication: A new birthday-type algorithm for attacking the fresh re-keying countermeasure