The cryptographic power of random selection
From MaRDI portal
Publication:2889867
DOI10.1007/978-3-642-28496-0_8zbMATH Open1292.94096OpenAlexW131498960MaRDI QIDQ2889867FDOQ2889867
Authors: Matthias Krause, Matthias Hamann 
Publication date: 8 June 2012
Published in: Selected Areas in Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-28496-0_8
Recommendations
- Efficient Cryptographic Protocols Based on the Hardness of Learning Parity with Noise
- Cryptography from learning parity with noise
- An Algorithm for Solving the LPN Problem and Its Application to Security Evaluation of the HB Protocols for RFID Authentication
- An Improved LPN Algorithm
- On the robustness of learning parity with noise
Cites Work
- The Magma algebra system. I: The user language
- On lattices, learning with errors, random linear codes, and cryptography
- New Algorithms for Learning in Presence of Errors
- Efficient algorithms for solving overdefined systems of multivariate polynomial equations
- PRESENT: An Ultra-Lightweight Block Cipher
- Title not available (Why is that?)
- Title not available (Why is that?)
- Advances in Cryptology - CRYPTO 2003
- Authenticating Pervasive Devices with Human Protocols
- : Increasing the Security and Efficiency of
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - CRYPTO 2003
- KATAN and KTANTAN — A Family of Small and Efficient Hardware-Oriented Block Ciphers
- On the Security of HB# against a Man-in-the-Middle Attack
- Trusted-HB: A Low-Cost Version of HB$^+$ Secure Against Man-in-the-Middle Attacks
- More on the Security of Linear RFID Authentication Protocols
Cited In (3)
Uses Software
This page was built for publication: The cryptographic power of random selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2889867)
