Journal of Computer Technology & Applications

Stream Cipher Based Modified Espresso Algorithm for 5G Communication

  1. Chinmay Bepery ✉ ORCID iD
  2. Simab Al Ahmmed
  3. Md. Moazzem Hossain Riad
  4. Md. Arifur Rahman
  5. Md. Samsuzzaman
  6. Sayed Md. Galib

Abstract

AbstractTo meet the requirement of 5G communication, Dubrova and Hell design Espresso, which is a stream cipher. Espresso uses 128-bit key, 96-bit initial vector (IV) and a 6-degree Boolean function as its output function. Jia-Min and Wen-Feng showed that algebraic attack is possible with time complexity being O(2(66.86)). In this paper, we present a methodology for the modification of Espresso with reformed Galois configuration of 256-bit Nonlinear Feedback Shift Registers (NLFSR) and 8-degree Boolean function as its output function. The advantages of Galois and Fibonacci configuration of NLFSRs, short propagation delay, and 8-degree Boolean function are combined in our algorithm which make it invulnerable to the classical algebraic attack and correlation attack.Keywords: Stream cipher, 5G, NLFSR, algebraic attack, EspressoCite this ArticleChinmay Bepery, Simab Al Ahmmed, Md. Moazzem Hossain Riad, Md. Arifur Rahman, Md. Samsuzzaman, Sayed Md. Galib. Stream Cipher Based Modified Espresso Algorithm for 5G Communication. Journal of Computer Technology & Applications. 2019; 10(1): 32–40p.

Keywords

References (25)

  1. Golomb SW. Shift Register Sequences Holden-Day. San Francisco. Springer, 1967.
  2. Jansen CJA. Investigations on nonlinear streamcipher systems: construction and evaluation methods : Technische Universiteit Delft; 1989.
  3. Canteaut A. Open problems related to algebraic attacks on stream c iphers. International Workshop on Coding and cryptography: Springer; 2006. 120–34p.
  4. Dubrova E. Generation of full cycles by a composition of NLFSRs. Des Code Cryptograph. 2014; 73(2): 469–86p.
  5. Dubrova E, Teslenko M, Tenhunen H, editors. On analysis and synthesis of (n, k)-non-linear feedback shift registers . Design, Automation and Test in Europe, 2008 DATE'08; 2008: IEEE.
  6. Dubrova E. A list of maximum -period NLFSRs. 2012.
  7. Schneier B. Applied Cryptography . Edition s, editor. New York: Wiley; 1996.
  8. Paar C, Pelzl J. Understanding cryptography. Berlin: Springer; 2009.
  9. Hell M, Johansson T, Maximov A, Meier W. The Grain family of stream ciphers . New Stream Cipher Designs: Springer; 2008. 179–90p.
  10. De Canniere C, Preneel B. Trivium. New Stream Cipher Designs . Lecture Notes in Computer Science, vol 4986. Springer, Berlin, H eidelberg, 2008: 244–66p.
  11. Bogdanov A, Knudsen LR, Leander G, Paar C, Poschmann A, Robshaw MJ, et al., editors. PRESENT: An ultra -lightweight block cipher. International Workshop on Cryptographic Hardware and Embedded Systems; 2007: Springer.
  12. De Canniere C, Dunkelman O, Knežević M, editors. KATAN and KTANTAN —a family of small and efficient hardware - oriented block ciphers. International Workshop on Cryptographic Hardware and Embedded Systems; 2009: Springer.
  13. Guo J, Peyrin T, Poschmann A, Robshaw M. The LED Block Cipher. International Workshop on Cryptographic Hardware and Embedded Systems – CHES, 2011; 326– 41p.
  14. Gong Z, Nikova S, Law YW, editors. KLEIN: a new family of lightweight block ciphers. International Workshop on Radio Frequency Identification: Security and Privacy Issues; 2011: Springer.
  15. Borghoff J, Canteaut A, Güneysu T, Kavun EB, Knezevic M, Knudsen LR, et al. editors. PRINCE –a low -latency block cipher for pervasive computing applications. International Conference on the Theory and Application of Cryptology and Information Security; 2012: Springer.
  16. Dubrova E, Hell M. Espresso: A stream cipher for 5G wireless communication systems. Cryptogr Commun . 2015 , 9(2): 1–17p.
  17. Zhang Jiamin, Yan Wenfeng . Cryptographic Analysis of Espresso Algorithm Equivalent Model. Journal of Cryptography. 2016; 3(1): 91–100p. Journal of Computer Technology & Applications Volume 10, Issue 1 ISSN: 2229-6964(online), ISSN: 2347-7229(print) JoCTA (2019) 32-40 © STM Journals 2019. All Rights Reserved Page 40
  18. Lidl R, Niederreiter H. Introduction to finite fields and their applications : Cambridge university press; 1994.
  19. Dubrova E. A transformation from the Fibonacci to the Galois NLFSRs. IEEE T Info Theory. 2009; 55(11): 5263–71p.
  20. Dubrova E. A Scalable Method for Constructing Galois NLFSRs With Period $2^ n -1$ Using Cross -Join Pairs. IEEE T Info Theory. 2013; 59(1): 703–9p.
  21. Golić JD, editor on the securi ty of nonlinear filter generators. International Workshop on Fast Software Encryption ; 1996: Springer.
  22. Armknecht F, Krause M, editors. Algebraic attacks on combiners with memory. Annual International Cryptology Conference ; 2003: Springer.
  23. Courtois N, Klimov A, Patarin J, Shamir A, editors. Efficient algorithms for solving overdefined systems of multivariate polynomial equations. International Conference on the Theory and Applications of Cryptographic Techniques ; 2000: Springer.
  24. Faugere JC, Joux A, editors. Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using Gröbner bases. Annual International Cryptology Conference; 2003: Springer.
  25. Meier W, Pasalic E, Carlet C, editors. Algebraic attacks and decomposition of Boolean functions. International Conference on the Theory and Applications of Cryptographic Techniques ; 2004: Springer. Cite this Article Chinmay Bepery, Simab Al Ahmmed, Md. Moazzem Hossain Riad, Md. Arifur Rahman, Md. Samsuzzaman, Sayed Md. Galib. Stream Cipher Based Modified Espresso Algorithm for 5G Communication. Journal of Computer Technology & Applications . 2019; 10(1): 32–40p.

Read more of it

Subscribe to one journal or build your own list of several. One invoice, one payment, access for a full year.

Subscribe to journals →

Publish your article

Peer-reviewed journals across every subject, with open access options. Send your manuscript to the right editor today.

Publish with us → Calculate your APC
Support