An Algorithm for Solving the LPN Problem and Its Application to Security Evaluation of the HB Protocols for RFID Authentication
From MaRDI portal
Publication:5458265
DOI10.1007/11941378_5zbMath1175.94078OpenAlexW1589129743MaRDI QIDQ5458265
Marc Fossorier, Miodrag J. Mihaljević, Yang Cui, Kanta Matsuura, Hiroshi Imai
Publication date: 11 April 2008
Published in: Progress in Cryptology - INDOCRYPT 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11941378_5
Related Items (11)
On solving LPN using BKW and variants, Implementation and analysis ⋮ A survey on fast correlation attacks ⋮ An approach for stream ciphers design based on joint computing over random and secret data ⋮ Optimization of $$\mathsf {LPN}$$ Solving Algorithms ⋮ How to Encrypt with the LPN Problem ⋮ SQUASH – A New MAC with Provable Security Properties for Highly Constrained Devices Such as RFID Tags ⋮ Solving the learning parity with noise's open question ⋮ Fast Correlation Attacks: Methods and Countermeasures ⋮ Good Variants of HB + Are Hard to Find ⋮ Parallel and concurrent security of the HB and \(HB^{+}\) protocols ⋮ : Increasing the Security and Efficiency of
This page was built for publication: An Algorithm for Solving the LPN Problem and Its Application to Security Evaluation of the HB Protocols for RFID Authentication
