Paper 2018/447
Improved Distinguisher Search Techniques Based on Parity Sets
Xiaofeng Xie and Tian Tian
Abstract
Division property is a distinguishing property against block ciphers proposed by Todo at EUROCRYPT 2015. To give a new approach to division property, Christina et al. proposed a new notion called the parity set at CRYPTO 2016. Using parity sets, they successfully took further properties of S-boxes and linear layers into account and found improved distinguishers against PRESENT. However, the time and memory complexities to compute parity sets are expensive. In this paper, we introduce the idea of meet-in-the-middle to the integral distinguisher search along with a variety of techniques to reduce computation complexity. As a result, we obtain a new distinguisher against 9-round PRESENT which has 22 balanced bits.
Metadata
- Available format(s)
-
PDF
- Publication info
- Preprint. MINOR revision.
- Keywords
- Division propertyParity setIntegral attacksMeet-in- the-middlePRESENT.
- Contact author(s)
- xiaofengxie514 @ 126 com
- History
- 2018-06-14: revised
- 2018-05-21: received
- See all versions
- Short URL
- https://ia.cr/2018/447
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2018/447,
author = {Xiaofeng Xie and Tian Tian},
title = {Improved Distinguisher Search Techniques Based on Parity Sets},
howpublished = {Cryptology ePrint Archive, Paper 2018/447},
year = {2018},
note = {\url{https://eprint.iacr.org/2018/447}},
url = {https://eprint.iacr.org/2018/447}
}
