skip to main content
research-article

Fast Search of Lightweight Block Cipher Primitives via Swarm-like Metaheuristics for Cyber Security

Authors Info & Claims
Published:16 July 2021Publication History
Skip Abstract Section

Abstract

With the construction and improvement of 5G infrastructure, more devices choose to access the Internet to achieve some functions. People are paying more attention to information security in the use of network devices. This makes lightweight block ciphers become a hotspot. A lightweight block cipher with superior performance can ensure the security of information while reducing the consumption of device resources. Traditional optimization tools, such as brute force or random search, are often used to solve the design of Symmetric-Key primitives. The metaheuristic algorithm was first used to solve the design of Symmetric-Key primitives of SKINNY. The genetic algorithm and the simulated annealing algorithm are used to increase the number of active S-boxes in SKINNY, thus improving the security of SKINNY. Based on this, to improve search efficiency and optimize search results, we design a novel metaheuristic algorithm, named particle swarm-like normal optimization algorithm (PSNO) to design the Symmetric-Key primitives of SKINNY. With our algorithm, one or better algorithm components can be obtained more quickly. The results in the experiments show that our search results are better than those of the genetic algorithm and the simulated annealing algorithm. The search efficiency is significantly improved. The algorithm we proposed can be generalized to the design of Symmetric-Key primitives of other lightweight block ciphers with clear evaluation indicators, where the corresponding indicators can be used as the objective functions.

