How to construct pseudorandom permutations from pseudorandom functions
SIAM Journal on Computing - Special issue on cryptography
Differential cryptanalysis of the data encryption standard
Differential cryptanalysis of the data encryption standard
Provable Security for Block Ciphers by Decorrelation
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Decorrelated Fast Cipher: An AES Candidate Well Suited for Low Cost Smart Card Applications
CARDIS '98 Proceedings of the The International Conference on Smart Card Research and Applications
The First Experimental Cryptanalysis of the Data Encryption Standard
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
New Structure of Block Ciphers with Provable Security against Differential and Linear Cryptanalysis
Proceedings of the Third International Workshop on Fast Software Encryption
A Fast New DES Implementation in Software
FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
Difference Distribution Attack on DONUT and Improved DONUT
ICISC '00 Proceedings of the Third International Conference on Information Security and Cryptology
Adaptive-Attack Norm for Decorrelation and Super-Pseudorandomness
SAC '99 Proceedings of the 6th Annual International Workshop on Selected Areas in Cryptography
Decorrelation over Infinite Domains: The Encrypted CBC-MAC Case
SAC '00 Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography
SAC '00 Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography
New Block Cipher DONUT Using Pairwise Perfect Decorrelation
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
On the Decorrelated Fast Cipher (DFC) and Its Theory
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
Hybrid symmetric encryption using known-plaintext attack-secure components
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
Expanding weak PRF with small key size
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
| Hi-index | 0.00 |
Recently, we showed how to strengthen block ciphers by decorrelation techniques. In particular, we proposed two practical block ciphers, one based on the GF(2n)-arithmetics, the other based on the x mod p mod 2n primitive with a prime p = 2n(1 + δ). In this paper we show how to achieve similar decorrelation with a prime p = 2n(1 - δ). For this we have to change the choice of the norm in the decorrelation theory and replace the L∞ norm by the L2 norm. We propose a new practical block cipher which is provably resistant against Differential and linear cryptanalysis.