Two Kinds of Biclique Attacks on Lightweight Block Cipher PRINCE

Zheng Yuan; Zhen Peng; Haiwen Ou

Paper 2015/1208

Two Kinds of Biclique Attacks on Lightweight Block Cipher PRINCE

Zheng Yuan, Zhen Peng, and Haiwen Ou

Abstract

Inspired by the paper [10], using better differential characteristics in the biclique construction, we give another balanced biclique attack on full rounds PRINCE with the lower complexity in this paper. Our balanced biclique attack has 2^62.67 computational complexity and 2^32 data complexity. Furthermore, we first illustrate a star-based biclique attack on full rounds PRINCE cipher in this paper. Our star-based biclique attack has computational complexity 2^63.02 and the required data can be reduced to only a single plaintext-ciphertext pair, this is the optimal data complexity among the existing results of full round attack on PRINCE.

Metadata

Available format(s): PDF
Publication info: Preprint. MINOR revision.
Keywords: balanced biclique attack star-based biclique PRINCE PRINCEcore data complexity
Contact author(s): zyuan @ tsinghua edu cn
pengzhen0822 @ 126 com
History: 2015-12-22: revised; 2015-12-19: received; See all versions
Short URL: https://ia.cr/2015/1208
License: CC BY

BibTeX

@misc{cryptoeprint:2015/1208,
      author = {Zheng Yuan and Zhen Peng and Haiwen Ou},
      title = {Two Kinds of Biclique Attacks on Lightweight Block Cipher {PRINCE}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2015/1208},
      year = {2015},
      url = {https://eprint.iacr.org/2015/1208}
}