How to construct pseudorandom permutations from pseudorandom functions
SIAM Journal on Computing - Special issue on cryptography
On the Round Security of Symmetric-Key Cryptographic Primitives
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
On the Pseudorandomness of Top-Level Schemes of Block Ciphers
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Generic Attacks on Feistel Schemes
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Proceedings of the Third International Workshop on Fast Software Encryption
New Block Encryption Algorithm MISTY
FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
About Feistel Schemes with Six (or More) Rounds
FSE '98 Proceedings of the 5th International Workshop on Fast Software Encryption
New Results on the Pseudorandomness of Some Blockcipher Constructions
FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
Round Security and Super-Pseudorandomness of MISTY Type Structure
FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
Non-cryptographic Primitive for Pseudorandom Permutation
FSE '02 Revised Papers from the 9th International Workshop on Fast Software Encryption
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Generic attacks on misty schemes
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
Security analysis of the GF-NLFSR structure and four-cell block cipher
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
Increasing block sizes using feistel networks: the example of the AES
Cryptography and Security
| Hi-index | 0.00 |
In this paper we consider the security of the Misty structure in the Luby-Rackoff model, if the inner functions are replaced by involutions without fixed point. In this context we show that the success probability in distinguishing a 4-round L-scheme from a random function is O(m2/2n) (where m is the number of queries and 2n the block size) when the adversary is allowed to make adaptively chosen encryption queries. We give a similar bound in the case of the 3-round R-scheme. Finally, we show that the advantage in distinguishing a 5-round scheme from a random permutation when the adversary is allowed to adaptively chosen encryption as well as decryption queries is also O(m2/2n). This is to our knowledge the first time involutions are considered in the context of the Luby-Rackoff model.