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_5zbMATH Open1175.94078OpenAlexW1589129743MaRDI QIDQ5458265FDOQ5458265
Authors: Marc Fossorier, Miodrag J. Mihaljević, Yang Cui, Kanta Matsuura, Hideki 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
Recommendations
Cited In (14)
- Optimization of \(\mathsf {LPN}\) solving algorithms
- How to Encrypt with the LPN Problem
- On solving LPN using BKW and variants, Implementation and analysis
- : Increasing the Security and Efficiency of
- Solving the learning parity with noise's open question
- Good Variants of HB + Are Hard to Find
- Parallel and concurrent security of the HB and \(HB^{+}\) protocols
- SQUASH – A New MAC with Provable Security Properties for Highly Constrained Devices Such as RFID Tags
- An approach for stream ciphers design based on joint computing over random and secret data
- Two attacks against the \(F _{f }\) RFID protocol
- A survey on fast correlation attacks
- The cryptographic power of random selection
- Fast Correlation Attacks: Methods and Countermeasures
- An Improved LPN Algorithm
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458265)