Skip to main content
SpringerLink
Log in
Book cover

International Conference on the Theory and Application of Cryptology

ASIACRYPT 1991: Advances in Cryptology — ASIACRYPT '91 pp 247–252Cite as

Results of switching-closure-test on FEAL

Extended abstract

  • Conference paper
  • First Online:

  • 200 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 739))

Abstract

The closure tests, CCT and MCT, were introduced to analyze the algebraic properties of cryptosystems by Kaliski et al. [KaRiSh]. If a cryptosystem is closed, the tests give the same results “Fail” and the cryptosystem might be breakable. Though CCT requires much less memory and time than MCT, we cannot apply CCT to check cryptosystems having the same data and key block lengths such as FEAL with non-parity mode. Because CCT utilizes the differences in data and key block lengths.

Though CCT experiments performed by Kaliski et al. detected that DES is not closed, how should FEAL be checked? Does FEAL pass in MCT? Since MCT needs a lot of memory and time, to check FEAL, we developed a switching closure test SCT [MoOhMi], which is practical version of MCT. In this paper, by using SCT, it is confirmed that FEAL is not closed with high probability.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. S. Kaliski Jr., R. L. Rivest, and A. T. Sherman: “Is the Data Encryption Standard a Group? (Results of Cycling Experiments on DES),” J. Cryptology, 1, 1, pp.3–36, 1988.

    Article  Google Scholar 

  2. H. Morita, K. Ohta, and S. Miyaguchi: “A Switching Closure Test to Analyze Cryptosystems,” Abstracts of CRYPTO'91, pp.4.14–4.18, Aug. 1991.

    Google Scholar 

  3. K. Nishimura: “Probability to Meet in the Middle,” J. Cryptology, 2, 1, pp. 13–22, 1990.

    Google Scholar 

  4. J.-J. Quisquater and J.-P. Delescaille: “How Easy is Collision Search. New Results and Applications to DES,” Advances in Cryptology-CRYPTO'89, Proceedings, pp.408–413, Springer-Verlag, 1990.

    Google Scholar 

  5. A. Shimizu and S. Miyaguchi: “Fast Data Encipherment Algorithm FEAL,” Advances in Cryptology-EUROCRYPT'87, Proceedings, pp.267–278, Springer-Verlag, 1988. See also S. Miyaguchi, et al.: “Expansion of FEAL Cipher,” NTT Review, 2, 6, pp.117–127, Nov. 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. NTT Laboratories, NTT R&D Center (Room 309A), 1-2356 Take Yokosuka, 238-03, Kanagawa, Japan

    Hikaru Morita, Kazuo Ohta & Shoji Miyaguchi

Authors
  1. Hikaru Morita
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kazuo Ohta
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shoji Miyaguchi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hideki Imai Ronald L. Rivest Tsutomu Matsumoto

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Morita, H., Ohta, K., Miyaguchi, S. (1993). Results of switching-closure-test on FEAL. In: Imai, H., Rivest, R.L., Matsumoto, T. (eds) Advances in Cryptology — ASIACRYPT '91. ASIACRYPT 1991. Lecture Notes in Computer Science, vol 739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57332-1_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-57332-1_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57332-6

  • Online ISBN: 978-3-540-48066-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation