The Cryptographic Power of Random Selection

  title={The Cryptographic Power of Random Selection},
  author={Matthias Krause and Matthias Hamann},
  booktitle={IACR Cryptol. ePrint Arch.},
The principle of random selection and the principle of adding biased noise are new paradigms used in several recent papers for constructing lightweight RFID authentication protocols. The cryptographic power of adding biased noise can be characterized by the hardness of the intensively studied Learning Parity with Noise (LPN) Problem. In analogy to this, we identify a corresponding learning problem for random selection and study its complexity. Given L secret linear functions $f_1,\ldots,f_L… 

Lightweight Cryptography on Ultra-Constrained RFID Devices

This thesis presents LIZARD, a new lightweight stream cipher for ultra-constrained RFIDs, which combines the explicit use of packet mode with a new type of state initialization algorithm and is particularly suitable for passive RFID tags, which obtain their energy exclusively through an electromagnetic field radiated by the reading device.

Hardware Efficient Authentication based on Random Selection

This work considers a leakage-resilient re-keying function and evaluates its security at different abstraction levels, and hopes that the design principles on which it is based will trigger the interest of symmetric cryptographers to design new block ciphers combining good properties for secure implementations and security against black box (mathematical) cryptanalysis.

Area efficient cryptographic ciphers for resource constrained devices

This paper proposes lightweight cryptography for FPGAs by introducing block cipher independent optimization techniques for Altera Cyclone III FPGA and applying them to the lightweight cryptographic algorithms HIGHT and Present, which are less than half the size of the AES implementation without using block RAMs.

A Protocol for Provably Secure Authentication of a Tiny Entity to a High Performance Computing One

It is shown that the proposed authentication protocol is secure against active attacking scenarios and so called GRS man-in-the-middle (MIM) attacking scenarios, and provides reduction of the implementation complexity and at least the same level of the cryptographic security.

AES S-box using Fermat's Little Theorem for the highly constrained embedded devices

An optimization methodology that would efficiently reduces the code size of the S-box, the most expensive operation of the Advanced Encryption Standard (AES), is proposed using an inversion algorithm based on Fermat's Little Theorem.

Generic Construction of Audit Logging Schemes with Forward Privacy and Authenticity

A generic audit logging scheme with forward privacy and authenticity is proposed, which consists of a symmetric encryption scheme and a MAC function and uses a forward-secure pseudorandom generator to achieve forward security.

Sicherheit 2014: Sicherheit, Schutz und Zuverlässigkeit, Beiträge der 7. Jahrestagung des Fachbereichs Sicherheit der Gesellschaft für Informatik e.V. (GI), 19.-21. März 2014, Wien, Österreich

By making use of the user’s biometrical behavior while entering text into the smartphone, the approach transparently authenticate the user in an ongoing-fashion and is able to continuously authenticate some users with high precision.



More on the Security of Linear RFID Authentication Protocols

Some evidence is obtained that the security of (n,k,L)-protocols can be reduced to the hardness of the learning unions of linear subspaces (LULS) problem and a learning algorithm for LULS based on solving overdefined systems of degree L in Ln variables is presented.

New Algorithms for Learning in Presence of Errors

A slight (?) variation of the structured noise model, where upon pressing a button, the authors receive 10 random vectors a1, a2, ... , a10 ∈ GF(2)n, and corresponding bits b1, b2,..., b10, of which at most 3 are noisy, is introduced, and a polynomial-time algorithm to recover the secret vector u is exhibited.

The F_f-Family of Protocols for RFID-Privacy and Authentication

The lightweight Ff family of privacy-preserving authentication protocols for RFID-systems offers user-adjustable, strong authentication, and privacy against known algebraic attacks and recently popular SAT-solving attacks without requiring an expensive cryptographic hash function.

On lattices, learning with errors, random linear codes, and cryptography

A public-key cryptosystem whose hardness is based on the worst-case quantum hardness of SVP and SIVP, and an efficient solution to the learning problem implies a <i>quantum</i>, which can be made classical.

A hard-core predicate for all one-way functions

This paper proves a conjecture of [Levin 87, sec. 5.6.2] that the scalar product of Boolean vectors p, g, x is a hard-core of every one-way function ƒ, and extends to multiple (up to the logarithm of security) such bits and to any distribution on the <italic>x</italic>.

Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations

It is provided strong evidence that relinearization and XL can solve randomly generated systems of polynomial equations in subexponential time when m exceeds n by a number that increases slowly with n.

HB#: Increasing the Security and Efficiency of HB+

A new protocol is introduced that is provably resistant to attacks in the model of Juels and Weis, and at the same time is provable resistant to a broader class of active attacks that includes the attack of Gilbert et al.

Algebraic Attacks on Stream Ciphers with Linear Feedback

This paper shows how to substantially lower the degree of these equations by multiplying them by well-chosen multivariate polynomials, and is able to break Toyocrypt in 2 CPU clocks, with only 20 Kbytes of keystream, the fastest attack proposed so far.

Fast Algebraic Attacks on Stream Ciphers with Linear Feedback

This paper shows how to substantially lower the degree of these equations by multiplying them by well-chosen multivariate polynomials, and is able to break Toyocrypt in 249 CPU clocks, with only 20 Kbytes of keystream, the fastest attack proposed so far.

Privacy Protection for RFID with Hidden Subset Identifiers

A very simple and cheap but nevertheless effective protection against privacy threats for RFID-tags that relies only on properties of random sets and on linear mappings between vector spaces.