Advertisement

A Known Plaintext Attack of FEAL-4 and FEAL-6

  • Anne Tardy-Corfdir
  • Henri Gilbert
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 576)

Abstract

We present new results on the cryptanalysis of the FEAL-N blockcipher. As a matter of fact, almost all the attacks of this cryptosystem published so far are chosen plaintext attacks [3,4,5,7], except the announcement in [7] of a non-differential known plaintext attack of FEAL-4 which requires about 100000 plaintext blocks. We describe known plaintext attacks of FEAL-4 and FEAL-6, which require about 1000 and 20000 plaintext blocks respectively and are based on correlations with linear functions. Using similar methods, we have also found more recently an improved attack on FEAL-4, which requires only 200 knwon plaintext blocks.

Keywords

Plaintext Attack Choose Plaintext Attack Intermediate Block Plaintext Block Feistel Scheme 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [1]
    A. Shimizu, S. Miyaguchi, “Fast Data Encipherment Algorithm FEAL”. Advances in Cryptology — Eurocrypt 87, Lecture Notes in Computer Science, Vol 304, Springer Verlag, 1988.Google Scholar
  2. [2]
    S. Miyaguchi, “News on Feal cipher”, talk at the Rump session, Crypto’90, 1990.Google Scholar
  3. [3]
    Bert Den Boer, “Cryptanalysis of FEAL”, Advances in Cryptology — Eurocrypt 88, Lecture Notes in Computer Science, Vol 330, Springer Verlag, 1989.Google Scholar
  4. [4]
    S. Murphy, “The Cryptanalysis of Feal-4 with 20 Chosen Plaintexts”, Journal of Cryptology Vol2 No3, 1990.Google Scholar
  5. [5]
    H. Gilbert, G. Chassé, “A Statistical Attack of the FEAL-8 Cryptosystem”, Proceedings of Crypto’90.Google Scholar
  6. [6]
    E. Biham, A. Shamir, “Differential Cryptanalysis of DES-like Cryptosystems”, Proceedings of Crypto’90.Google Scholar
  7. [7]
    E. Biham, A. Shamir, “Differential Cryptanalysis of Feal and N-Hash”, extended abstract, Proceedings of Eurocrypt’91.Google Scholar
  8. [8]
    W. Meier, O. Staffelbach, “Correlation Properties of Combiners with Memory in Stream Ciphers”, to appear in the Journal of Cryptology.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Anne Tardy-Corfdir
    • 1
  • Henri Gilbert
    • 1
  1. 1.Centre National d’Etudes des Télécommunications (CNET)PAA/TSA/SRCIssy les MoulineauxFrance

Personalised recommendations