Reference : Key Wrapping with a Fixed Permutation
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/19552
Key Wrapping with a Fixed Permutation
English
Khovratovich, Dmitry mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
2014
Topics in Cryptology - {CT-RSA} 2014 - The Cryptographer's Track at the {RSA} Conference 2014, San Francisco, CA, USA, February 25-28, 2014. Proceedings
Lecture Notes in Computer Science, vol. 8366
481-499
Yes
No
International
978-3-319-04851-2
RSA conference 2014, Cryptography Track
from 25-02-2014 to 1-03-2014
[en] We present an efficient key wrapping scheme that uses a single public permutation as the basic element. As the scheme does not rely on block ciphers, it can be used on a resource-constrained device where such a permutation comes from an implemented hash function, regular (SHA-3/Keccak) or lightweight one (Quark, Photon). 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.

We use the security notion from the concept of Deterministic Authenticated Encryption (DAE) introduced by Rogaway and Shrimpton. Though the permutation is inevitably modeled as a random permutation, the resulting proof of security is short and easy to verify and hence provide a reasonable alternative to authentication modes based on block ciphers
http://hdl.handle.net/10993/19552

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
kw.pdfAuthor preprint438.11 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.