idnits 2.17.1 draft-seokung-avt-seed-srtp-00.txt: Checking boilerplate required by RFC 5378 and the IETF Trust (see https://trustee.ietf.org/license-info): ---------------------------------------------------------------------------- ** It looks like you're using RFC 3978 boilerplate. You should update this to the boilerplate described in the IETF Trust License Policy document (see https://trustee.ietf.org/license-info), which is required now. -- Found old boilerplate from RFC 3978, Section 5.1 on line 17. -- Found old boilerplate from RFC 3978, Section 5.5, updated by RFC 4748 on line 231. -- Found old boilerplate from RFC 3979, Section 5, paragraph 1 on line 208. -- Found old boilerplate from RFC 3979, Section 5, paragraph 2 on line 215. -- Found old boilerplate from RFC 3979, Section 5, paragraph 3 on line 221. Checking nits according to https://www.ietf.org/id-info/1id-guidelines.txt: ---------------------------------------------------------------------------- == No 'Intended status' indicated for this document; assuming Proposed Standard Checking nits according to https://www.ietf.org/id-info/checklist : ---------------------------------------------------------------------------- ** The abstract seems to contain references ([3]), which it shouldn't. Please replace those with straight textual mentions of the documents in question. Miscellaneous warnings: ---------------------------------------------------------------------------- == The copyright year in the IETF Trust Copyright Line does not match the current year -- The document seems to lack a disclaimer for pre-RFC5378 work, but may have content which was first submitted before 10 November 2008. If you have contacted all the original authors and they are all willing to grant the BCP78 rights to the IETF Trust, then this is fine, and you can ignore this comment. If not, you may need to add the pre-RFC5378 disclaimer. (See the Legal Provisions document at https://trustee.ietf.org/license-info for more information.) -- The document date (July 2, 2007) is 6143 days in the past. Is this intentional? Checking references for intended status: Proposed Standard ---------------------------------------------------------------------------- (See RFCs 3967 and 4897 for information about using normative references to lower-maturity documents in RFCs) -- Possible downref: Non-RFC (?) normative reference: ref. '2' Summary: 2 errors (**), 0 flaws (~~), 2 warnings (==), 8 comments (--). Run idnits with the --verbose option for more detailed information about the items above. -------------------------------------------------------------------------------- 1 AVT Working Group Seokung Yoon 2 Internet Draft Joongman Kim 3 Expires: January 2008 Yoojae Won 4 Korea Information Security Agency 5 July 2, 2007 7 The SEED Cipher Algorithm and Its Use with the Secure Real-time 8 Transport Protocol (SRTP) 9 draft-seokung-avt-seed-srtp-00.txt 11 Status of this Memo 13 By submitting this Internet-Draft, each author represents that 14 any applicable patent or other IPR claims of which he or she is 15 aware have been or will be disclosed, and any of which he or she 16 becomes aware will be disclosed, in accordance with Section 6 of 17 BCP 79. 19 Internet-Drafts are working documents of the Internet Engineering 20 Task Force (IETF), its areas, and its working groups. Note that 21 other groups may also distribute working documents as Internet- 22 Drafts. 24 Internet-Drafts are draft documents valid for a maximum of six months 25 and may be updated, replaced, or obsoleted by other documents at any 26 time. It is inappropriate to use Internet-Drafts as reference 27 material or to cite them other than as "work in progress." 29 The list of current Internet-Drafts can be accessed at 30 http://www.ietf.org/ietf/1id-abstracts.txt 32 The list of Internet-Draft Shadow Directories can be accessed at 33 http://www.ietf.org/shadow.html 35 This Internet-Draft will expire on January 2, 2008. 37 Copyright Notice 39 Copyright (C) The IETF Trust (2007). 41 Abstract 43 This document describes the use of SEED block cipher algorithm in the 44 Secure Real-time Transport Protocol [3] for confidentiality to the 45 RTP traffic and to the control traffic for RTP, the Real-time 46 Transport Control Protocol (RTCP). 48 Table of Contents 50 1. Introduction..................................................2 51 1.1. SEED.....................................................2 52 1.2. Terminology..............................................3 53 2. The SEED Cipher Algorithm.....................................3 54 2.1. Mode.....................................................3 55 2.2. Key Size and Number of Rounds............................3 56 2.3. Block Size and Padding...................................3 57 2.4. Performance..............................................3 58 3. Security Considerations.......................................3 59 4. IANA Considerations...........................................4 60 5. References....................................................4 61 5.1. Normative References.....................................4 62 5.2. Informative References...................................4 63 Author's Addresses...............................................5 64 Intellectual Property Statement..................................5 65 Disclaimer of Validity...........................................6 67 1. Introduction 69 1.1. SEED 71 SEED [2] is a national industrial association standard [7] and is 72 widely used in South Korea for electronic commerce and financial 73 services that are operated on wired and wireless communications. 75 SEED is a 128-bit symmetric key block cipher that had been developed 76 by KISA(Korea Information Security Agency) and a group of experts 77 since 1998. The input/output block size of SEED is 128-bit and the 78 key length is also 128-bit. SEED has the 16-round Feistel structure. 79 A 128-bit input is divided into two 64-bit blocks and the right 64- 80 bit block is an input to the round function with a 64-bit subkey 81 generated from the key scheduling. 83 SEED is easily implemented in various software and hardware because 84 it is designed to increase the efficiency of memory storage and the 85 simplicity in generating keys without degrading the security of the 86 algorithm. In particular, it can be effectively adapted to a 87 computing environment with restricted resources such as mobile 88 devices, smart cards and so on. 90 1.2. Terminology 92 The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", 93 "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this 94 document are to be interpreted as described in RFC-2119 [1]. 96 2. The SEED Cipher Algorithm 98 The algorithm specification and object identifiers are described in 99 [5] [3]. The SEED homepage, http://www.kisa.or.kr/seed/seed_eng.html, 100 contains a wealth of information about SEED, including a detailed 101 specification, evaluation report, test vectors, and so on. 103 2.1. Mode 105 This document specifies the use of the SEED cipher in the CBC (Cipher 106 Block Chaining) mode. This mode requires an Initialization Vector IV) 107 that is the same size as the block size. The IV MUST be chosen at 108 random and MUST be unpredictable. 110 2.2. Key Size and Number of Rounds 112 SEED supports 128-bit key and has the 16-round Feistel structure. 114 2.3. Block Size and Padding 116 SEED uses a block size of 16 octets (128 bits). 118 Padding is required by SEED to maintain a 16-octet (128-bit) 119 blocksize. Padding must be added such that the data to be encrypted 120 has a length that is a multiple of 16 octets. 122 2.4. Performance 124 Performance figures of SEED are available at 125 http://www.kisa.or.kr/seed/seed_eng.html. 127 3. Security Considerations 129 No security problem has been found on SEED. SEED is secure against 130 all known attacks including Differential cryptanalysis, linear 131 cryptanalysis, and related key attacks. The best known attack is only 132 an exhaustive search for the key (by [4]). For further security 133 considerations, the reader is encouraged to read [4], [5], and [6]. 135 4. IANA Considerations 137 5. References 139 5.1. Normative References 141 [1] Bradner, S., "Key words for use in RFCs to Indicate Requirement 142 Levels", BCP 14, RFC 2119, March 1997. 144 [2] KISA, "SEED Algorithm Specification", 145 http://www.kisa.or.kr/seed/seed_eng.html. 147 [3] M. Baugher, D. McGrew, M. Naslund, E.Carrara, K. Norrman, 148 "The Secure Real-time Transport Protocol (SRTP)", 149 RFC 3711, March 2004. 151 5.2. Informative References 153 [4] Information-technology Promotion Agency (IPA), Japan, CRYPTREC. 154 "SEED Evaluation Report", February, 2002 155 http://www.kisa.or.kr/seed/seed_eng.html. 157 [5] ISO/IEC JTC 1/SC 27, "National Body contributions on NP 18033 158 "Encryption Algorithms" in Response to SC 27 N2563 (ATT.3 Korea 159 Contribution)", ISO/IEC JTC 1/SC 27 N2656r1 (n2656_3.zip), 160 October, 2000. 162 [6] KISA, "Self Evaluation Report", 163 http://www.kisa.or.kr/seed/seed_eng.html. 165 [7] Telecommunications Technology Association (TTA), South Korea, 166 "128-bit Symmetric Block Cipher (SEED)", TTAS.KO-12.0004, 167 September, 1998 (In Korean) 168 http://www.tta.or.kr/English/new/main/index.htm. 170 Author's Addresses 172 Seokung Yoon 173 Korea Information Security Agency 174 78, Karak-dong, Songpa-Gu 175 Seoul 138-160 176 KOREA 177 Phone: +82-2-405-5361 178 FAX : +82-2-405-5319 179 Email: seokung@kisa.or.kr 181 Joongman Kim 182 Korea Information Security Agency 183 78, Karak-dong, Songpa-Gu 184 Seoul 138-160 185 KOREA 186 Phone: +82-2-405-5314 187 FAX : +82-2-405-5319 188 Email: seopo@kisa.or.kr 190 Yoojae Won 191 Korea Information Security Agency 192 78, Karak-dong, Songpa-Gu 193 Seoul 138-160 194 KOREA 195 Phone: +82-2-405-5360 196 FAX : +82-2-405-5319 197 Email: yjwon@kisa.or.kr 199 Intellectual Property Statement 201 The IETF takes no position regarding the validity or scope of any 202 Intellectual Property Rights or other rights that might be claimed to 203 pertain to the implementation or use of the technology described in 204 this document or the extent to which any license under such rights 205 might or might not be available; nor does it represent that it has 206 made any independent effort to identify any such rights. Information 207 on the procedures with respect to rights in RFC documents can be 208 found in BCP 78 and BCP 79. 210 Copies of IPR disclosures made to the IETF Secretariat and any 211 assurances of licenses to be made available, or the result of an 212 attempt made to obtain a general license or permission for the use of 213 such proprietary rights by implementers or users of this 214 specification can be obtained from the IETF on-line IPR repository at 215 http://www.ietf.org/ipr. 217 The IETF invites any interested party to bring to its attention any 218 copyrights, patents or patent applications, or other proprietary 219 rights that may cover technology that may be required to implement 220 this standard. Please address the information to the IETF at 221 ietf-ipr@ietf.org. 223 Disclaimer of Validity 225 This document and the information contained herein are provided on an 226 "AS IS" basis and THE CONTRIBUTOR, THE ORGANIZATION HE/SHE REPRESENTS 227 OR IS SPONSORED BY (IF ANY), THE INTERNET SOCIETY, THE IETF TRUST AND 228 THE INTERNET ENGINEERING TASK FORCE DISCLAIM ALL WARRANTIES, EXPRESS 229 OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF 230 THE INFORMATION HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED 231 WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. 233 Copyright Statement 235 Copyright (C) The IETF Trust (2007). 237 This document is subject to the rights, licenses and restrictions 238 contained in BCP 78, and except as set forth therein, the authors 239 retain all their rights. 241 Acknowledgment 243 Funding for the RFC Editor function is currently provided by the 244 Internet Society.