One document matched: draft-hoffman-rfc3664bis-00.txt
Network Working Group P. Hoffman
Internet-Draft VPN Consortium
Obsoletes: 3664 (if approved) March 28, 2005
Expires: September 29, 2005
The AES-XCBC-PRF-128 Algorithm for the Internet Key Exchange Protocol
(IKE)
draft-hoffman-rfc3664bis-00.txt
Status of this Memo
This document is an Internet-Draft and is subject to all provisions
of Section 3 of RFC 3667. By submitting this Internet-Draft, each
author represents that any applicable patent or other IPR claims of
which he or she is aware have been or will be disclosed, and any of
which he or she become aware will be disclosed, in accordance with
RFC 3668.
Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF), its areas, and its working groups. Note that
other groups may also distribute working documents as
Internet-Drafts.
Internet-Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress."
The list of current Internet-Drafts can be accessed at
http://www.ietf.org/ietf/1id-abstracts.txt.
The list of Internet-Draft Shadow Directories can be accessed at
http://www.ietf.org/shadow.html.
This Internet-Draft will expire on September 29, 2005.
Copyright Notice
Copyright (C) The Internet Society (2005).
Abstract
Some implementations of IP Security (IPsec) may want to use a
pseudo-random function derived from the Advanced Encryption Standard
(AES). This document describes such an algorithm, called AES-XCBC-
PRF-128.
Hoffman Expires September 29, 2005 [Page 1]
Internet-Draft AES-XCBC-PRF-128 algorithm March 2005
1. Introduction
[AES-XCBC-MAC] describes a method to use the Advanced Encryption
Standard (AES) as a message authentication code (MAC) whose output is
96 bits long. While 96 bits is considered appropriate for a MAC, it
is too short to be useful as a long-lived pseudo-random (PRF) in
either IKE version 1 or version 2. Both versions of IKE use the PRF
to create keys in a fashion that is dependent on the length of the
output of the PRF. Using a PRF that has 96 bits of output creates
keys that are easier to attack with brute force than a PRF that uses
128 bits of output.
Fortunately, there is a very simple method to use much of
[AES-XCBC-MAC] as a PRF whose output is 128 bits: omit the step that
truncates the 128-bit value to 96 bits.
1.1 Differences from RFC 3664
This document specifies the same algorithm as RFC 3664 except that
the restriction on keys having to be exactly 128 bits from
[AES-XCBC-MAC] is removed. Implementations of RFC 3664 will have the
same bits-on-the-wire results as this algorithm; the only difference
is that keys that were not equal in length to 128 bits will no loger
be rejected, but instead will be made 128 bits in accordance with
[HMAC-definition].
2. The AES-XCBC-PRF-128 Algorithm
The AES-XCBC-PRF-128 algorithm is identical to [AES-XCBC-MAC] except
for two changes:
o The key length restriction of exactly 128 bits in [AES-XCBC-MAC]
is changed. The key for the AES-XCBC-PRF-128 algorithm is created
using the formula in [HMAC-definition]. This brings
AES-XCBC-PRF-128 in alignment with HMAC-SHA1 and HMAC-MD5 when
used as PRFs in IKE.
o The truncation step in section 4.3 of [AES-XCBC-MAC] is *not*
performed. That is, there is no processing after section 4.2 of
[AES-XCBC-MAC].
The test vectors in section 4.6 can be used for AES-XCBC-PRF-128, but
only those listed as "AES-XCBC-MAC", not "AES-XCBC-MAC-96".
3. Security Considerations
The security provided by AES-XCBC-MAC-PRF is based upon the strengths
of AES and HMAC. At the time of this writing, there are no known
Hoffman Expires September 29, 2005 [Page 2]
Internet-Draft AES-XCBC-PRF-128 algorithm March 2005
practical cryptographic attacks against AES or AES-XCBC-MAC-PRF or
HMACs.
As is true with any cryptographic algorithm, part of its strength
lies in the security of the key management mechanism, the strength of
the associated secret key, and upon the correctness of the
implementations in all of the participating systems. [AES-XCBC-MAC]
contains test vectors to assist in verifying the correctness of the
AES-XCBC-MAC-PRF code. The test vectors all show the full MAC value
before it is truncated to 96 bits. The PRF makes use of the full MAC
value, not the truncated one.
4. Normative References
[AES-XCBC-MAC]
Frankel, S. and H. Herbert, "The AES-XCBC-MAC-96 Algorithm
and Its Use With IPsec", RFC 3566, September 2003.
[HMAC-definition]
Krawczyk, H., Bellare, M. and R. Canetti, "HMAC:
Keyed-Hashing for Message Authentication", RFC 2104,
February 1997.
Author's Address
Paul Hoffman
VPN Consortium
Email: paul.hoffman@vpnc.org
Hoffman Expires September 29, 2005 [Page 3]
Internet-Draft AES-XCBC-PRF-128 algorithm March 2005
Intellectual Property Statement
The IETF takes no position regarding the validity or scope of any
Intellectual Property Rights or other rights that might be claimed to
pertain to the implementation or use of the technology described in
this document or the extent to which any license under such rights
might or might not be available; nor does it represent that it has
made any independent effort to identify any such rights. Information
on the procedures with respect to rights in RFC documents can be
found in BCP 78 and BCP 79.
Copies of IPR disclosures made to the IETF Secretariat and any
assurances of licenses to be made available, or the result of an
attempt made to obtain a general license or permission for the use of
such proprietary rights by implementers or users of this
specification can be obtained from the IETF on-line IPR repository at
http://www.ietf.org/ipr.
The IETF invites any interested party to bring to its attention any
copyrights, patents or patent applications, or other proprietary
rights that may cover technology that may be required to implement
this standard. Please address the information to the IETF at
ietf-ipr@ietf.org.
Disclaimer of Validity
This document and the information contained herein are provided on an
"AS IS" basis and THE CONTRIBUTOR, THE ORGANIZATION HE/SHE REPRESENTS
OR IS SPONSORED BY (IF ANY), THE INTERNET SOCIETY AND THE INTERNET
ENGINEERING TASK FORCE DISCLAIM ALL WARRANTIES, EXPRESS OR IMPLIED,
INCLUDING BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF THE
INFORMATION HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED
WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
Copyright Statement
Copyright (C) The Internet Society (2005). This document is subject
to the rights, licenses and restrictions contained in BCP 78, and
except as set forth therein, the authors retain all their rights.
Acknowledgment
Funding for the RFC Editor function is currently provided by the
Internet Society.
Hoffman Expires September 29, 2005 [Page 4]
| PAFTECH AB 2003-2026 | 2026-04-21 19:11:03 |