Paper 2013/145 Original: eprint.iacr.org/2013/145 ↗
Key Wrapping with a Fixed Permutation
Abstract
We present an efficient key wrapping scheme that uses a single wide permutation and does not rely on block ciphers. The scheme is capable of wrapping keys up to 1400 bits long and processing arbitrarily long headers. Our scheme easily delivers the security level of 128 bits or higher with the master key of the same length. The permutation can be taken from the sponge hash functions such as SHA-3 (Keccak), Quark, Photon, Spongent. We also present a simple proof of security within the concept of Deterministic Authenticated Encryption (DAE) introduced by Rogaway and Shrimpton. We extend the setting by allowing the adversary to query the permutation and following the indifferentiability setting in the security proof of the sponge construction.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2013-03-13: last updated
- 2013-03-13: published
- Short URL
- https://ia.cr/2013/145
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2013/145,
author = {Dmitry Khovratovich},
title = {Key Wrapping with a Fixed Permutation},
howpublished = {Cryptology {ePrint} Archive, Paper 2013/145},
year = {2013},
url = {https://eprint.iacr.org/2013/145}
}