International Workshop on Fast Software Encryption

FSE 2007: Fast Software Encryption pp 452-465

Perfect Block Ciphers with Small Blocks

  • Louis Granboulan
  • Thomas Pornin
Conference paper

DOI: 10.1007/978-3-540-74619-5_28

Volume 4593 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Granboulan L., Pornin T. (2007) Perfect Block Ciphers with Small Blocks. In: Biryukov A. (eds) Fast Software Encryption. FSE 2007. Lecture Notes in Computer Science, vol 4593. Springer, Berlin, Heidelberg


Existing symmetric encryption algorithms target messages consisting of elementary binary blocks of at least 64 bits. Some applications need a block cipher which operates over smaller and possibly non-binary blocks, which can be viewed as a pseudo-random permutation of n elements. We present an algorithm for selecting such a random permutation of n elements and evaluating efficiently the permutation and its inverse over arbitrary inputs. We use an underlying deterministic RNG (random number generator). Each evaluation of the permutation uses O(logn) space and O((logn)3) RNG invocations. The selection process is “perfect”: the permutation is uniformly selected among the n! possibilities.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Louis Granboulan
    • 1
  • Thomas Pornin
    • 2
  1. 1.École Normale Supérieure; EADS 
  2. 2.Cryptolog International, ParisFrance