| 1 | .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05) |
| 2 | .\" |
| 3 | .\" Standard preamble: |
| 4 | .\" ======================================================================== |
| 5 | .de Sh \" Subsection heading |
| 6 | .br |
| 7 | .if t .Sp |
| 8 | .ne 5 |
| 9 | .PP |
| 10 | \fB\\$1\fR |
| 11 | .PP |
| 12 | .. |
| 13 | .de Sp \" Vertical space (when we can't use .PP) |
| 14 | .if t .sp .5v |
| 15 | .if n .sp |
| 16 | .. |
| 17 | .de Vb \" Begin verbatim text |
| 18 | .ft CW |
| 19 | .nf |
| 20 | .ne \\$1 |
| 21 | .. |
| 22 | .de Ve \" End verbatim text |
| 23 | .ft R |
| 24 | .fi |
| 25 | .. |
| 26 | .\" Set up some character translations and predefined strings. \*(-- will |
| 27 | .\" give an unbreakable dash, \*(PI will give pi, \*(L" will give a left |
| 28 | .\" double quote, and \*(R" will give a right double quote. \*(C+ will |
| 29 | .\" give a nicer C++. Capital omega is used to do unbreakable dashes and |
| 30 | .\" therefore won't be available. \*(C` and \*(C' expand to `' in nroff, |
| 31 | .\" nothing in troff, for use with C<>. |
| 32 | .tr \(*W- |
| 33 | .ds C+ C\v'-.1v'\h'-1p'\s-2+\h'-1p'+\s0\v'.1v'\h'-1p' |
| 34 | .ie n \{\ |
| 35 | . ds -- \(*W- |
| 36 | . ds PI pi |
| 37 | . if (\n(.H=4u)&(1m=24u) .ds -- \(*W\h'-12u'\(*W\h'-12u'-\" diablo 10 pitch |
| 38 | . if (\n(.H=4u)&(1m=20u) .ds -- \(*W\h'-12u'\(*W\h'-8u'-\" diablo 12 pitch |
| 39 | . ds L" "" |
| 40 | . ds R" "" |
| 41 | . ds C` "" |
| 42 | . ds C' "" |
| 43 | 'br\} |
| 44 | .el\{\ |
| 45 | . ds -- \|\(em\| |
| 46 | . ds PI \(*p |
| 47 | . ds L" `` |
| 48 | . ds R" '' |
| 49 | 'br\} |
| 50 | .\" |
| 51 | .\" Escape single quotes in literal strings from groff's Unicode transform. |
| 52 | .ie \n(.g .ds Aq \(aq |
| 53 | .el .ds Aq ' |
| 54 | .\" |
| 55 | .\" If the F register is turned on, we'll generate index entries on stderr for |
| 56 | .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index |
| 57 | .\" entries marked with X<> in POD. Of course, you'll have to process the |
| 58 | .\" output yourself in some meaningful fashion. |
| 59 | .ie \nF \{\ |
| 60 | . de IX |
| 61 | . tm Index:\\$1\t\\n%\t"\\$2" |
| 62 | .. |
| 63 | . nr % 0 |
| 64 | . rr F |
| 65 | .\} |
| 66 | .el \{\ |
| 67 | . de IX |
| 68 | .. |
| 69 | .\} |
| 70 | .\" |
| 71 | .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2). |
| 72 | .\" Fear. Run. Save yourself. No user-serviceable parts. |
| 73 | . \" fudge factors for nroff and troff |
| 74 | .if n \{\ |
| 75 | . ds #H 0 |
| 76 | . ds #V .8m |
| 77 | . ds #F .3m |
| 78 | . ds #[ \f1 |
| 79 | . ds #] \fP |
| 80 | .\} |
| 81 | .if t \{\ |
| 82 | . ds #H ((1u-(\\\\n(.fu%2u))*.13m) |
| 83 | . ds #V .6m |
| 84 | . ds #F 0 |
| 85 | . ds #[ \& |
| 86 | . ds #] \& |
| 87 | .\} |
| 88 | . \" simple accents for nroff and troff |
| 89 | .if n \{\ |
| 90 | . ds ' \& |
| 91 | . ds ` \& |
| 92 | . ds ^ \& |
| 93 | . ds , \& |
| 94 | . ds ~ ~ |
| 95 | . ds / |
| 96 | .\} |
| 97 | .if t \{\ |
| 98 | . ds ' \\k:\h'-(\\n(.wu*8/10-\*(#H)'\'\h"|\\n:u" |
| 99 | . ds ` \\k:\h'-(\\n(.wu*8/10-\*(#H)'\`\h'|\\n:u' |
| 100 | . ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'^\h'|\\n:u' |
| 101 | . ds , \\k:\h'-(\\n(.wu*8/10)',\h'|\\n:u' |
| 102 | . ds ~ \\k:\h'-(\\n(.wu-\*(#H-.1m)'~\h'|\\n:u' |
| 103 | . ds / \\k:\h'-(\\n(.wu*8/10-\*(#H)'\z\(sl\h'|\\n:u' |
| 104 | .\} |
| 105 | . \" troff and (daisy-wheel) nroff accents |
| 106 | .ds : \\k:\h'-(\\n(.wu*8/10-\*(#H+.1m+\*(#F)'\v'-\*(#V'\z.\h'.2m+\*(#F'.\h'|\\n:u'\v'\*(#V' |
| 107 | .ds 8 \h'\*(#H'\(*b\h'-\*(#H' |
| 108 | .ds o \\k:\h'-(\\n(.wu+\w'\(de'u-\*(#H)/2u'\v'-.3n'\*(#[\z\(de\v'.3n'\h'|\\n:u'\*(#] |
| 109 | .ds d- \h'\*(#H'\(pd\h'-\w'~'u'\v'-.25m'\f2\(hy\fP\v'.25m'\h'-\*(#H' |
| 110 | .ds D- D\\k:\h'-\w'D'u'\v'-.11m'\z\(hy\v'.11m'\h'|\\n:u' |
| 111 | .ds th \*(#[\v'.3m'\s+1I\s-1\v'-.3m'\h'-(\w'I'u*2/3)'\s-1o\s+1\*(#] |
| 112 | .ds Th \*(#[\s+2I\s-2\h'-\w'I'u*3/5'\v'-.3m'o\v'.3m'\*(#] |
| 113 | .ds ae a\h'-(\w'a'u*4/10)'e |
| 114 | .ds Ae A\h'-(\w'A'u*4/10)'E |
| 115 | . \" corrections for vroff |
| 116 | .if v .ds ~ \\k:\h'-(\\n(.wu*9/10-\*(#H)'\s-2\u~\d\s+2\h'|\\n:u' |
| 117 | .if v .ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'\v'-.4m'^\v'.4m'\h'|\\n:u' |
| 118 | . \" for low resolution devices (crt and lpr) |
| 119 | .if \n(.H>23 .if \n(.V>19 \ |
| 120 | \{\ |
| 121 | . ds : e |
| 122 | . ds 8 ss |
| 123 | . ds o a |
| 124 | . ds d- d\h'-1'\(ga |
| 125 | . ds D- D\h'-1'\(hy |
| 126 | . ds th \o'bp' |
| 127 | . ds Th \o'LP' |
| 128 | . ds ae ae |
| 129 | . ds Ae AE |
| 130 | .\} |
| 131 | .rm #[ #] #H #V #F C |
| 132 | .\" ======================================================================== |
| 133 | .\" |
| 134 | .IX Title "DES_MODES 7" |
| 135 | .TH DES_MODES 7 "2009-01-11" "0.9.8j" "OpenSSL" |
| 136 | .\" For nroff, turn off justification. Always turn off hyphenation; it makes |
| 137 | .\" way too many mistakes in technical documents. |
| 138 | .if n .ad l |
| 139 | .nh |
| 140 | .SH "NAME" |
| 141 | des_modes \- the variants of DES and other crypto algorithms of OpenSSL |
| 142 | .SH "DESCRIPTION" |
| 143 | .IX Header "DESCRIPTION" |
| 144 | Several crypto algorithms for OpenSSL can be used in a number of modes. Those |
| 145 | are used for using block ciphers in a way similar to stream ciphers, among |
| 146 | other things. |
| 147 | .SH "OVERVIEW" |
| 148 | .IX Header "OVERVIEW" |
| 149 | .Sh "Electronic Codebook Mode (\s-1ECB\s0)" |
| 150 | .IX Subsection "Electronic Codebook Mode (ECB)" |
| 151 | Normally, this is found as the function \fIalgorithm\fR\fI_ecb_encrypt()\fR. |
| 152 | .IP "\(bu" 2 |
| 153 | 64 bits are enciphered at a time. |
| 154 | .IP "\(bu" 2 |
| 155 | The order of the blocks can be rearranged without detection. |
| 156 | .IP "\(bu" 2 |
| 157 | The same plaintext block always produces the same ciphertext block |
| 158 | (for the same key) making it vulnerable to a 'dictionary attack'. |
| 159 | .IP "\(bu" 2 |
| 160 | An error will only affect one ciphertext block. |
| 161 | .Sh "Cipher Block Chaining Mode (\s-1CBC\s0)" |
| 162 | .IX Subsection "Cipher Block Chaining Mode (CBC)" |
| 163 | Normally, this is found as the function \fIalgorithm\fR\fI_cbc_encrypt()\fR. |
| 164 | Be aware that \fIdes_cbc_encrypt()\fR is not really \s-1DES\s0 \s-1CBC\s0 (it does |
| 165 | not update the \s-1IV\s0); use \fIdes_ncbc_encrypt()\fR instead. |
| 166 | .IP "\(bu" 2 |
| 167 | a multiple of 64 bits are enciphered at a time. |
| 168 | .IP "\(bu" 2 |
| 169 | The \s-1CBC\s0 mode produces the same ciphertext whenever the same |
| 170 | plaintext is encrypted using the same key and starting variable. |
| 171 | .IP "\(bu" 2 |
| 172 | The chaining operation makes the ciphertext blocks dependent on the |
| 173 | current and all preceding plaintext blocks and therefore blocks can not |
| 174 | be rearranged. |
| 175 | .IP "\(bu" 2 |
| 176 | The use of different starting variables prevents the same plaintext |
| 177 | enciphering to the same ciphertext. |
| 178 | .IP "\(bu" 2 |
| 179 | An error will affect the current and the following ciphertext blocks. |
| 180 | .Sh "Cipher Feedback Mode (\s-1CFB\s0)" |
| 181 | .IX Subsection "Cipher Feedback Mode (CFB)" |
| 182 | Normally, this is found as the function \fIalgorithm\fR\fI_cfb_encrypt()\fR. |
| 183 | .IP "\(bu" 2 |
| 184 | a number of bits (j) <= 64 are enciphered at a time. |
| 185 | .IP "\(bu" 2 |
| 186 | The \s-1CFB\s0 mode produces the same ciphertext whenever the same |
| 187 | plaintext is encrypted using the same key and starting variable. |
| 188 | .IP "\(bu" 2 |
| 189 | The chaining operation makes the ciphertext variables dependent on the |
| 190 | current and all preceding variables and therefore j\-bit variables are |
| 191 | chained together and can not be rearranged. |
| 192 | .IP "\(bu" 2 |
| 193 | The use of different starting variables prevents the same plaintext |
| 194 | enciphering to the same ciphertext. |
| 195 | .IP "\(bu" 2 |
| 196 | The strength of the \s-1CFB\s0 mode depends on the size of k (maximal if |
| 197 | j == k). In my implementation this is always the case. |
| 198 | .IP "\(bu" 2 |
| 199 | Selection of a small value for j will require more cycles through |
| 200 | the encipherment algorithm per unit of plaintext and thus cause |
| 201 | greater processing overheads. |
| 202 | .IP "\(bu" 2 |
| 203 | Only multiples of j bits can be enciphered. |
| 204 | .IP "\(bu" 2 |
| 205 | An error will affect the current and the following ciphertext variables. |
| 206 | .Sh "Output Feedback Mode (\s-1OFB\s0)" |
| 207 | .IX Subsection "Output Feedback Mode (OFB)" |
| 208 | Normally, this is found as the function \fIalgorithm\fR\fI_ofb_encrypt()\fR. |
| 209 | .IP "\(bu" 2 |
| 210 | a number of bits (j) <= 64 are enciphered at a time. |
| 211 | .IP "\(bu" 2 |
| 212 | The \s-1OFB\s0 mode produces the same ciphertext whenever the same |
| 213 | plaintext enciphered using the same key and starting variable. More |
| 214 | over, in the \s-1OFB\s0 mode the same key stream is produced when the same |
| 215 | key and start variable are used. Consequently, for security reasons |
| 216 | a specific start variable should be used only once for a given key. |
| 217 | .IP "\(bu" 2 |
| 218 | The absence of chaining makes the \s-1OFB\s0 more vulnerable to specific attacks. |
| 219 | .IP "\(bu" 2 |
| 220 | The use of different start variables values prevents the same |
| 221 | plaintext enciphering to the same ciphertext, by producing different |
| 222 | key streams. |
| 223 | .IP "\(bu" 2 |
| 224 | Selection of a small value for j will require more cycles through |
| 225 | the encipherment algorithm per unit of plaintext and thus cause |
| 226 | greater processing overheads. |
| 227 | .IP "\(bu" 2 |
| 228 | Only multiples of j bits can be enciphered. |
| 229 | .IP "\(bu" 2 |
| 230 | \&\s-1OFB\s0 mode of operation does not extend ciphertext errors in the |
| 231 | resultant plaintext output. Every bit error in the ciphertext causes |
| 232 | only one bit to be in error in the deciphered plaintext. |
| 233 | .IP "\(bu" 2 |
| 234 | \&\s-1OFB\s0 mode is not self-synchronizing. If the two operation of |
| 235 | encipherment and decipherment get out of synchronism, the system needs |
| 236 | to be re-initialized. |
| 237 | .IP "\(bu" 2 |
| 238 | Each re-initialization should use a value of the start variable |
| 239 | different from the start variable values used before with the same |
| 240 | key. The reason for this is that an identical bit stream would be |
| 241 | produced each time from the same parameters. This would be |
| 242 | susceptible to a 'known plaintext' attack. |
| 243 | .Sh "Triple \s-1ECB\s0 Mode" |
| 244 | .IX Subsection "Triple ECB Mode" |
| 245 | Normally, this is found as the function \fIalgorithm\fR\fI_ecb3_encrypt()\fR. |
| 246 | .IP "\(bu" 2 |
| 247 | Encrypt with key1, decrypt with key2 and encrypt with key3 again. |
| 248 | .IP "\(bu" 2 |
| 249 | As for \s-1ECB\s0 encryption but increases the key length to 168 bits. |
| 250 | There are theoretic attacks that can be used that make the effective |
| 251 | key length 112 bits, but this attack also requires 2^56 blocks of |
| 252 | memory, not very likely, even for the \s-1NSA\s0. |
| 253 | .IP "\(bu" 2 |
| 254 | If both keys are the same it is equivalent to encrypting once with |
| 255 | just one key. |
| 256 | .IP "\(bu" 2 |
| 257 | If the first and last key are the same, the key length is 112 bits. |
| 258 | There are attacks that could reduce the effective key strength |
| 259 | to only slightly more than 56 bits, but these require a lot of memory. |
| 260 | .IP "\(bu" 2 |
| 261 | If all 3 keys are the same, this is effectively the same as normal |
| 262 | ecb mode. |
| 263 | .Sh "Triple \s-1CBC\s0 Mode" |
| 264 | .IX Subsection "Triple CBC Mode" |
| 265 | Normally, this is found as the function \fIalgorithm\fR\fI_ede3_cbc_encrypt()\fR. |
| 266 | .IP "\(bu" 2 |
| 267 | Encrypt with key1, decrypt with key2 and then encrypt with key3. |
| 268 | .IP "\(bu" 2 |
| 269 | As for \s-1CBC\s0 encryption but increases the key length to 168 bits with |
| 270 | the same restrictions as for triple ecb mode. |
| 271 | .SH "NOTES" |
| 272 | .IX Header "NOTES" |
| 273 | This text was been written in large parts by Eric Young in his original |
| 274 | documentation for SSLeay, the predecessor of OpenSSL. In turn, he attributed |
| 275 | it to: |
| 276 | .PP |
| 277 | .Vb 5 |
| 278 | \& AS 2805.5.2 |
| 279 | \& Australian Standard |
| 280 | \& Electronic funds transfer \- Requirements for interfaces, |
| 281 | \& Part 5.2: Modes of operation for an n\-bit block cipher algorithm |
| 282 | \& Appendix A |
| 283 | .Ve |
| 284 | .SH "SEE ALSO" |
| 285 | .IX Header "SEE ALSO" |
| 286 | \&\fIblowfish\fR\|(3), \fIdes\fR\|(3), \fIidea\fR\|(3), |
| 287 | \&\fIrc2\fR\|(3) |