Luby-Rackoff: 7 Rounds are Enough for 2 Security

Abstract

In [3] M. Luby and C. Rackoff have proved that 3-round random Feistel schemes are secure against all adaptative chosen plaintext attacks when the number of queries is m ¿ 2. Moreover, 4-round random Feistel schemes are also secure against all adaptative chosen plaintext and chosen ciphertext attacks when m ¿ 2. It was shown later that these bounds are tight… (More)

Topics

2 Figures and Tables