The Rainbow Attack on Stream Ciphers Based on Maiorana-McFarland Functions

Khoo, Khoongming; Gong, Guang; Lee, Hian-Kiat

doi:10.1007/11767480_13

Cited by 8 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note that neglecting this scanning task is a common practices employed and reported in the literature: see e.g. [11, Table I], [6, p. 354], [7, Table 2], [14,Remark 5]). (An additional justification for neglecting the screening complexity originates from the fact that in certain scenarios where the same secret key is assigned to a group of entities, the sample collection-screening can be performed in parallel.…”

Section: Theoremmentioning

confidence: 98%

An Algorithm for Solving the LPN Problem and Its Application to Security Evaluation of the HB Protocols for RFID Authentication

Fossorier

Mihaljević

Imai

et al. 2006

Progress in Cryptology - INDOCRYPT 2006

View full text Add to dashboard Cite

Abstract. An algorithm for solving the "learning parity with noise" (LPN) problem is proposed and analyzed. The algorithm originates from the recently proposed advanced fast correlation attacks, and it employs the concepts of decimation, linear combining, hypothesizing and minimum distance decoding. However, as opposed to fast correlation attacks, no preprocessing phase is allowed for the LPN problem. The proposed algorithm appears as more powerful than the best one previously reported known as the BKW algorithm proposed by Blum, Kalai and Wasserman. In fact the BKW algorithm is shown to be a special instance of the proposed algorithm, but without optimized parameters. An improved security evaluation, assuming the passive attacks, of Hopper and Blum HB and HB + protocols for radio-frequency identification (RFID) authentication is then developed. Employing the proposed algorithm, the security of the HB protocols is reevaluated, implying that the previously reported security margins appear as overestimated.

show abstract

Section: Theoremmentioning

confidence: 98%

An Algorithm for Solving the LPN Problem and Its Application to Security Evaluation of the HB Protocols for RFID Authentication

Fossorier

Mihaljević

Imai

et al. 2006

Progress in Cryptology - INDOCRYPT 2006

View full text Add to dashboard Cite

show abstract

“…The nonlinearity of n-variable M-M resilient functions cannot exceed 2 n−1 − 2 ⌊n/2⌋ . The M-M technique in general does not generate degreeoptimized functions and the M-M functions are potentially cryptographically weak [2], [9].…”

Section: Introductionmentioning

confidence: 99%

Constructions of Almost Optimal Resilient Boolean Functions on Large Even Number of Variables

Zhang

Xiao

2009

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

In this paper, a technique on constructing nonlinear resilient Boolean functions is described. By using several sets of disjoint spectra functions on a small number of variables, an almost optimal resilient function on a large even number of variables can be constructed. It is shown that given any m, one can construct infinitely many n-variable (n even), m-resilient functions with nonlinearity > 2 n−1 − 2 n/2 . A large class of highly nonlinear resilient functions which were not known are obtained. Then one method to optimize the degree of the constructed functions is proposed. Last, an improved version of the main construction is given.

show abstract

An Improved Time-Memory-Data Trade-Off Attack against Irregularly Clocked and Filtered Keystream Generators

Jiao

Wang

Zhang

et al. 2013

Information Security and Cryptology

View full text Add to dashboard Cite

The Rainbow Attack on Stream Ciphers Based on Maiorana-McFarland Functions

Cited by 8 publications

References 14 publications

An Algorithm for Solving the LPN Problem and Its Application to Security Evaluation of the HB Protocols for RFID Authentication

An Algorithm for Solving the LPN Problem and Its Application to Security Evaluation of the HB Protocols for RFID Authentication

Constructions of Almost Optimal Resilient Boolean Functions on Large Even Number of Variables

An Improved Time-Memory-Data Trade-Off Attack against Irregularly Clocked and Filtered Keystream Generators

Contact Info

Product

Resources

About