SpringerLink
Log in

Research and design of reconfigurable composite field multiplication in symmetric cipher algorithms

  • Computer Science
  • Published:
Wuhan University Journal of Natural Sciences

Abstract

The composite field multiplication is an important and complex module in symmetric cipher algorithms, and its realization performance directly restricts the processing speed of symmetric cipher algorithms. Based on the characteristics of composite field multiplication in symmetric cipher algorithms and the realization principle of its reconfigurable architectures, this paper describes the reconfigurable composite field multiplication over GF((28)k) (k=1,2,3,4) in RISC (reduced instruction set computer) processor and VLIW (very long instruction word) processor architecture, respectively. Through configuration, the architectures can realize the composite field multiplication over GF (28), GF ((28)2), GF ((28)3) and GF ((28)4) flexibly and efficiently. We simulated the function of circuits and synthesized the reconfigurable design based on the 0.18µm CMOS (complementary metal oxide semiconductor) standard cell library and the comparison with other same kind designs. The result shows that the reconfigurable design proposed in the paper can provide higher efficiency under the premise of flexibility.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Germany)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Gulcan E, Aysu A, Schaumont P, et al. A flexible and compact hardware architecture for the SIMON block cipher [J]. Lightweight Cryptography for Security and Privacy, 2015, 898(9): 34–50.

    Google Scholar 

  2. Sokouti M, Sokouti B, Pashazadeh S, et al. Genetic-based random key generator (GRKG): A new method for generating more-random keys for one-time pad cryptosystem [J]. Neural Computing and Applications, 2013, 22(7): 1667–1675.

    Article  Google Scholar 

  3. Molina-Gil J, Caballero-Gil P, Caballero-Gil C, et al. Analysis and implementation of the SNOW 3G generator used in 4G/LTE systems [C] // International Joint Conference SOCO’13-CISIS’13-ICEUTE’13. Switzerland: Advances in Intelligent and Computing, 2014: 499–508.

    Chapter  Google Scholar 

  4. Tena-Sanchez E, Acosta A J. DPA vulnerability analysis on Trivium stream cipher using an optimized power model [C]// Circuits and Systems (ISCAS), 2015 IEEE International Symposium on. Washington D C: IEEE Press, 2015: 1846–1849.

    Chapter  Google Scholar 

  5. Yan S Y, Li C H, Gao M, et al. A network controller supported open reconfigurable technology [J]. Testbeds and Research Infrastructure: Development of Networks and Communities, 2014, 137(4): 395–405.

    Google Scholar 

  6. Reyhani-Masoleh A, Hasan M A. Low complexity bit parallel architectures for polynomial basis multiplication over GF(2m) [J]. IEEE Transactions on Computers, 2014, 53(8): 945–959.

    Article  Google Scholar 

  7. Chiou C W, Lin J M, Lee C Y, et al. Low complexity systolic Mastrovito multiplier over GF(2m) [J]. European Journal of Scientific Research, 2011, 65(4): 534–545.

    Google Scholar 

  8. Kitsos P, Theodoridis G, Koufopavlou O. An efficient reconfigurable multiplier architecture for Galois field [J]. Microelectronics Journal, 2003, 34(10): 975–980.

    Article  CAS  Google Scholar 

  9. Yuan D S, Rong M T. Reconfigurable and fast finite field multiplier architecture [J]. Journal of Electronics and Information Technology, 2014, 28(4): 717–720.

    Google Scholar 

  10. Zhang X Y. Research on Technology of Reconfigurable Galois Field Arithmetic Unit Targeted at Symmetric Cipher [D]. Zhengzhou: PLA Information Engineering University, 2010: 47–48(Ch).

  11. Beuchat J L, González-Díaz J E, Mitsunari S, et al. High-speed software implementation of the optimal ate pairing over Barreto-Naehrig curves [C] // Pairing-Based Cryptography—Pairing 2014. Berlin, Heidelberg: Springer-Verlag, 2014: 21–39.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Key Laboratory of Information Security, Engineering University of Chinese People’s Armed Police Force, **’an 710086, Shaanxi, China

    Yang Su, Mingshu Zhang & Kai Yang

Authors
  1. Yang Su
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mingshu Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kai Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yang Su.

Additional information

Foundation item: Supported by the National Natural Science Foundation of China (61202492, 61309022, 61309008) and the Natural Science Foundation for Young of Shaanxi Province (2013JQ8013)

Biography: SU Yang, male, Lecturer, research direction: information security, digital IC designs.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Su, Y., Zhang, M. & Yang, K. Research and design of reconfigurable composite field multiplication in symmetric cipher algorithms. Wuhan Univ. J. Nat. Sci. 21, 235–241 (2016). https://doi.org/10.1007/s11859-016-1165-6

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11859-016-1165-6

Key words

CLC number

Search

Navigation