Analysis of the Reconfiguration Feature of Cryptographic Algorithms

  • Leibo LiuEmail author
  • Bo Wang
  • Shaojun Wei


This book focuses on the reconfigurable feature of cryptographic algorithms and analyzes the feasibility of implementing cryptographic algorithms with reconfigurable computing technologies, so as to provide a basis for the architecture design of the reconfigurable cryptographic processor. To study the reconfigurable cryptographic processor, a full understanding of cryptographic algorithms, the implementation object of the reconfigurable cryptographic processor, is a must. Based on the key factors of reconfigurable computing technologies, this book analyzes the features of cryptographic algorithms in terms of the execution process, algorithm structure, data width, computing granularity, core operations, parallelism, data dependency, common logic of algorithms computation, etc. This provides a basis for the architecture design of a reconfigurable cryptographic processor, including operator extraction, reconfigurable logic unit function, computing granularity, and scale of reconfigurable arrays. As each cryptographic algorithm has its unique features, this book will analyze the reconfigurable features of the block cipher, hash function, and public key cipher separately. There are numerous types of symmetric cipher, and the information system has the most urgent demand for the flexibility of symmetric ciphers. Therefore, the next section will focus on symmetric ciphers.


  1. 1.
    Shannon CE (1949) Communication theory of secrecy systems. Bell Labs Tech J 28(4):656–715MathSciNetCrossRefGoogle Scholar
  2. 2.
    Williams (2015) Cryptography and network security: principles and practice, 6th ed. Publishing House of Electronics Industry, Beijing, p 554Google Scholar
  3. 3.
    Stallings W (2013) Cryptography and network security: principles and practice international edition, 6th ed. Prentice Hall, Upper Saddle River, pp 121–136Google Scholar
  4. 4.
    Diffie W, Hellman M (1976) New directions in cryptography. IEEE Trans Inf Theory 22(6):644–654MathSciNetCrossRefGoogle Scholar
  5. 5.
    NIST-FIPS (2001) Announcing the advanced encryption standard. Natl Inst Stand Technol 29(8):2200–2203Google Scholar
  6. 6.
    Kitsos P, Sklavos N, Koufopavlou O (2002) Hardware implementation of the SAFER+encryption algorithm for the bluetooth system. In: IEEE international symposium on circuits and systems, pp 878–881Google Scholar
  7. 7.
    Kaicheng L (1998) Computer cryptography: data confidentiality and security in computer networks. Tsinghua University Press, BeijingGoogle Scholar
  8. 8.
    Schneier (2014) Applied cryptography: protocol, algorithm and C source program. Mechanical Industry Press, Beijing, pp 63–83Google Scholar
  9. 9.
    Jingfei J (2004) Research and design of reconfigurable cryptographic processing structure. Doctoral dissertation of National University of Defense Technology, ChangshaGoogle Scholar
  10. 10.
    Feng X (2011) ZUC algorithm: 3GP LTE international encryption standard. Inf Secur Commun Priv 12:031Google Scholar
  11. 11.
    Robshaw M (2008) The eSTREAM project. Lect Notes Comput Sci 2:1–6Google Scholar
  12. 12.
    Koç ÇK (2009) About cryptographic engineering. Springer, New York, pp 1–4Google Scholar
  13. 13.
    Bertoni G, Daemen J, Peeters M et al (2013) Keccak. In: Annual international conference on the theory and applications of cryptographic techniques, pp 313–314CrossRefGoogle Scholar
  14. 14.
    Xiaoyun W, Hongbo Yu (2016) SM3 cryptographic hash algorithms. Inf Secur Study 2(11):983–994Google Scholar
  15. 15.
    Merkle RC (1989) One way Hash functions and DES. In: International cryptology conference on advances in cryptology, pp 428–446Google Scholar
  16. 16.
    Damgård IB (1989) A design principle for Hash functions. In: International cryptology conference on advances in cryptology, pp 416–427Google Scholar
  17. 17.
    Lucks S (2005) A failure-friendly design principle for Hash functions[J]. Lect Notes Comput Sci 3788:474–494MathSciNetCrossRefGoogle Scholar
  18. 18.
    Xiaoyun W, Hongbo Yu (2015) Review of cryptographic hash Algorithms. Inf Secur Study 1(1):19–30Google Scholar
  19. 19.
    Dunkelman O, Biham E (2006) A framework for iterative hash functions: HAIFA. In: The 2nd NIST cryptographic hash workshop Google Scholar
  20. 20.
    Hoffstein J, Pipher J, Silverman JH (1998) NTRU: a ring-based public key cryptosystem. Springer, Heidelberg, pp 267–288zbMATHGoogle Scholar
  21. 21.
    Rivest RL, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21(2):120–126MathSciNetCrossRefGoogle Scholar
  22. 22.
    Menezes AJ (2012) Euiptic curve public key cryptosystems. Springer, BerlinGoogle Scholar
  23. 23.
    O’Rourke C, Sunar B (2003) Achieving NTRU with Montgomery multiplication. IEEE Trans Comput 52(4):440–448CrossRefGoogle Scholar
  24. 24.
    Satoh A, Takano K (2003) A scalable dual-field elliptic curve cryptographic processor. IEEE Trans Comput 52(4):449–460CrossRefGoogle Scholar
  25. 25.
    Montgomery PL (1985) Modular multiplication without trial division. Math Comput 44(170):519–521MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. and Science Press, Beijing 2018

Authors and Affiliations

  1. 1.Institute of MicroelectronicsTsinghua UniversityBeijingChina

Personalised recommendations