Skip to main content

Linear Cryptanalysis of Lightweight Block Cipher WARP

  • Conference paper
  • First Online:
Provable and Practical Security (ProvSec 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14217))

Included in the following conference series:

  • 297 Accesses

Abstract

WARP is 128-bit lightweight block cipher proposed by Banik et al. in SAC 2020, which is currently the smallest 128-bit block cipher in terms of hardware. In this paper, we evaluate the security of WARP against linear cryptanalysis with SAT method. Using the SAT-based automatic search algorithms, the lower bound on the number of minimal linearly active S-boxes and the maximal linear correlation for WARP up to 30 rounds are presented, and a 23-round linear cryptanalysis of WARP is presented with a 19-round linear hull with correlation \(2^{-58.16}\) by extending two rounds forward and backward the distinguisher.

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

Access this chapter

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

Institutional subscriptions

References

  1. Matsui, M.: Linear cryptanalysis method for DES cipher. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 386–397. Springer, Heidelberg (1994). https://doi.org/10.1007/3-540-48285-7_33

  2. Mouha, N., Wang, Q., Gu, D., Bart, P.: Differential and linear cryptanalysis using mixed-integer linear programming. In: Wu, C.-K., Yung, M., Lin, D. (eds.) Inscrypt 2011. LNCS, vol. 7537, pp. 57–76. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-34704-7_5

  3. Sun, S., Hu, L., Wang, P., Qiao, K., Ma, X., Song, L.: Automatic security evaluation and (related-key) differential characteristic search: application to SIMON, PRESENT, LBlock, DES(L) and other bit-oriented block ciphers. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8873, pp. 158–178. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-45611-8_9

  4. Mouha, N., Preneel, B.: Towards finding optimal differential characteristics for ARX: application to Salsa20. Cryptology ePrint Archive, https://eprint.iacr.org/2013/328

  5. Sun, L., Wang, W., Wang, M.: More accurate differential properties of LED64 and Midori64. IACR Trans. Symmet. Cryptol. 2018(3), 93–123 (2018)

    Article  Google Scholar 

  6. Sun, L., Wang, W., Wang, M.: Accelerating the search of differential and linear characteristics with the SAT method. IACR Trans. Symmet. Cryptol. 2021(1), 269–315 (2021)

    Article  Google Scholar 

  7. Sun, L., Wang, W., Wang, M.: Improved attacks on GIFT-64. In: AlTawy, R., Hülsing, A. (eds.) Selected Areas in Cryptography. SAC 2021. LNCS, vol. 13203, pp. 246–265. Springer, Cham (2022) https://doi.org/10.1007/978-3-030-99277-4_12

  8. Gerault, D., Minier, M., Solnon, C.: Constraint programming models for chosen key differential cryptanalysis. In: Rueher, M. (ed.) CP 2016. LNCS, vol. 9892, pp. 584–601. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-44953-1_37

  9. Banik, S., et al.: WARP: revisiting GFN for lightweight 128-bit block cipher. In: Dunkelman, O., Jacobson, M.J., Jr., O’Flynn, C. (eds.) SAC 2020. LNCS, vol. 12804, pp. 535–564. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-81652-0_21

  10. Teh, J.S., Biryukov, A.: Differential cryptanalysis of WARP. J. Inf. Secur. Appl. 70, 103316 (2022). https://doi.org/10.1016/j.jisa.2022.103316

    Article  Google Scholar 

  11. Lallemand, V., Minier, M., Rouquette, L.: Automatic search of rectangle attacks on feistel ciphers: application to WARP. IACR Trans. Symmet. Cryptol. 2022(2), 113–140 (2022)

    Article  Google Scholar 

  12. Sun, L., Wang, W., Wang, M.: Key-Recovery Attacks on CRAFT and WARP. Cryptology ePrint Archive. https://eprint.iacr.org/2022/997 to appear in SAC 2022

  13. Rickmann, S.: Logic friday (version 1.1. 3) [computer software] (2011)

    Google Scholar 

  14. Sinz, C.: Towards an optimal CNF encoding of boolean cardinality constraints. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 827–831. Springer, Heidelberg (2005). https://doi.org/10.1007/11564751_73

  15. Blondeau, C., Nyberg, K.: Joint data and key distribution of simple, multiple, and multidimensional linear cryptanalysis test statistic and its impact to data complexity. Des. Codes Crypt. 82(1), 319–349 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  16. Selçuk, A.A.: On probability of success in linear and differential cryptanalysis. J. Cryptol. 21(1), 131–147 (2008)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hong Xu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Xu, H., Hao, C., Xu, Z., Qi, W. (2023). Linear Cryptanalysis of Lightweight Block Cipher WARP. In: Zhang, M., Au, M.H., Zhang, Y. (eds) Provable and Practical Security. ProvSec 2023. Lecture Notes in Computer Science, vol 14217. Springer, Cham. https://doi.org/10.1007/978-3-031-45513-1_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-45513-1_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-45512-4

  • Online ISBN: 978-3-031-45513-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics