Pseudorandom Permutation Families over Abelian Groups

  title={Pseudorandom Permutation Families over Abelian Groups},
  author={Louis Granboulan and {\'E}ric Levieil and Gilles Piret},
We propose a general framework for differential and linear cryptanalysis of block ciphers when the block is not a bitstring. We prove piling-up lemmas for the generalized differential probability and the linear potential, and we study their lower bounds and average value, in particular in the case of permutations of Fp. Using this framework, we describe a toy cipher, that operates on blocks of 32 decimal digits, and study its security against common attacks. 

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper


Publications referenced by this paper.
Showing 1-10 of 13 references

Markov Ciphers and Differential Cryptanalysis

View 4 Excerpts
Highly Influenced

The Design of Rijndael

Information Security and Cryptography • 2002
View 2 Excerpts

Ciphers with Arbitrary Finite Domains

IACR Cryptology ePrint Archive • 2001
View 2 Excerpts

Cryptanalysis of Multiswap

Nikita Borisov, Monica Chew, Rob Johnson, David Wagner • 2001
View 2 Excerpts

AES proposal: Rijndael. First Advanced Encryption Standard (AES) Conference, Ventura, Canada

J. Daemen, V. Rijmen
National Institute of Standards and Technology, • 1998
View 2 Excerpts

Similar Papers

Loading similar papers…