论文信息 - Black Box Cryptanalysis of Cryptographic Primitives - 字舞流文

Black Box Cryptanalysis of Cryptographic Primitives

Serge Vaudenay | S. Vaudenay

[1] Serge Vaudenay,et al. On the Need for Multipermutations: Cryptanalysis of MD4 and SAFER , 1994, FSE.

[2] Serge Vaudenay,et al. Black Box Cryptanalysis of Hash Networks Based on Multipermutations , 1994, EUROCRYPT.

[3] Serge Vaudenay,et al. Parallel FFT-Hashing , 1993, FSE.

[4] James L. Massey,et al. SAFER K-64: A Byte-Oriented Block-Ciphering Algorithm , 1993, FSE.

[5] Serge Vaudenay,et al. FFT-Hash-II is not yet Collision-free , 1992, CRYPTO.

[6] Marc Girault,et al. FFT Hashing is not Collision-free , 1992, EUROCRYPT.

[7] Claus-Peter Schnorr,et al. FFT-Hash II, Efficient Cryptographic Hashing , 1992, EUROCRYPT.

[8] László Babai,et al. Local Expansion of Ssymmetrical Graphs , 1992, Comb. Probab. Comput..

[9] N. Alon. Eigenvalues and expanders , 1986, Comb..

[10] N. Alon,et al. il , , lsoperimetric Inequalities for Graphs , and Superconcentrators , 1985 .

[11] R. M. Tanner. Explicit Concentrators from Generalized N-Gons , 1984 .