Paper 2026/2917

Six Passes Are Enough: Security Proofs for NIST AES Key Wrap

Yuwen Zhou, University of British Columbia Okanagan
Abstract

AES Key Wrap protects keys entering and leaving hardware security modules and keys exchanged through S/MIME, JOSE and PKCS#11. NIST standardized it as KW and KWP in SP 800-38F and is now revising that document. In twenty-five years the algorithm has received no security proof, and apart from a remark on very long messages, nothing published explains its six passes of AES. Its design breaks the assumptions of existing proofs in three ways. One AES key serves every step, whereas proofs for generalized Feistel networks assume independent round functions; the chaining value has only 64 bits, so collisions on it occur long before the birthday bound of AES and a proof cannot exclude them; and unwrapping runs the algorithm backward on adversarial ciphertexts, which the usual arguments handle only with independently keyed halves. We prove that if AES is a strong pseudorandom permutation (PRP), the six-pass wrapping function at the core of the standard is also a strong PRP, with main term $88\,\sigma^2/2^{128}$ for $\sigma$ semiblocks of data. KW and KWP are deterministic authenticated encryption schemes, with an additional term for guessing the 64-bit check value. Our main step is to sample the intermediate values of each message from both ends, forward from the input and backward from the output, and to join the two sides in the middle, which treats forward and inverse queries alike. Every bad event then involves at most two messages and needs two independent 64-bit collisions, which we count rather than exclude. The count needs only two passes on each side of the join and one for the join, so five passes give a bound of the same form and the sixth is to spare. Two passes, by contrast, can be distinguished from random with $2^{32}$ short queries. All bounds extend to many independent keys without a loss in the number of keys.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Preprint.
Keywords
key wrappingAES-KWprovable securitydeterministic authenticated encryptionSP 800-38F
Contact author(s)
zhouyw07 @ student ubc ca
History
2026-11-21: approved
2026-11-16: received
See all versions
Short URL
https://ia.cr/2026/2917
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2026/2917,
      author = {Yuwen Zhou},
      title = {Six Passes Are Enough: Security Proofs for {NIST} {AES} Key Wrap},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/2917},
      year = {2026},
      url = {https://eprint.iacr.org/2026/2917}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.