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
New Structure of Block Ciphers with Provable Security against Differential and Linear Cryptanalysis
Proceedings of the Third International Workshop on Fast Software Encryption
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
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
Security of the MISTY structure in the luby-rackoff model: improved results
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
| Hi-index | 0.00 |
Four round Feistel permutation (like DES) is super-pseudo-random if each round function is random or a secret universal hash function. A similar result is known for five round MISTY type permutation. It seems that each round function must be at least either random or secret in both cases.In this paper, however, we show that the second round permutation g in five round MISTY type permutation need not be cryptographic at all, i.e., no randomness nor secrecy is required. g has only to satisfy that g(x) 驴 x 驴 g(x驴) 驴 x驴 for any x 驴 x驴. This is the first example such that a non-cryptographic primitive is substituted to construct the minimum round super-pseudorandom permutation. Further we show efficient constructions of super-pseudorandom permutations by using above mentioned g.