The invertibility of the XOR of rotations of a binary word

Rivest, Ronald L.

doi:10.1080/00207161003596708

Cited by 12 publications

(3 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This construction is known to be invertible in general for distinct rotation offsets [Riv11], and the designers of RoadRunneR argue that this particular set of rotation offsets has good diffusion properties.…”

Section: Substitution Layer the Substitution Layer S Consists Of A Pmentioning

confidence: 99%

Refined Probability of Differential Characteristics Including Dependency Between Multiple Rounds

Canteaut

Lambooij

Neves

et al. 2017

ToSC

View full text Add to dashboard Cite

The current paper studies the probability of differential characteristics for an unkeyed (or with a fixed key) construction. Most notably, it focuses on the gap between two probabilities of differential characteristics: probability with independent S-box assumption, pind, and exact probability, pexact. It turns out that pexact is larger than pind in Feistel network with some S-box based inner function. The mechanism of this gap is then theoretically analyzed. The gap is derived from interaction of S-boxes in three rounds, and the gap depends on the size and choice of the S-box. In particular the gap can never be zero when the S-box is bigger than six bits. To demonstrate the power of this improvement, a related-key differential characteristic is proposed against a lightweight block cipher RoadRunneR. For the 128-bit key version, pind of 2−48 is improved to pexact of 2−43. For the 80-bit key version, pind of 2−68 is improved to pexact of 2−62. The analysis is further extended to SPN with an almost-MDS binary matrix in the core primitive of the authenticated encryption scheme Minalpher: pind of 2−128 is improved to pexact of 2−96, which allows to extend the attack by two rounds.

show abstract

Section: Substitution Layer the Substitution Layer S Consists Of A Pmentioning

confidence: 99%

Refined Probability of Differential Characteristics Including Dependency Between Multiple Rounds

Canteaut

Lambooij

Neves

et al. 2017

ToSC

View full text Add to dashboard Cite

show abstract

“…A better way to analyze operations on circulant-P2 matrices is to convert them to polynomials, as used in [30]. Every vector can be represented in a polynomial form, as described in the following definition.…”

Section: Matrix Operations and Propertiesmentioning

confidence: 99%

“…Main technique in Algorithm 1 is adopted from [30], and we develop the solution for the case of Hwt(κ) being even. This algorithm applies to all kinds of circulant-P2 matrices' inverses if they exists.…”

Section: It Is Clear From the Above Equation Thatmentioning

confidence: 99%

Secure and Efficient LCMQ Entity Authentication Protocol

Gong

Qin

2013

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

The simple, computationally efficient HB-like entity authentication protocols based on the learning parity with noise (LPN) problem have attracted a great deal of attention in the past few years due to the broad application prospect in low-cost RFID tags. However, all previous protocols are vulnerable to a man-in-the-middle attack discovered by Ouafi, Overbeck, and Vaudenay. In this paper, we propose a lightweight authentication protocol named LCMQ and prove it secure in a general man-in-the-middle model. The technical core in our proposal is a special type of circulant matrix, for which we prove the linear independence of matrix vectors, present efficient algorithms on matrix operations, and describe a secure encryption against ciphertext-only attack. By combining all of those with LPN and related to the multivariate quadratic problem, the LCMQ protocol not only is provably secure against all probabilistic polynomial-time adversaries, but also outperforms all HB-like protocols, in terms of tag's computation overhead, storage expense, and communication cost.

show abstract

Security Analysis of ASCON Cipher Under Persistent Faults

Das,

Mazumdar

2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

The invertibility of the XOR of rotations of a binary word

Cited by 12 publications

References 7 publications

Refined Probability of Differential Characteristics Including Dependency Between Multiple Rounds

Refined Probability of Differential Characteristics Including Dependency Between Multiple Rounds

Secure and Efficient LCMQ Entity Authentication Protocol

Security Analysis of ASCON Cipher Under Persistent Faults

Contact Info

Product

Resources

About