Skip to main content

Rapid Hardware Design for Cryptographic Modules with Filtering Structures over Small Finite Fields

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11321))

Abstract

This paper presents a design automation toolkit for hardware implementations of linear and non-linear feedback shift registers (FSRs). The toolkit is implemented in the GAP computer algebra system and generates both executable GAP code and VHDL for synthesizable hardware. To design an FSR, the user needs only to provide a template and instantiate a few parameters. The primary objects are LFSRs; NLFSRs; and arbitrary combinational functions, which are modelled as FILFUNs, for “filtering functions”. Conventional feedback functions are modelled as univariate or multivariate polynomials. More complex functions can be modelled as FILFUNs. The paper demonstrates the capabilities of the toolkit using the WG-7 and WG-8 keystream generators and the Grain v1 stream cipher. Less than 30 lines of GAP code are required to generate a complete datapath in VHDL.

The authors would like to thank Dr. Alexander Konovalov from University of St. Andrews for his advice during the FSR package implementation.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Notes

  1. 1.

    Output taps in Table 2.

  2. 2.

    Which have a good performance for small fields.

  3. 3.

    To differentiate it from the FPGA LUTs.

  4. 4.

    Decimation exponent \(d>1\) and \(\gcd (d,2^m-1)=1\).

  5. 5.

    \({\mathbb F}_{2^8}\) with defining polynomial \(x^8+x^4+x^3+x^2+1\): trace is bit 5, i.e. “[5] run”.

  6. 6.

    Stream ciphers for hardware applications with highly restricted resources.

  7. 7.

    Meaning of \(-1\): this signal is defined in the other rule.

References

  1. Robshaw, M.: New Stream Cipher Designs - The eSTREAM Project. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-68351-3

    Book  MATH  Google Scholar 

  2. Wu, H.: ACORN: A Lightweight Authenticated Cipher (v1). http://competitions.cr.yp.to/round1/acornv1.pdf

  3. CAESAR: Competition for Authenticated Encryption. https://competitions.cr.yp.to/caesar.html

  4. ETSI/SAGE Specification version 1.1: Specification of the 3GPP Confidentiality and Integrity Algorithms UEA2 & UIA2. Document 2: SNOW 3G Specification

    Google Scholar 

  5. ETSI/SAGE Specification Version 1.6: Specification of the 3GPP Confidentiality and Integrity Algorithms 128-EEA3 & 128-EIA3. Document 2: ZUC Specification

    Google Scholar 

  6. The GAP Group: GAP - Groups, Algorithms, and Programming, Version 4.8.8 (2017). https://www.gap-system.org

  7. Lidl, R., Niederreiter, H.: Finite fields. In: Encyclopedia of Mathematics and its Applications, vol. 20, Cambridge University Press, Cambridge (1997)

    Google Scholar 

  8. Golomb, S.W., Gong, G.: Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar. Cambridge University Press, Cambridge (2005)

    Book  Google Scholar 

  9. Chen, L., Gong, G.: Communication System Security. CRC Press, Boca Raton (2012)

    Book  Google Scholar 

  10. SageMath. http://www.sagemath.org/

  11. SageMath Package Cryptography. http://doc.sagemath.org/html/en/reference/cryptography/index.html

  12. Symbolic Linear Feedback Shift Registers. http://library.wolfram.com/infocenter/MathSource/5717/

  13. MathWorks. https://www.mathworks.com/

  14. Coussy, P., Gajski, D.D., Meredith, M., Takach, A.: An introduction to high-level synthesis. IEEE Design Test Comput. 26(4), 8–17 (2009). https://doi.org/10.1109/MDT.2009.69

    Article  Google Scholar 

  15. Mandal, K., Gong, G.: Generating good span n sequences using orthogonal functions in nonlinear feedback shift registers. In: Koç, Ç.K. (ed.) Open Problems in Mathematics and Computational Science, pp. 127–162. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-10683-0_7

    Chapter  MATH  Google Scholar 

  16. Gong, G., Aagaard, M., Fan, X.: Resilience to distinguishing attacks on WG-7 cipher and their generalizations. Cryptogr. Commun. 5(4), 277–289 (2013)

    Article  MathSciNet  Google Scholar 

  17. Yang G., Fan X., Aagaard M., Gong G.: Design space exploration of the lightweight stream cipher WG-8 for FPGAs and ASICs. In: WESS 2013, Article No. 8. ACM, New York (2013). https://doi.org/10.1145/2527317.2527325

  18. Hell, M., Johansson, T., Meier, W.: Grain - a stream cipher for constrained environments. Int. J. Wirel. Mob. Comput. 2(1), 86–93 (2007). https://doi.org/10.1504/IJWMC.2007.013798

    Article  Google Scholar 

  19. Hell, M., Johansson, T., Maximov, A., Meier, W.: The grain family of stream ciphers. In: Robshaw, M., Billet, O. (eds.) New Stream Cipher Designs. LNCS, vol. 4986, pp. 179–190. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-68351-3_14

    Chapter  Google Scholar 

  20. Hwang, D., Chaney, M., Karanam, S., Ton, N., Gaj, K.: Comparison of FPGA-targeted hardware implementations of eSTREAM stream cipher candidates. SASC 2008, 151–162 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nusa Zidaric .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zidaric, N., Aagaard, M., Gong, G. (2018). Rapid Hardware Design for Cryptographic Modules with Filtering Structures over Small Finite Fields. In: Budaghyan, L., Rodríguez-Henríquez, F. (eds) Arithmetic of Finite Fields. WAIFI 2018. Lecture Notes in Computer Science(), vol 11321. Springer, Cham. https://doi.org/10.1007/978-3-030-05153-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-05153-2_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-05152-5

  • Online ISBN: 978-3-030-05153-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics