Luby–Rackoff Revisited: On the Use of Permutations as Inner Functions of a Feistel Scheme

How to Construct Pseudorandom Permutations from Pseudorandom Functions

Michael Luby, Charles Rackoff · SIAM Journal on Computing · 1988 · 935 citations

Computing, Computer Science, Algorithms +10

On the Construction of Pseudorandom Permutations: Luby—Rackoff Revisited

Moni Naor, Omer Reingold · Journal of Cryptology · 1999 · 289 citations · Full text

Computing, Computer Science, Mathematics +12

Provable security against a differential attack

Kaisa Nyberg, Lars R. Knudsen · Journal of Cryptology · 1995 · 192 citations · Full text

Computing, Computer Engineering, Computer Science +5

Strict Evaluation of the Maximum Average of Differential Probability and the Maximum Average of Linear Probability

Kazumaro Aoki, Kazuo Ohta · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 1997 · 37 citations

Natural Sciences, Mathematics, Probability Theory +6

On Weaknesses of Non–surjective Round Functions

Vincent Rijmen, Bart Preneel, Erik De Win · Designs Codes and Cryptography · 1997 · 35 citations

Computing, Computer Science, Mathematics +7