draft-ietf-smime-camellia-05.txt   rfc3657.txt 
S/MIME Working Group S. Moriai Network Working Group S. Moriai
Internet Draft Sony Computer Entertainment Inc. Request for Comments: 3657 Sony Computer Entertainment Inc.
Document: draft-ietf-smime-camellia-05.txt A. Kato Category: Standards Track A. Kato
Expires: February 2004 NTT Software Corporation NTT Software Corporation
August 2003 January 2004
Use of the Camellia Encryption Algorithm in CMS Use of the Camellia Encryption Algorithm
in Cryptographic Message Syntax (CMS)
Status of this Memo Status of this Memo
This document is an Internet-Draft and is in full conformance with This document specifies an Internet standards track protocol for the
all provisions of Section 10 of RFC2026. Internet community, and requests discussion and suggestions for
improvements. Please refer to the current edition of the "Internet
Internet-Drafts are working documents of the Internet Engineering Official Protocol Standards" (STD 1) for the standardization state
Task Force (IETF), its areas, and its working groups. Note that and status of this protocol. Distribution of this memo is unlimited.
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 Copyright Notice
http://www.ietf.org/shadow.html.
Comments or suggestions for improvement may be made on the Copyright (C) The Internet Society (2004). All Rights Reserved.
"ietf-smime" mailing list, or directly to the author.
Abstract Abstract
This document specifies the conventions for using the Camellia This document specifies the conventions for using the Camellia
encryption algorithm for encryption with the Cryptographic encryption algorithm for encryption with the Cryptographic Message
Message Syntax (CMS). Syntax (CMS).
1. Introduction 1. Introduction
This document specifies the conventions for using the Camellia This document specifies the conventions for using the Camellia
encryption algorithm [CamelliaSpec][CamelliaID] for encryption with encryption algorithm [CamelliaSpec] for encryption with the
the Cryptographic Message Syntax (CMS) [CMS]. The relevant object Cryptographic Message Syntax (CMS) [CMS]. The relevant object
identifiers (OIDs) and processing steps are provided so that identifiers (OIDs) and processing steps are provided so that Camellia
Camellia may be used in the CMS specification (RFC 3369, RFC 3370) may be used in the CMS specification (RFC 3369, RFC 3370) for content
for content and key encryption. and key encryption.
Note: Note: This work was done when the first author worked for NTT.
This work was done when the first author worked for NTT.
1.1 Camellia 1.1. Camellia
Camellia was jointly developed by Nippon Telegraph and Telephone Camellia was jointly developed by Nippon Telegraph and Telephone
Corporation and Mitsubishi Electric Corporation in 2000. Camellia Corporation and Mitsubishi Electric Corporation in 2000. Camellia
specifies the 128-bit block size and 128-, 192-, and 256-bit key specifies the 128-bit block size and 128-, 192-, and 256-bit key
sizes, the same interface as the Advanced Encryption Standard (AES). sizes, the same interface as the Advanced Encryption Standard (AES).
Camellia is characterized by its suitability for both software and Camellia is characterized by its suitability for both software and
hardware implementations as well as its high level of security. hardware implementations as well as its high level of security. From
From a practical viewpoint, it is designed to enable flexibility in a practical viewpoint, it is designed to enable flexibility in
software and hardware implementations on 32-bit processors widely software and hardware implementations on 32-bit processors widely
used over the Internet and many applications, 8-bit processors used used over the Internet and many applications, 8-bit processors used
in smart cards, cryptographic hardware, embedded systems, and so on in smart cards, cryptographic hardware, embedded systems, and so on
[CamelliaTech]. Moreover, its key setup time is excellent, and its [CamelliaTech]. Moreover, its key setup time is excellent, and its
key agility is superior to that of AES. key agility is superior to that of AES.
Camellia has been scrutinized by the wide cryptographic community Camellia has been scrutinized by the wide cryptographic community
during several projects for evaluating crypto algorithms. In during several projects for evaluating crypto algorithms. In
particular, Camellia was selected as a recommended cryptographic particular, Camellia was selected as a recommended cryptographic
primitive by the EU NESSIE (New European Schemes for Signatures, primitive by the EU NESSIE (New European Schemes for Signatures,
Integrity and Encryption) project [NESSIE] and also included in Integrity and Encryption) project [NESSIE] and also included in the
the list of cryptographic techniques for Japanese e-Government list of cryptographic techniques for Japanese e-Government systems
systems which were selected by the Japan CRYPTREC (Cryptography which were selected by the Japan CRYPTREC (Cryptography Research and
Research and Evaluation Committees) [CRYPTREC]. Evaluation Committees) [CRYPTREC].
1.2 Terminology 1.2. Terminology
The key words "MUST", "MUST NOT", "REQUIRED", "SHOULD", "SHOULD The key words "MUST", "MUST NOT", "REQUIRED", "SHOULD", "SHOULD NOT",
NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this document (in "RECOMMENDED", "MAY", and "OPTIONAL" in this document (in uppercase,
uppercase, as shown) are to be interpreted as described in as shown) are to be interpreted as described in [RFC2119].
[RFC2119].
2. Object Identifiers for Content and Key Encryption 2. Object Identifiers for Content and Key Encryption
This section provides the OIDs and processing information necessary This section provides the OIDs and processing information necessary
for Camellia to be used for content and key encryption in CMS. for Camellia to be used for content and key encryption in CMS.
Camellia is added to the set of optional symmetric encryption Camellia is added to the set of optional symmetric encryption
algorithms in CMS by providing two classes of unique object algorithms in CMS by providing two classes of unique object
identifiers (OIDs). One OID class defines the content encryption identifiers (OIDs). One OID class defines the content encryption
algorithms and the other defines the key encryption algorithms. algorithms and the other defines the key encryption algorithms. Thus
Thus a CMS agent can apply Camellia either for content or key a CMS agent can apply Camellia either for content or key encryption
encryption by selecting the corresponding object identifier, by selecting the corresponding object identifier, supplying the
supplying the required parameter, and starting the program code. required parameter, and starting the program code.
2.1 OIDs for Content Encryption 2.1. OIDs for Content Encryption
Camellia is added to the set of symmetric content encryption Camellia is added to the set of symmetric content encryption
algorithms defined in [CMSALG]. The Camellia content-encryption algorithms defined in [CMSALG]. The Camellia content-encryption
algorithm, in Cipher Block Chaining (CBC) mode, for the three algorithm, in Cipher Block Chaining (CBC) mode, for the three
different key sizes are identified by the following object different key sizes are identified by the following object
identifiers: identifiers:
id-camellia128-cbc OBJECT IDENTIFIER ::= id-camellia128-cbc OBJECT IDENTIFIER ::=
{ iso(1) member-body(2) 392 200011 61 security(1) { iso(1) member-body(2) 392 200011 61 security(1)
algorithm(1) symmetric-encryption-algorithm(1) algorithm(1) symmetric-encryption-algorithm(1)
skipping to change at page 3, line 23 skipping to change at page 3, line 37
The AlgorithmIdentifier parameters field MUST be present, and the The AlgorithmIdentifier parameters field MUST be present, and the
parameters field MUST contain the value of IV: parameters field MUST contain the value of IV:
CamelliaCBCParameter ::= CamelliaIV -- Initialization Vector CamelliaCBCParameter ::= CamelliaIV -- Initialization Vector
CamelliaIV ::= OCTET STRING (SIZE(16)) CamelliaIV ::= OCTET STRING (SIZE(16))
The plain text is padded according to Section 6.3 of [CMS]. The plain text is padded according to Section 6.3 of [CMS].
2.2 OIDs for Key Encryption 2.2. OIDs for Key Encryption
The key-wrap/unwrap procedures used to encrypt/decrypt a Camellia The key-wrap/unwrap procedures used to encrypt/decrypt a Camellia
content-encryption key (CEK) with a Camellia key-encryption key content-encryption key (CEK) with a Camellia key-encryption key (KEK)
(KEK) are specified in Section 3. Generation and distribution of are specified in Section 3. Generation and distribution of key-
key-encryption keys are beyond the scope of this document. encryption keys are beyond the scope of this document.
The Camellia key-encryption algorithm has the following object The Camellia key-encryption algorithm has the following object
identifier: identifier:
id-camellia128-wrap OBJECT IDENTIFIER ::= id-camellia128-wrap OBJECT IDENTIFIER ::=
{ iso(1) member-body(2) 392 200011 61 security(1) { iso(1) member-body(2) 392 200011 61 security(1)
algorithm(1) key-wrap-algorithm(3) algorithm(1) key-wrap-algorithm(3)
camellia128-wrap(2) } camellia128-wrap(2) }
id-camellia192-wrap OBJECT IDENTIFIER ::= id-camellia192-wrap OBJECT IDENTIFIER ::=
{ iso(1) member-body(2) 392 200011 61 security(1) { iso(1) member-body(2) 392 200011 61 security(1)
algorithm(1) key-wrap-algorithm(3) algorithm(1) key-wrap-algorithm(3)
camellia192-wrap(3) } camellia192-wrap(3) }
id-camellia256-wrap OBJECT IDENTIFIER ::= id-camellia256-wrap OBJECT IDENTIFIER ::=
{ iso(1) member-body(2) 392 200011 61 security(1) { iso(1) member-body(2) 392 200011 61 security(1)
algorithm(1) key-wrap-algorithm(3) algorithm(1) key-wrap-algorithm(3)
camellia256-wrap(4) } camellia256-wrap(4) }
skipping to change at page 3, line 50 skipping to change at page 4, line 16
algorithm(1) key-wrap-algorithm(3) algorithm(1) key-wrap-algorithm(3)
camellia192-wrap(3) } camellia192-wrap(3) }
id-camellia256-wrap OBJECT IDENTIFIER ::= id-camellia256-wrap OBJECT IDENTIFIER ::=
{ iso(1) member-body(2) 392 200011 61 security(1) { iso(1) member-body(2) 392 200011 61 security(1)
algorithm(1) key-wrap-algorithm(3) algorithm(1) key-wrap-algorithm(3)
camellia256-wrap(4) } camellia256-wrap(4) }
In all cases the parameters field of AlgorithmIdentifier MUST be In all cases the parameters field of AlgorithmIdentifier MUST be
ABSENT, because the key wrapping procedure itself defines how and ABSENT, because the key wrapping procedure itself defines how and
when to use an IV. The OID gives the KEK key size, but does not when to use an IV. The OID gives the KEK key size, but does not make
make any statements as to the size of the wrapped Camellia CEK. any statements as to the size of the wrapped Camellia CEK.
Implementations MAY use different KEK and CEK sizes. Implementations MAY use different KEK and CEK sizes. Implementations
Implementations MUST support the CEK and the KEK having the MUST support the CEK and the KEK having the same length. If
same length. If different lengths are supported, the KEK MUST be different lengths are supported, the KEK MUST be of equal or greater
of equal or greater length than the CEK. length than the CEK.
3. Key Wrap Algorithm 3. Key Wrap Algorithm
Camellia key wrapping and unwrapping is done in conformance with the
AES key wrap algorithm [AES-WRAP][RFC3394], because Camellia and AES
have the same block and key sizes, i.e. the block size of 128 bits
and key sizes of 128, 192, and 256 bits.
3.1 Notation and Definitions Camellia key wrapping and unwrapping are done in conformance with the
AES key wrap algorithm [RFC3394], because Camellia and AES have the
same block and key sizes, i.e., the block size of 128 bits and key
sizes of 128, 192, and 256 bits.
The following notation is used in the description of the key 3.1. Notation and Definitions
wrapping algorithms:
The following notation is used in the description of the key wrapping
algorithms:
Camellia(K, W) Camellia(K, W)
Encrypt W using the Camellia codebook with key K Encrypt W using the Camellia codebook with key K
Camellia-1(K, W) Camellia-1(K, W)
Decrypt W using the Camellia codebook with key K Decrypt W using the Camellia codebook with key K
MSB(j, W) Return the most significant j bits of W MSB(j, W) Return the most significant j bits of W
LSB(j, W) Return the least significant j bits of W LSB(j, W) Return the least significant j bits of W
B1 ^ B2 The bitwise exclusive or (XOR) of B1 and B2 B1 ^ B2 The bitwise exclusive or (XOR) of B1 and B2
B1 | B2 Concatenate B1 and B2 B1 | B2 Concatenate B1 and B2
K The key-encryption key K K The key-encryption key K
n The number of 64-bit key data blocks n The number of 64-bit key data blocks
s The number of steps in the wrapping process, s = 6n s The number of steps in the wrapping process, s = 6n
P[i] The ith plaintext key data block P[i] The ith plaintext key data block
C[i] The ith ciphertext data block C[i] The ith ciphertext data block
A The 64-bit integrity check register A The 64-bit integrity check register
R[i] An array of 64-bit registers where R[i] An array of 64-bit registers where
i = 0, 1, 2, ..., n i = 0, 1, 2, ..., n
A[t], R[i][t] The contents of registers A and R[i] after encryption A[t], R[t][i] The contents of registers A and R[i] after encryption
step t. step t.
IV The 64-bit initial value used during the wrapping IV The 64-bit initial value used during the wrapping
process. process.
In the key wrap algorithm, the concatenation function will be used In the key wrap algorithm, the concatenation function will be used to
to concatenate 64-bit quantities to form the 128-bit input to the concatenate 64-bit quantities to form the 128-bit input to the
Camellia codebook. The extraction functions will be used to split Camellia codebook. The extraction functions will be used to split
the 128-bit output from the Camellia codebook into two 64-bit the 128-bit output from the Camellia codebook into two 64-bit
quantities. quantities.
3.2 Camellia Key Wrap 3.2. Camellia Key Wrap
Key wrapping with Camellia is identical to Section 2.2.1 of Key wrapping with Camellia is identical to Section 2.2.1 of [RFC3394]
[RFC3394] with "AES" replaced by "Camellia". with "AES" replaced by "Camellia".
The inputs to the key wrapping process are the KEK and the plaintext The inputs to the key wrapping process are the KEK and the plaintext
to be wrapped. The plaintext consists of n 64-bit blocks, to be wrapped. The plaintext consists of n 64-bit blocks, containing
containing the key data being wrapped. The key wrapping process is the key data being wrapped. The key wrapping process is described
described below. below.
Inputs: Plaintext, n 64-bit values {P1, P2, ..., Pn}, and Inputs: Plaintext, n 64-bit values {P[1], P[2], ..., P[n]},
Key, K (the KEK). and Key, K (the KEK).
Outputs: Ciphertext, (n+1) 64-bit values {C0, C1, ..., Cn}. Outputs: Ciphertext, (n+1) 64-bit values {C[0], C[1], ...,
C[n]}.
1) Initialize variables. 1) Initialize variables.
Set A0 to an initial value (see Section 3.4) Set A[0] to an initial value (see Section 3.4)
For i = 1 to n For i = 1 to n
R[0][i] = P[i] R[0][i] = P[i]
2) Calculate intermediate values. 2) Calculate intermediate values.
For t = 1 to s, where s = 6n For t = 1 to s, where s = 6n
A[t] = MSB(64, Camellia(K, A[t-1] | R[t-1][1])) ^ t A[t] = MSB(64, Camellia(K, A[t-1] | R[t-1][1])) ^ t
For i = 1 to n-1 For i = 1 to n-1
R[t][i] = R[t-1][i+1] R[t][i] = R[t-1][i+1]
R[t][n] = LSB(64, Camellia(K, A[t-1] | R[t-1][1])) R[t][n] = LSB(64, Camellia(K, A[t-1] | R[t-1][1]))
skipping to change at page 5, line 22 skipping to change at page 6, line 4
A[t] = MSB(64, Camellia(K, A[t-1] | R[t-1][1])) ^ t A[t] = MSB(64, Camellia(K, A[t-1] | R[t-1][1])) ^ t
For i = 1 to n-1 For i = 1 to n-1
R[t][i] = R[t-1][i+1] R[t][i] = R[t-1][i+1]
R[t][n] = LSB(64, Camellia(K, A[t-1] | R[t-1][1])) R[t][n] = LSB(64, Camellia(K, A[t-1] | R[t-1][1]))
3) Output the results. 3) Output the results.
Set C[0] = A[t] Set C[0] = A[t]
For i = 1 to n For i = 1 to n
C[i] = R[t][i] C[i] = R[t][i]
An alternative description of the key wrap algorithm involves An alternative description of the key wrap algorithm involves
indexing rather than shifting. This approach allows one to indexing rather than shifting. This approach allows one to calculate
calculate the wrapped key in place, avoiding the rotation in the the wrapped key in place, avoiding the rotation in the previous
previous description. This produces identical results and is more description. This produces identical results and is more easily
easily implemented in software. implemented in software.
Inputs: Plaintext, n 64-bit values {P1, P2, ..., Pn}, and Inputs: Plaintext, n 64-bit values {P[1], P[2], ..., P[n]},
Key, K (the KEK). and Key, K (the KEK).
Outputs: Ciphertext, (n+1) 64-bit values {C0, C1, ..., Cn}. Outputs: Ciphertext, (n+1) 64-bit values {C[0], C[1], ...,
C[n]}.
1) Initialize variables. 1) Initialize variables.
Set A = IV, an initial value (see Section 3.4) Set A = IV, an initial value (see Section 3.4)
For i = 1 to n For i = 1 to n
R[i] = P[i] R[i] = P[i]
2) Calculate intermediate values. 2) Calculate intermediate values.
For j = 0 to 5 For j = 0 to 5
skipping to change at page 5, line 53 skipping to change at page 6, line 35
B = Camellia(K, A | R[i]) B = Camellia(K, A | R[i])
A = MSB(64, B) ^ t where t = (n*j)+i A = MSB(64, B) ^ t where t = (n*j)+i
R[i] = LSB(64, B) R[i] = LSB(64, B)
3) Output the results. 3) Output the results.
Set C[0] = A Set C[0] = A
For i = 1 to n For i = 1 to n
C[i] = R[i] C[i] = R[i]
3.3 Camellia Key Unwrap 3.3. Camellia Key Unwrap
Key unwrapping with Camellia is identical to Section 2.2.2 of Key unwrapping with Camellia is identical to Section 2.2.2 of
[RFC3394], with "AES" replaced by "Camellia". [RFC3394], with "AES" replaced by "Camellia".
The inputs to the unwrap process are the KEK and (n+1) 64-bit blocks The inputs to the unwrap process are the KEK and (n+1) 64-bit blocks
of ciphertext consisting of previously wrapped key. It returns n of ciphertext consisting of previously wrapped key. It returns n
blocks of plaintext consisting of the n 64-bit blocks of the blocks of plaintext consisting of the n 64-bit blocks of the
decrypted key data. decrypted key data.
Inputs: Ciphertext, (n+1) 64-bit values {C0, C1, ..., Cn}, and Inputs: Ciphertext, (n+1) 64-bit values {C[0], C[1], ..., C[n]},
Key, K (the KEK). and Key, K (the KEK).
Outputs: Plaintext, n 64-bit values {P1, P2, ..., Pn}. Outputs: Plaintext, n 64-bit values {P[1], P[2], ..., P[n]}.
1) Initialize variables. 1) Initialize variables.
Set A[s] = C[0] where s = 6n Set A[s] = C[0] where s = 6n
For i = 1 to n For i = 1 to n
R[s][i] = C[i] R[s][i] = C[i]
2) Calculate the intermediate values. 2) Calculate the intermediate values.
For t = s to 1 For t = s to 1
skipping to change at page 6, line 42 skipping to change at page 7, line 33
For i = 1 to n For i = 1 to n
P[i] = R[0][i] P[i] = R[0][i]
Else Else
Return an error Return an error
The unwrap algorithm can also be specified as an index based The unwrap algorithm can also be specified as an index based
operation, allowing the calculations to be carried out in place. operation, allowing the calculations to be carried out in place.
Again, this produces the same results as the register shifting Again, this produces the same results as the register shifting
approach. approach.
Inputs: Ciphertext, (n+1) 64-bit values {C0, C1, ..., Cn}, and Inputs: Ciphertext, (n+1) 64-bit values {C[0], C[1], ..., C[n]},
Key, K (the KEK). and Key, K (the KEK).
Outputs: Plaintext, n 64-bit values {P0, P1, K, Pn}. Outputs: Plaintext, n 64-bit values {P[0], P[1], ..., P[n]}.
1) Initialize variables. 1) Initialize variables.
Set A = C[0] Set A = C[0]
For i = 1 to n For i = 1 to n
R[i] = C[i] R[i] = C[i]
2) Compute intermediate values. 2) Calculate intermediate values.
For j = 5 to 0 For j = 5 to 0
For i = n to 1 For i = n to 1
B = Camellia-1(K, (A ^ t) | R[i]) where t = n*j+i B = Camellia-1(K, (A ^ t) | R[i]) where t = n*j+i
A = MSB(64, B) A = MSB(64, B)
R[i] = LSB(64, B) R[i] = LSB(64, B)
3) Output results. 3) Output results.
If A is an appropriate initial value (see Section 3.4), If A is an appropriate initial value (see Section 3.4),
Then Then
For i = 1 to n For i = 1 to n
P[i] = R[i] P[i] = R[i]
Else Else
Return an error Return an error
3.4 Key Data Integrity -- the Initial Value 3.4. Key Data Integrity -- the Initial Value
The initial value (IV) refers to the value assigned to A[0] in the The initial value (IV) refers to the value assigned to A[0] in the
first step of the wrapping process. This value is used to obtain an first step of the wrapping process. This value is used to obtain an
integrity check on the key data. In the final step of the integrity check on the key data. In the final step of the unwrapping
unwrapping process, the recovered value of A[0] is compared to the process, the recovered value of A[0] is compared to the expected
expected value of A[0]. If there is a match, the key is accepted as value of A[0]. If there is a match, the key is accepted as valid,
valid, and the unwrapping algorithm returns it. If there is not a and the unwrapping algorithm returns it. If there is not a match,
match, then the key is rejected, and the unwrapping algorithm then the key is rejected, and the unwrapping algorithm returns an
returns an error. error.
The exact properties achieved by this integrity check depend on the The exact properties achieved by this integrity check depend on the
definition of the initial value. Different applications may call definition of the initial value. Different applications may call for
for somewhat different properties; for example, whether there is somewhat different properties; for example, whether there is need to
need to determine the integrity of key data throughout its lifecycle determine the integrity of key data throughout its lifecycle or just
or just when it is unwrapped. This specification defines a default when it is unwrapped. This specification defines a default initial
initial value that supports integrity of the key data during the value that supports integrity of the key data during the period it is
period it is wrapped (in Section 3.4.1). Provision is also made to wrapped (in Section 3.4.1). Provision is also made to support
support alternative initial values (in Section 3.4.2). alternative initial values (in Section 3.4.2).
3.4.1 Default Initial Value 3.4.1. Default Initial Value
The default initial value (IV) is defined to be the hexadecimal The default initial value (IV) is defined to be the hexadecimal
constant: constant:
A[0] = IV = A6A6A6A6A6A6A6A6 A[0] = IV = A6A6A6A6A6A6A6A6
The use of a constant as the IV supports a strong integrity check on The use of a constant as the IV supports a strong integrity check on
the key data during the period that it is wrapped. If unwrapping the key data during the period that it is wrapped. If unwrapping
produces A[0] = A6A6A6A6A6A6A6A6, then the chance that the key data produces A[0] = A6A6A6A6A6A6A6A6, then the chance that the key data
is corrupt is 2^-64. If unwrapping produces A[0] any other value, is corrupt is 2^-64. If unwrapping produces A[0] any other value,
then the unwrap must return an error and not return any key data. then the unwrap must return an error and not return any key data.
3.4.2 Alternative Initial Values 3.4.2. Alternative Initial Values
When the key wrap is used as part of a larger key management When the key wrap is used as part of a larger key management protocol
protocol or system, the desired scope for data integrity may be more or system, the desired scope for data integrity may be more than just
than just the key data or the desired duration for more than just the key data or the desired duration for more than just the period
the period that it is wrapped. Also, if the key data is not just an that it is wrapped. Also, if the key data is not just a Camellia
Camellia key, it may not always be a multiple of 64 bits. key, it may not always be a multiple of 64 bits. Alternative
Alternative definitions of the initial value can be used to address definitions of the initial value can be used to address such
such problems. According to [RFC3394], NIST will define alternative problems. According to [RFC3394], NIST will define alternative
initial values in future key management publications as needed. In initial values in future key management publications as needed. In
order to accommodate a set of alternatives that may evolve over order to accommodate a set of alternatives that may evolve over time,
time, key wrap implementations that are not application-specific key wrap implementations that are not application-specific will
will require some flexibility in the way that the initial value is require some flexibility in the way that the initial value is set and
set and tested. tested.
4. SMIMECapabilities Attribute 4. SMIMECapabilities Attribute
An S/MIME client SHOULD announce the set of cryptographic functions An S/MIME client SHOULD announce the set of cryptographic functions
it supports by using the S/MIME capabilities attribute. This it supports by using the S/MIME capabilities attribute. This
attribute provides a partial list of OIDs of cryptographic functions attribute provides a partial list of OIDs of cryptographic functions
and MUST be signed by the client. The functions' OIDs SHOULD be and MUST be signed by the client. The functions' OIDs SHOULD be
logically separated in functional categories and MUST be ordered logically separated in functional categories and MUST be ordered with
with respect to their preference. respect to their preference.
RFC 2633 [RFC2633], Section 2.5.2 defines the SMIMECapabilities RFC 2633 [RFC2633], Section 2.5.2 defines the SMIMECapabilities
signed attribute (defined as a SEQUENCE of SMIMECapability signed attribute (defined as a SEQUENCE of SMIMECapability SEQUENCEs)
SEQUENCEs) to be used to specify a partial list of algorithms that to be used to specify a partial list of algorithms that the software
the software announcing the SMIMECapabilities can support. announcing the SMIMECapabilities can support.
If an S/MIME client is required to support symmetric encryption with If an S/MIME client is required to support symmetric encryption with
Camellia, the capabilities attribute MUST contain the Camellia OID Camellia, the capabilities attribute MUST contain the Camellia OID
specified above in the category of symmetric algorithms. The specified above in the category of symmetric algorithms. The
parameter associated with this OID MUST be CamelliaSMimeCapability. parameter associated with this OID MUST be CamelliaSMimeCapability.
CamelliaSMimeCapabilty ::= NULL CamelliaSMimeCapabilty ::= NULL
The SMIMECapability SEQUENCE representing Camellia MUST be The SMIMECapability SEQUENCE representing Camellia MUST be DER-
DER-encoded as the following hexadecimal strings: encoded as the following hexadecimal strings:
Key Size Capability Key Size Capability
128 30 0f 06 0b 2a 83 08 8c 9a 4b 3d 01 01 01 02 05 00 128 30 0f 06 0b 2a 83 08 8c 9a 4b 3d 01 01 01 02 05 00
196 30 0f 06 0b 2a 83 08 8c 9a 4b 3d 01 01 01 03 05 00 196 30 0f 06 0b 2a 83 08 8c 9a 4b 3d 01 01 01 03 05 00
256 30 0f 06 0b 2a 83 08 8c 9a 4b 3d 01 01 01 04 05 00 256 30 0f 06 0b 2a 83 08 8c 9a 4b 3d 01 01 01 04 05 00
When a sending agent creates an encrypted message, it has to decide When a sending agent creates an encrypted message, it has to decide
which type of encryption algorithm to use. In general the decision which type of encryption algorithm to use. In general the decision
process involves information obtained from the capabilities lists process involves information obtained from the capabilities lists
included in messages received from the recipient, as well as other included in messages received from the recipient, as well as other
information such as private agreements, user preferences, legal information such as private agreements, user preferences, legal
restrictions, and so on. If users require Camellia for symmetric restrictions, and so on. If users require Camellia for symmetric
encryption, it MUST be supported by the S/MIME clients on both the encryption, it MUST be supported by the S/MIME clients on both the
sending and receiving side, and it MUST be set in the user sending and receiving side, and it MUST be set in the user
preferences. preferences.
5. Security Considerations 5. Security Considerations
This document specifies the use of Camellia for encrypting the This document specifies the use of Camellia for encrypting the
content of a CMS message and for encrypting the symmetric key used content of a CMS message and for encrypting the symmetric key used to
to encrypt the content of a CMS message, and the other mechanisms encrypt the content of a CMS message, and the other mechanisms are
are the same as the existing ones. Therefore, the security the same as the existing ones. Therefore, the security
considerations described in the CMS specifications [CMS][CMSALG] and considerations described in the CMS specifications [CMS][CMSALG] and
the AES key wrap algorithm [AES-WRAP][RFC3394] can be applied to the AES key wrap algorithm [RFC3394] can be applied to this document.
this document. No security problem has been found on Camellia No security problem has been found on Camellia [CRYPTREC][NESSIE].
[CRYPTREC][NESSIE].
6. Intellectual Property Statement 6. Intellectual Property Statement
The IETF takes no position regarding the validity or scope of any The IETF takes no position regarding the validity or scope of any
intellectual property or other rights that might be claimed to intellectual property or other rights that might be claimed to
pertain to the implementation or use of the technology described pertain to the implementation or use of the technology described in
in this document or the extent to which any license under such this document or the extent to which any license under such rights
rights might or might not be available; neither does it represent might or might not be available; neither does it represent that it
that it has made any effort to identify any such rights. has made any effort to identify any such rights. Information on the
Information on the IETF's procedures with respect to rights in IETF's procedures with respect to rights in standards-track and
standards-track and standards-related documentation can be found standards-related documentation can be found in BCP-11. Copies of
in BCP-11. Copies of claims of rights made available for claims of rights made available for publication and any assurances of
publication and any assurances of licenses to be made available, licenses to be made available, or the result of an attempt made to
or the result of an attempt made to obtain a general license or obtain a general license or permission for the use of such
permission for the use of such proprietary rights by implementors proprietary rights by implementors or users of this specification can
or users of this specification can be obtained from the IETF be obtained from the IETF Secretariat.
Secretariat.
The IETF invites any interested party to bring to its attention
any copyrights, patents or patent applications, or other
proprietary rights which may cover technology that may be required
to practice this standard. Please address the information to the
IETF Executive Director.
7. Full Copyright Statement The IETF invites any interested party to bring to its attention any
copyrights, patents or patent applications, or other proprietary
rights which may cover technology that may be required to practice
this standard. Please address the information to the IETF Executive
Director.
Copyright (C) The Internet Society (2003). All Rights Reserved. The IETF has been notified of intellectual property rights claimed in
regard to some or all of the specification contained in this
document. For more information consult the online list of claimed
rights.
This document and translations of it may be copied and furnished 7. References
to others, and derivative works that comment on or otherwise
explain it or assist in its implmentation may be prepared, copied,
published and distributed, in whole or in part, without
restriction of any kind, provided that the above copyright notice
and this paragraph are included on all such copies and derivative
works. However, this document itself may not be modified in any
way, such as by removing the copyright notice or references to the
Internet Society or other Internet organizations, except as needed
for the purpose of developing Internet standards in which case the
procedures for copyrights defined in the Internet Standards
process must be followed, or as required to translate it into
languages other than English.
The limited permissions granted above are perpetual and will not 7.1. Normative References
be revoked by the Internet Society or its successors or assigns.
This document and the information contained herein is provided on [CamelliaSpec] Aoki, K., Ichikawa, T., Kanda, M., Matsui, M., Moriai,
an "AS IS" basis and THE INTERNET SOCIETY AND THE INTERNET S., Nakajima, J., and Tokita, T., "Specification of
ENGINEERING TASK FORCE DISCLAIMS ALL WARRANTIES, EXPRESS OR Camellia - a 128-bit Block Cipher".
IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF http://info.isl.ntt.co.jp/camellia/
THE INFORMATION HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED
WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR
PURPOSE."
8. References [CMS] Housley, R., "Cryptographic Message Syntax", RFC 3369,
August 2002.
[DES] National Institute of Standards and Technology. [CMSALG] Housley, R., "Cryptographic Message Syntax (CMS)
FIPS Pub 46: Data Encryption Standard. 15 January 1977. Algorithms", RFC 3370, August 2002.
[AES-WRAP] National Institute of Standards and Technology. AES Key [RFC2633] Ramsdell, B., Editor, "S/MIME Version 3 Message
Wrap Specification. 17 November 2001. Specification", RFC 2633, June 1999.
http://csrc.nist.gov/encryption/kms/key-wrap.pdf
[CamelliaID] J. Nakajima and S. Moriai, "A Description of the [RFC3565] Schaad, J., "Use of the Advanced Encryption Standard
Camellia Encryption Algorithm", Internet-Draft, July 2001. (AES) Encryption Algorithm in Cryptographic Message
draft-nakajima-camellia-02.txt Syntax (CMS)", RFC 3565, July 2003.
[CamelliaSpec] K. Aoki, T. Ichikawa, M. Kanda, M. Matsui, S. Moriai, [RFC3394] Schaad, J. and R. Housley, "Advanced Encryption
J. Nakajima, and T. Tokita "Specification of Camellia - a Standard (AES) Key Wrap Algorithm", RFC 3394,
128-bit Block Cipher". http://info.isl.ntt.co.jp/camellia/ September 2002.
[CamelliaTech] K. Aoki, T. Ichikawa, M. Kanda, M. Matsui, S. Moriai, 7.2. Informative References
J. Nakajima, and T. Tokita "Camellia: A 128-Bit Block Cipher
Suitable for Multiple Platforms - Design and Analysis -", In
Selected Areas in Cryptography, 7th Annual International
Workshop, SAC 2000, August 2000, Proceedings, Lecture Notes in
Computer Science 2012, pp.39--56, Springer-Verlag, 2001.
[CMS] R. Housley, "Cryptographic Message Syntax", RFC 3369, August [DES] National Institute of Standards and Technology. FIPS
2002. Pub 46: Data Encryption Standard. 15 January 1977.
[CMSALG] R. Housley, "Cryptographic Message Syntax (CMS) [CamelliaTech] Aoki, K., Ichikawa, T., Kanda, M., Matsui, M., Moriai,
Algorithms", RFC 3370, August 2002. S., Nakajima, J., and Tokita, T., "Camellia: A 128-Bit
Block Cipher Suitable for Multiple Platforms - Design
and Analysis -", In Selected Areas in Cryptography,
7th Annual International Workshop, SAC 2000, August
2000, Proceedings, Lecture Notes in Computer Science
2012, pp.39-56, Springer-Verlag, 2001.
[CRYPTREC] Information-technology Promotion Agency (IPA), Japan, [CRYPTREC] Information-technology Promotion Agency (IPA), Japan,
CRYPTREC. http://www.ipa.go.jp/security/enc/CRYPTREC/index-e.html CRYPTREC.
http://www.ipa.go.jp/security/enc/CRYPTREC/index-
e.html
[NESSIE] New European Schemes for Signatures, Integrity and [NESSIE] New European Schemes for Signatures, Integrity and
Encryption (NESSIE) project. http://www.cryptonessie.org Encryption (NESSIE) project.
http://www.cryptonessie.org
[RFC2119] S. Bradner, "Key words for use in RFCs to Indicate [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate
Requirement Levels", BCP 14, RFC 2119, March 1997. Requirement Levels", BCP 14, RFC 2119, March 1997.
[RFC2633] Ramsdell, B., Editor. S/MIME Version 3 Message
Specification. RFC 2633. June 1999.
[RFC3394] J. Schaad and R. Housley, "Advanced Encryption Standard
(AES) Key Wrap Algorithm", RFC 3394, September 2002.
8. Authors' Address
Shiho Moriai
Sony Computer Entertainment Inc.
Phone: +81-3-6438-7523
FAX: +81-3-6438-8629
Email: camellia@isl.ntt.co.jp (Camellia team)
shiho@rd.scei.sony.co.jp (Shiho Moriai)
Akihiro Kato
NTT Software Corporation
Phone: +81-45-212-7404
FAX: +81-45-212-7410
Email: akato@po.ntts.co.jp
Appendix A ASN.1 Module Appendix A ASN.1 Module
CamelliaEncryptionAlgorithmInCMS CamelliaEncryptionAlgorithmInCMS
{ iso(1) member-body(2) us(840) rsadsi(113549) pkcs(1) { iso(1) member-body(2) us(840) rsadsi(113549) pkcs(1)
pkcs9(9) smime(16) modules(0) id-mod-cms-camellia(23) } pkcs9(9) smime(16) modules(0) id-mod-cms-camellia(23) }
DEFINITIONS IMPLICIT TAGS ::= DEFINITIONS IMPLICIT TAGS ::=
BEGIN BEGIN
-- Camellia using CBC-chaining mode for key sizes of 128, 192, 256 -- Camellia using CBC-chaining mode for key sizes of 128, 192, 256
skipping to change at page 11, line 36 skipping to change at page 12, line 31
id-camellia192-cbc OBJECT IDENTIFIER ::= id-camellia192-cbc OBJECT IDENTIFIER ::=
{ iso(1) member-body(2) 392 200011 61 security(1) { iso(1) member-body(2) 392 200011 61 security(1)
algorithm(1) symmetric-encryption-algorithm(1) algorithm(1) symmetric-encryption-algorithm(1)
camellia192-cbc(3) } camellia192-cbc(3) }
id-camellia256-cbc OBJECT IDENTIFIER ::= id-camellia256-cbc OBJECT IDENTIFIER ::=
{ iso(1) member-body(2) 392 200011 61 security(1) { iso(1) member-body(2) 392 200011 61 security(1)
algorithm(1) symmetric-encryption-algorithm(1) algorithm(1) symmetric-encryption-algorithm(1)
camellia256-cbc(4) } camellia256-cbc(4) }
-- Camellia-IV is the parameter for all the above object identifiers.
Camellia-IV ::= OCTET STRING (SIZE(16)) Camellia-IV ::= OCTET STRING (SIZE(16))
-- Camellia S/MIME Capabilty parameter for all the above object -- Camellia S/MIME Capabilty parameter for all the above object
-- identifiers. -- identifiers.
CamelliaSMimeCapability ::= NULL CamelliaSMimeCapability ::= NULL
-- Camellia Key Wrap Algorithm identifiers - Parameter is absent. -- Camellia Key Wrap Algorithm identifiers - Parameter is absent.
skipping to change at line 594 skipping to change at page 13, line 11
{ iso(1) member-body(2) 392 200011 61 security(1) { iso(1) member-body(2) 392 200011 61 security(1)
algorithm(1) key-wrap-algorithm(3) algorithm(1) key-wrap-algorithm(3)
camellia192-wrap(3) } camellia192-wrap(3) }
id-camellia256-wrap OBJECT IDENTIFIER ::= id-camellia256-wrap OBJECT IDENTIFIER ::=
{ iso(1) member-body(2) 392 200011 61 security(1) { iso(1) member-body(2) 392 200011 61 security(1)
algorithm(1) key-wrap-algorithm(3) algorithm(1) key-wrap-algorithm(3)
camellia256-wrap(4) } camellia256-wrap(4) }
END END
Authors' Addresses
Shiho Moriai
Sony Computer Entertainment Inc.
Phone: +81-3-6438-7523
Fax: +81-3-6438-8629
EMail: camellia@isl.ntt.co.jp (Camellia team)
shiho@rd.scei.sony.co.jp (Shiho Moriai)
Akihiro Kato
NTT Software Corporation
Phone: +81-45-212-7934
Fax: +81-45-212-9800
EMail: akato@po.ntts.co.jp
Full Copyright Statement
Copyright (C) The Internet Society (2004). All Rights Reserved.
This document and translations of it may be copied and furnished to
others, and derivative works that comment on or otherwise explain it
or assist in its implementation may be prepared, copied, published
and distributed, in whole or in part, without restriction of any
kind, provided that the above copyright notice and this paragraph are
included on all such copies and derivative works. However, this
document itself may not be modified in any way, such as by removing
the copyright notice or references to the Internet Society or other
Internet organizations, except as needed for the purpose of
developing Internet standards in which case the procedures for
copyrights defined in the Internet Standards process must be
followed, or as required to translate it into languages other than
English.
The limited permissions granted above are perpetual and will not be
revoked by the Internet Society or its successors or assignees.
This document and the information contained herein is provided on an
"AS IS" basis and THE INTERNET SOCIETY AND THE INTERNET ENGINEERING
TASK FORCE DISCLAIMS 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.
Acknowledgement
Funding for the RFC Editor function is currently provided by the
Internet Society.
 End of changes. 

This html diff was produced by rfcdiff 1.25, available from http://www.levkowetz.com/ietf/tools/rfcdiff/