Paper 2010/398 Original: eprint.iacr.org/2010/398 ↗
Distinguisher for Shabal's Permutation Function
Abstract
In this note we consider the Shabal permutation function $\mathcal{P}$ as a block cipher with input $A_p$,$B_p$ and key $C$,$M$ and describe a distinguisher with a data complexity of $2^{23}$ random inputs with a given difference. If the attacker can control one chosen bit of $B_p$, only $2^{21}$ inputs with a given difference are required on average. This distinguisher does not appear to lead directly to an attack on the full Shabal construction.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2010-07-20: last updated
- 2010-07-15: published
- Short URL
- https://ia.cr/2010/398
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2010/398,
author = {Peter Novotney},
title = {Distinguisher for Shabal's Permutation Function},
howpublished = {Cryptology {ePrint} Archive, Paper 2010/398},
year = {2010},
url = {https://eprint.iacr.org/2010/398}
}