Skip to main content
SpringerLink
Log in

Improved fast software implementation of block ciphers (Extended abstract)

  • Session 8: Block Ciphers
  • Conference paper
  • First Online:
Information and Communications Security (ICICS 1997)

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

Included in the following conference series:

Abstract

This paper improves the fast DES implementation in software proposed by Biham at the 4-th Fast Software Encryption Workshop. That is, we propose a new algorithm which reduces the number of instructions for computation of S-boxes, which is the factor dominating the performance of Biham's implementation. When we apply our algorithm to DES S-boxes, we need only 87.75 instructions in average. We can reduce the number of instructions for 1 round of DES to 942, and in total, in terms of the number of instructions, our implementation is expected to be about 8% faster than Biham's implementation.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Becker and V. Weispfenning, “Gröbner Bases,” Graduate Texts in Mathematics 141, Springer Verlag, (1993)

    Google Scholar 

  2. E. Biharn, “A Fast New DES Implementation in Software,” Preproceedings of the Fourth Fast Software Encryption Workshop, January, (1997) (available at http: //www. cs.technion.ac.il/∼biham/publications.html)

    Google Scholar 

  3. M. Kwan, “bitslice-des,” private communication, (1997) (available at http: //www. cs.mu.oz.au/∼mkwan/bitslice)

    Google Scholar 

  4. M. Noro and T. Takeshima, “Risa/Asir-a computer algebra system,” Proceedings of ISSAC'92, ACM Press, (1992) pp.387–396, (available at (164.71.2.5) endeavor. flab. fujitsu.co. jp: /pub/isis/asir by anonymous ftp)

    Google Scholar 

  5. T. Shimoyama, S. Amada and S. Moriai, “Improved Fast Software Implementation of Block Ciphers,” (1997) (available at http://wwv.yokohama.tao.or.jp/shimo)

    Google Scholar 

  6. T. Shimoyama and T. Kaneko, “Polynomial expression of S-box and its application to the Linear Attack,” (in Japanese), TECHNICAL REPORT OF IEICE., ISEC 96-40 (1996) pp.71–82

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. TAO (Telecommunications Advancement Organization of Japan), 1-1-32 Shin'urashima-cho, Kanagawa-ku, 221, Yokohama, Japan

    Takeshi Shimoyama, Seiichi Amada & Shiho Moriai

Authors
  1. Takeshi Shimoyama
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Seiichi Amada
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shiho Moriai
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Yongfei Han Tatsuaki Okamoto Sihan Qing

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag

About this paper

Cite this paper

Shimoyama, T., Amada, S., Moriai, S. (1997). Improved fast software implementation of block ciphers (Extended abstract). In: Han, Y., Okamoto, T., Qing, S. (eds) Information and Communications Security. ICICS 1997. Lecture Notes in Computer Science, vol 1334. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028482

Download citation

  • DOI: https://doi.org/10.1007/BFb0028482

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63696-0

  • Online ISBN: 978-3-540-69628-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation