Differentially uniform mappings for cryptography
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Linear cryptanalysis method for DES cipher
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
The Design of Rijndael
Ciphers with Arbitrary Finite Domains
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
Differential Cryptanalysis of DES-like Cryptosystems
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
A Known Plaintext Attack of FEAL-4 and FEAL-6
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Markov ciphers and differential cryptanalysis
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
A new method for known plaintext attack of FEAL cipher
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Software Oriented Stream Ciphers Based upon FCSRs in Diversified Mode
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
X-FCSR: a new software oriented stream cipher based upon FCSRs
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Linear cryptanalysis of non binary ciphers
SAC'07 Proceedings of the 14th international conference on Selected areas in cryptography
Differential properties of elliptic curves and blind signatures
ISC'07 Proceedings of the 10th international conference on Information Security
| Hi-index | 0.00 |
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 ${\mathbb{F}_p}$. Using this framework, we describe a toy cipher, that operates on blocks of 32 decimal digits, and study its security against common attacks.