Cryptanalysis of Full-Round BipBip

Authors

  • Jinliang Wang School of Cyber Science and Technology, Shandong University, Qingdao, Shandong, China; Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, Shandong University, Jinan, China
  • Christina Boura Université Paris-Saclay, Université de Versailles, Centre National de la Recherche Scientifique (CNRS), Laboratoire de mathématiques de Versailles, 78000, Versailles, France
  • Patrick Derbez Univ Rennes, Inria, Centre National de la Recherche Scientifique (CNRS), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Rennes, France
  • Kai Hu School of Cyber Science and Technology, Shandong University, Qingdao, Shandong, China; Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, Shandong University, Jinan, China
  • Muzhou Li School of Cyber Science and Technology, Shandong University, Qingdao, Shandong, China
  • Meiqin Wang School of Cyber Science and Technology, Shandong University, Qingdao, Shandong, China; Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, Shandong University, Jinan, China; Quan Cheng Shandong Laboratory, Jinan, China

DOI:

https://doi.org/10.46586/tosc.v2024.i2.68-84

Keywords:

BipBip, Demirci-Selçuk meet-in-the-middle cryptanalysis, low latency

Abstract

BipBip is a low-latency tweakable block cipher proposed by Belkheyar et al. in 2023. It was designed for pointer encryption inside a new memory safety mechanism called Cryptographic Capability Computing (C3). BipBip encrypts blocks of 24 bits using a 40-bit tweak and a 256-bit master key and is composed of 11 rounds. n this article, we provide a Demirci-Selçuk Meet-in-the-Middle (DS-MITM) attack against the 11-round (full) variant that breaks the security claim of the designers.

Downloads

Published

2024-06-18

Issue

Vol. 2024 No. 2

Section

Articles

License

Copyright (c) 2024 Jinliang Wang, Christina Boura, Patrick Derbez, Kai Hu, Muzhou Li, Meiqin Wang

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

Cryptanalysis of Full-Round BipBip. (2024). IACR Transactions on Symmetric Cryptology, 2024(2), 68-84. https://doi.org/10.46586/tosc.v2024.i2.68-84