Paper 2006/064 Original: eprint.iacr.org/2006/064 ↗
Perturbing and Protecting a Traceable Block Cipher
Abstract
At the Asiacrypt 2003 conference Billet and Gilbert introduce a block cipher, which, to quote them, has the following paradoxical traceability properties: it is computationally easy to derive many equivalent distinct descriptions of the same instance of the block cipher; but it is computationally difficult, given one or even up to $k$ of them, to recover the so-called meta-key from which they were derived, or to find any additional equivalent description, or more generally to forge any new untraceable description of the same instance of the block cipher. Their construction relies on the Isomorphism of Polynomials (IP) problem. We here show how to strengthen this construction against algebraic attacks by concealing the underlying IP problems. Our modification is such that our description of the block cipher now does not give the expected results all the time and parallel executions are used to obtain the correct value.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2006-02-23: last updated
- 2006-02-23: published
- Short URL
- https://ia.cr/2006/064
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2006/064,
author = {Julien Bringer and Hervé Chabanne and Emmanuelle Dottax},
title = {Perturbing and Protecting a Traceable Block Cipher},
howpublished = {Cryptology {ePrint} Archive, Paper 2006/064},
year = {2006},
url = {https://eprint.iacr.org/2006/064}
}