A Statistical Attack of the FEAL-8 Cryptosystem
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
Differential cryptanalysis of feal and N-hash
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Fast data encipherment algorithm FEAL
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Hi-index | 0.01 |
FEAL-N proposed by NTT is an N-round block cipher which is well suited for a fast software execution. We research the method which improves FEAL algorithm against cryptanalysis based on the careful analysis of data randomizer. Since the round function f used as data randomizer has an inverse function f-1, we have already shown that there exists a key-independent relation between plaintext and ciphertext.In this paper, we apply our attack to the ciphertext only attack for one-way function of the MAP using only one ciphertext. Computer implementation of the proposed attack shows that the improvement of the computational complexity to obtain the plaintext is decreased and given by O(232).