Skip to main content

Fast Architecture of Modular Inversion Using Itoh-Tsujii Algorithm

  • Conference paper
  • First Online:
VLSI Design and Test (VDAT 2017)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 711))

Included in the following conference series:

Abstract

Modular inversion is a very common primitive used for the cryptographic computations. It is the most computation intensive unit which demands more resources as compared to other primitives. Inside the modular inversion arithmetic circuits, considerable speed up with optimized architecture is required. This paper proposes an optimized parallel architecture for Itoh-Tsujii modular inversion algorithm for the field GF(2256) by introducing 23 blocks. The comparative results with conventional architecture show the 30% reduction in LUT requirement with 37% in combinational delay.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Trujillo-Olaya, V., Velasco-Medina, J.: Hardware architectures for inversion in GF (2m) using polynomial and gaussian normal basis. In: ANDESCON IEEE 2010 Conference Publications, pp. 1–5 (2010)

    Google Scholar 

  2. Itoh, T., Tsujii, S.: A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases. Inf. Comput. 78(3), 171–177 (1988)

    Article  MATH  Google Scholar 

  3. Dimitrov, V., Järvinen, K.: Another look at inversions over binary fields. In: 2013 IEEE 21st Symposium on Computer Arithmetic, pp. 211–218 (2013)

    Google Scholar 

  4. Roy, S.S., Rebeiro, C., Mukhopadhyay, D.: Theoretical modelling of the Itoh-Tsujii inversion algorithm for enhanced performance on k-LUT based FPGAs. In: Proceedings of the Design, Automation & Test in Europe Conference & Exhibition (DATE), Grenoble, France, vol. 1, pp. 1–6, March 2011

    Google Scholar 

  5. Rebeiro, C., Roy, S.S., Reddy, D.S., Mukhopadhyay, D.: Revisiting the Itoh-Tsujii inversion algorithm for FPGA platforms. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 19(8), 1508–1512 (2011)

    Article  Google Scholar 

  6. Parrilla, L., Lloris, A., Castillo, E., et al.: Minimum-clock-cycle Itoh-Tsujii algorithm hardware implementation for cryptography applications over GF(2m) fields. Electron. Lett. 48(18), 1126–1128 (2012)

    Article  Google Scholar 

  7. Guajardo, J., Paar, C.: Itoh-Tsujii inversion in standard basis and its application in cryptography and codes. Des. Codes Cryptogr. 25(2), 207–216 (2002)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pravin Zode .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zode, P., Deshmukh, R.B., Samad, A. (2017). Fast Architecture of Modular Inversion Using Itoh-Tsujii Algorithm. In: Kaushik, B., Dasgupta, S., Singh, V. (eds) VLSI Design and Test. VDAT 2017. Communications in Computer and Information Science, vol 711. Springer, Singapore. https://doi.org/10.1007/978-981-10-7470-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-7470-7_5

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-7469-1

  • Online ISBN: 978-981-10-7470-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics