The cryptographic power of random selection

DOI10.1007/978-3-642-28496-0_8MaRDI QIDQ2889867zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Algebraic AttacksAlgorithmic LearningFoundations and Complexity TheoryLightweight Cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

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

• scientific article; zbMATH DE number 2009966 (Why is no real title available?)
• scientific article; zbMATH DE number 2081058 (Why is no real title available?)
• : Increasing the Security and Efficiency of
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology - EUROCRYPT 2004
• Authenticating Pervasive Devices with Human Protocols
• Efficient algorithms for solving overdefined systems of multivariate polynomial equations
• KATAN and KTANTAN — A Family of Small and Efficient Hardware-Oriented Block Ciphers
• More on the Security of Linear RFID Authentication Protocols
• New Algorithms for Learning in Presence of Errors
• On lattices, learning with errors, random linear codes, and cryptography
• On the Security of HB# against a Man-in-the-Middle Attack
• PRESENT: An Ultra-Lightweight Block Cipher
• The Magma algebra system. I: The user language
• Trusted-HB: A Low-Cost Version of HB$^+$ Secure Against Man-in-the-Middle Attacks

Cited in

(3)

• Selective-Opening Security in the Presence of Randomness Failures
• scientific article; zbMATH DE number 7774290 (Why is no real title available?)
• A protocol for provably secure authentication of a tiny entity to a high performance computing one

Describes a project that uses

Uses Software

• KATAN
• KTANTAN
• PRESENT
• Magma

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)