References

  1. Alex M. Andrew. 1993. Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence, by John H. Holland, MIT Press (Bradford Books), Cambridge, MA, 1992, xiv+211. Robotica 11, 5 (1993), 489. DOI:https://doi.org/10.1017/S0263574700017136Google ScholarGoogle Scholar
  2. Ray Beaulieu, Douglas Shors, Jason Smith, Stefan Treatman-Clark, Bryan Weeks, and Louis Wingers. 2013. The SIMON and SPECK families of lightweight block ciphers. IACR Cryptol. ePrint Arch. 2013 (2013), 404. Retrieved from http://eprint.iacr.org/2013/404.Google ScholarGoogle Scholar
  3. Christof Beierle, Jérémy Jean, Stefan Kölbl, Gregor Leander, Amir Moradi, Thomas Peyrin, Yu Sasaki, Pascal Sasdrich, and Siang Meng Sim. 2016. The SKINNY family of block ciphers and its low-latency variant MANTIS. In Proceedings of the Advances in Cryptology 36th Annual International Cryptology Conference (CRYPTO’16). 123–153. DOI:https://doi.org/10.1007/978-3-662-53008-5_5 Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Daniel Bratton and Tim Blackwell. 2007. Understanding particle swarms through simplification: A study of recombinant PSO. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO’07). 2621–2628. DOI:https://doi.org/10.1145/1274000.1274078 Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. John A. Clark, Jeremy L. Jacob, and Susan Stepney. 2004. The design of s-boxes by simulated annealing. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC’04). 1533–1537. DOI:https://doi.org/10.1109/CEC.2004.1331078Google ScholarGoogle ScholarCross RefCross Ref
  6. Alberto Colorni, Marco Dorigo, and Vittorio Maniezzo. 1992. An investigation of some properties of an “ant algorithm.” In Proceedings of the Conference on Parallel Problem Solving from Nature 2 (PPSN-II’92). 515–526.Google ScholarGoogle Scholar
  7. James Kennedy and Russell Eberhart. 1995. Particle swarm optimization. In Proceedings of the International Conference on Neural Networks (ICNN’95). 1942–1948. DOI:https://doi.org/10.1109/ICNN.1995.488968Google ScholarGoogle ScholarCross RefCross Ref
  8. Scott Kirkpatrick, D. Gelatt Jr., and Mario P. Vecchi. 1983. Optimization by simmulated annealing. Science 220, 4598 (1983), 671–680.Google ScholarGoogle Scholar
  9. Guozhen Liu, Mohona Ghosh, and Ling Song. 2017. Security analysis of SKINNY under related-tweakey settings (long paper). IACR Trans. Sym. Cryptol. 2017, 3 (2017), 37–72. DOI:https://doi.org/10.13154/tosc.v2017.i3.37-72Google ScholarGoogle ScholarCross RefCross Ref
  10. Nicholas C. Metropolis and Robert L. Ashenhurst. 1958. Significant digit computer arithmetic. IRE Trans. Electronic Comput. 7, 4 (1958), 265–267. DOI:https://doi.org/10.1109/TEC.1958.5222657Google ScholarGoogle ScholarCross RefCross Ref
  11. Nicky Mouha, Qingju Wang, Dawu Gu, and Bart Preneel. 2011. Differential and linear cryptanalysis using mixed-integer linear programming. In Proceedings of the Information Security and Cryptology 7th International Conference (INSCRYPT’11). 57–76. DOI:https://doi.org/10.1007/978-3-642-34704-7_5 Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Ivica Nikolić. 2017. How to use metaheuristics for design of symmetric-key primitives. In Proceedings of the Advances in Cryptology 23rd International Conference on the Theory and Applications of Cryptology and Information Security (ASIACRYPT’17). 369–391. DOI:https://doi.org/10.1007/978-3-319-70700-6_13Google ScholarGoogle ScholarCross RefCross Ref
  13. Peter Rechenberg. 1970. Ein rekursives Programm für das Kalah-Spiel. Elektronische Rechenanlagen 12, 1 (1970), 11–19. DOI:https://doi.org/10.1524/itit.1970.12.16.11Google ScholarGoogle Scholar
  14. Siwei Sun, Lei Hu, Ling Song, Yonghong Xie, and Peng Wang. 2013. Automatic security evaluation of block ciphers with S-bP structures against related-key differential attacks. In Proceedings of the Information Security and Cryptology 9th International Conference (INSCRYPT’13). 39–51. DOI:https://doi.org/10.1007/978-3-319-12087-4_3Google ScholarGoogle Scholar
  15. Siwei Sun, Lei Hu, Peng Wang, Kexin Qiao, Xiaoshuang Ma, and Ling Song. 2014. Automatic security evaluation and (related-key) differential characteristic search: Application to SIMON, PRESENT, LBlock, DES(L) and other bit-oriented block ciphers. In Proceedings of the Advances in Cryptology 20th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT’14). 158–178. DOI:https://doi.org/10.1007/978-3-662-45611-8_9Google ScholarGoogle ScholarCross RefCross Ref
  16. Ying Tan, Chao Yu, Shaoqiu Zheng, and Ke Ding. 2013. Introduction to fireworks algorithm. IJSIR 4, 4 (2013), 39–70. DOI:https://doi.org/10.4018/ijsir.2013100103 Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Dai Watanabe, Toru Owada, Kazuto Okamoto, Yasutaka Igarashi, and Toshinobu Kaneko. 2010. Update on Enocoro stream cipher. In Proceedings of the International Symposium on Information Theory and its Applications (ISITA’10). 778–783. DOI:https://doi.org/10.1109/ISITA.2010.5649627Google ScholarGoogle ScholarCross RefCross Ref
  18. Shengbao Wu and Mingsheng Wang. 2011. Security evaluation against differential cryptanalysis for block cipher structures. IACR Cryptol. ePrint Arch. 2011 (2011), 551. Retrieved from http://eprint.iacr.org/2011/551.Google ScholarGoogle Scholar
  19. Dong Yang, Wen-Feng Qi, and Hua-Jin Chen. 2017. Impossible differential attacks on the SKINNY family of block ciphers. IET Info. Sec. 11, 6 (2017), 377–385. DOI:https://doi.org/10.1049/iet-ifs.2016.0488Google ScholarGoogle Scholar
  20. Yin Zhang, M. Shamim Hossain, Ahmed Ghoneim, and Mohsen Guizani. 2019. COCME: Content-oriented caching on the mobile edge for wireless communications. IEEE Wirel. Commun. 26, 3 (2019), 26–31. DOI:https://doi.org/10.1109/MWC.2019.1800401 Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Yin Zhang, Yujie Li, Ranran Wang, Jianmin Lu, Xiao Ma, and Meikang Qiu. 2020. PSAC: Proactive sequence-aware content caching via deep learning at the network edge. IEEE Trans. Netw. Sci. Eng. 7, 4 (Apr. 2020), 2145–2154. DOI:https://doi.org/10.1109/TNSE.2020.2990963Google ScholarGoogle ScholarCross RefCross Ref
  22. Yin Zhang, Yongfeng Qian, Di Wu, M. Shamim Hossain, Ahmed Ghoneim, and Min Chen. 2019. Emotion-aware multimedia systems security. IEEE Trans. Multimedia 21, 3 (2019), 617–624. DOI:https://doi.org/10.1109/TMM.2018.2882744Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Fast Search of Lightweight Block Cipher Primitives via Swarm-like Metaheuristics for Cyber Security

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Article Metrics

      • Downloads (Last 12 months)24
      • Downloads (Last 6 weeks)0

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    HTML Format

    View this article in HTML Format .

    View HTML Format
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!