des_8cpp-source.html

著名的密码库Crypto++的文档 C++语言的杰作。程序员必备。

<a name="l00139"></a>00139 <span class="keyword">static</span> byte ip[] = {
<a name="l00140"></a>00140            58, 50, 42, 34, 26, 18, 10,  2,
<a name="l00141"></a>00141            60, 52, 44, 36, 28, 20, 12,  4,
<a name="l00142"></a>00142            62, 54, 46, 38, 30, 22, 14,  6,
<a name="l00143"></a>00143            64, 56, 48, 40, 32, 24, 16,  8,
<a name="l00144"></a>00144            57, 49, 41, 33, 25, 17,  9,  1,
<a name="l00145"></a>00145            59, 51, 43, 35, 27, 19, 11,  3,
<a name="l00146"></a>00146            61, 53, 45, 37, 29, 21, 13,  5,
<a name="l00147"></a>00147            63, 55, 47, 39, 31, 23, 15,  7
<a name="l00148"></a>00148 };
<a name="l00149"></a>00149 
<a name="l00150"></a>00150 <span class="comment">/* final permutation IP^-1 */</span>
<a name="l00151"></a>00151 <span class="keyword">static</span> byte fp[] = {
<a name="l00152"></a>00152            40,  8, 48, 16, 56, 24, 64, 32,
<a name="l00153"></a>00153            39,  7, 47, 15, 55, 23, 63, 31,
<a name="l00154"></a>00154            38,  6, 46, 14, 54, 22, 62, 30,
<a name="l00155"></a>00155            37,  5, 45, 13, 53, 21, 61, 29,
<a name="l00156"></a>00156            36,  4, 44, 12, 52, 20, 60, 28,
<a name="l00157"></a>00157            35,  3, 43, 11, 51, 19, 59, 27,
<a name="l00158"></a>00158            34,  2, 42, 10, 50, 18, 58, 26,
<a name="l00159"></a>00159            33,  1, 41,  9, 49, 17, 57, 25
<a name="l00160"></a>00160 };
<a name="l00161"></a>00161 <span class="comment">/* expansion operation matrix */</span>
<a name="l00162"></a>00162 <span class="keyword">static</span> byte ei[] = {
<a name="l00163"></a>00163            32,  1,  2,  3,  4,  5,
<a name="l00164"></a>00164                 4,  5,  6,  7,  8,  9,
<a name="l00165"></a>00165                 8,  9, 10, 11, 12, 13,
<a name="l00166"></a>00166            12, 13, 14, 15, 16, 17,
<a name="l00167"></a>00167            16, 17, 18, 19, 20, 21,
<a name="l00168"></a>00168            20, 21, 22, 23, 24, 25,
<a name="l00169"></a>00169            24, 25, 26, 27, 28, 29,
<a name="l00170"></a>00170            28, 29, 30, 31, 32,  1
<a name="l00171"></a>00171 };
<a name="l00172"></a>00172 <span class="comment">/* The (in)famous S-boxes */</span>
<a name="l00173"></a>00173 <span class="keyword">static</span> byte sbox[8][64] = {
<a name="l00174"></a>00174            <span class="comment">/* S1 */</span>
<a name="l00175"></a>00175            14,  4, 13,  1,  2, 15, 11,  8,  3, 10,  6, 12,  5,  9,  0,  7,
<a name="l00176"></a>00176                 0, 15,  7,  4, 14,  2, 13,  1, 10,  6, 12, 11,  9,  5,  3,  8,
<a name="l00177"></a>00177                 4,  1, 14,  8, 13,  6,  2, 11, 15, 12,  9,  7,  3, 10,  5,  0,
<a name="l00178"></a>00178            15, 12,  8,  2,  4,  9,  1,  7,  5, 11,  3, 14, 10,  0,  6, 13,
<a name="l00179"></a>00179 
<a name="l00180"></a>00180            <span class="comment">/* S2 */</span>
<a name="l00181"></a>00181            15,  1,  8, 14,  6, 11,  3,  4,  9,  7,  2, 13, 12,  0,  5, 10,
<a name="l00182"></a>00182                 3, 13,  4,  7, 15,  2,  8, 14, 12,  0,  1, 10,  6,  9, 11,  5,
<a name="l00183"></a>00183                 0, 14,  7, 11, 10,  4, 13,  1,  5,  8, 12,  6,  9,  3,  2, 15,
<a name="l00184"></a>00184            13,  8, 10,  1,  3, 15,  4,  2, 11,  6,  7, 12,  0,  5, 14,  9,
<a name="l00185"></a>00185 
<a name="l00186"></a>00186            <span class="comment">/* S3 */</span>
<a name="l00187"></a>00187            10,  0,  9, 14,  6,  3, 15,  5,  1, 13, 12,  7, 11,  4,  2,  8,
<a name="l00188"></a>00188            13,  7,  0,  9,  3,  4,  6, 10,  2,  8,  5, 14, 12, 11, 15,  1,
<a name="l00189"></a>00189            13,  6,  4,  9,  8, 15,  3,  0, 11,  1,  2, 12,  5, 10, 14,  7,
<a name="l00190"></a>00190                 1, 10, 13,  0,  6,  9,  8,  7,  4, 15, 14,  3, 11,  5,  2, 12,
<a name="l00191"></a>00191 
<a name="l00192"></a>00192            <span class="comment">/* S4 */</span>
<a name="l00193"></a>00193                 7, 13, 14,  3,  0,  6,  9, 10,  1,  2,  8,  5, 11, 12,  4, 15,
<a name="l00194"></a>00194            13,  8, 11,  5,  6, 15,  0,  3,  4,  7,  2, 12,  1, 10, 14,  9,
<a name="l00195"></a>00195            10,  6,  9,  0, 12, 11,  7, 13, 15,  1,  3, 14,  5,  2,  8,  4,
<a name="l00196"></a>00196                 3, 15,  0,  6, 10,  1, 13,  8,  9,  4,  5, 11, 12,  7,  2, 14,
<a name="l00197"></a>00197 
<a name="l00198"></a>00198            <span class="comment">/* S5 */</span>
<a name="l00199"></a>00199                 2, 12,  4,  1,  7, 10, 11,  6,  8,  5,  3, 15, 13,  0, 14,  9,
<a name="l00200"></a>00200            14, 11,  2, 12,  4,  7, 13,  1,  5,  0, 15, 10,  3,  9,  8,  6,
<a name="l00201"></a>00201                 4,  2,  1, 11, 10, 13,  7,  8, 15,  9, 12,  5,  6,  3,  0, 14,
<a name="l00202"></a>00202            11,  8, 12,  7,  1, 14,  2, 13,  6, 15,  0,  9, 10,  4,  5,  3,
<a name="l00203"></a>00203 
<a name="l00204"></a>00204            <span class="comment">/* S6 */</span>
<a name="l00205"></a>00205            12,  1, 10, 15,  9,  2,  6,  8,  0, 13,  3,  4, 14,  7,  5, 11,
<a name="l00206"></a>00206            10, 15,  4,  2,  7, 12,  9,  5,  6,  1, 13, 14,  0, 11,  3,  8,
<a name="l00207"></a>00207                 9, 14, 15,  5,  2,  8, 12,  3,  7,  0,  4, 10,  1, 13, 11,  6,
<a name="l00208"></a>00208                 4,  3,  2, 12,  9,  5, 15, 10, 11, 14,  1,  7,  6,  0,  8, 13,
<a name="l00209"></a>00209 
<a name="l00210"></a>00210            <span class="comment">/* S7 */</span>
<a name="l00211"></a>00211                 4, 11,  2, 14, 15,  0,  8, 13,  3, 12,  9,  7,  5, 10,  6,  1,
<a name="l00212"></a>00212            13,  0, 11,  7,  4,  9,  1, 10, 14,  3,  5, 12,  2, 15,  8,  6,
<a name="l00213"></a>00213                 1,  4, 11, 13, 12,  3,  7, 14, 10, 15,  6,  8,  0,  5,  9,  2,
<a name="l00214"></a>00214                 6, 11, 13,  8,  1,  4, 10,  7,  9,  5,  0, 15, 14,  2,  3, 12,
<a name="l00215"></a>00215 
<a name="l00216"></a>00216            <span class="comment">/* S8 */</span>
<a name="l00217"></a>00217            13,  2,  8,  4,  6, 15, 11,  1, 10,  9,  3, 14,  5,  0, 12,  7,
<a name="l00218"></a>00218                 1, 15, 13,  8, 10,  3,  7,  4, 12,  5,  6, 11,  0, 14,  9,  2,
<a name="l00219"></a>00219                 7, 11,  4,  1,  9, 12, 14,  2,  0,  6, 10, 13, 15,  3,  5,  8,
<a name="l00220"></a>00220                 2,  1, 14,  7,  4, 10,  8, 13, 15, 12,  9,  0,  3,  5,  6, 11
<a name="l00221"></a>00221 };
<a name="l00222"></a>00222 
<a name="l00223"></a>00223 <span class="comment">/* 32-bit permutation function P used on the output of the S-boxes */</span>
<a name="l00224"></a>00224 <span class="keyword">static</span> byte p32i[] = {
<a name="l00225"></a>00225            16,  7, 20, 21,
<a name="l00226"></a>00226            29, 12, 28, 17,
<a name="l00227"></a>00227                 1, 15, 23, 26,
<a name="l00228"></a>00228                 5, 18, 31, 10,
<a name="l00229"></a>00229                 2,  8, 24, 14,
<a name="l00230"></a>00230            32, 27,  3,  9,
<a name="l00231"></a>00231            19, 13, 30,  6,
<a name="l00232"></a>00232            22, 11,  4, 25
<a name="l00233"></a>00233 };
<a name="l00234"></a>00234 <span class="preprocessor">#endif</span>
<a name="l00235"></a>00235 <span class="preprocessor"></span>
<a name="l00236"></a>00236 <span class="comment">/* permuted choice table (key) */</span>
<a name="l00237"></a>00237 <span class="keyword">static</span> <span class="keyword">const</span> byte pc1[] = {
<a name="l00238"></a>00238            57, 49, 41, 33, 25, 17,  9,
<a name="l00239"></a>00239                 1, 58, 50, 42, 34, 26, 18,
<a name="l00240"></a>00240            10,  2, 59, 51, 43, 35, 27,
<a name="l00241"></a>00241            19, 11,  3, 60, 52, 44, 36,
<a name="l00242"></a>00242 
<a name="l00243"></a>00243            63, 55, 47, 39, 31, 23, 15,
<a name="l00244"></a>00244                 7, 62, 54, 46, 38, 30, 22,
<a name="l00245"></a>00245            14,  6, 61, 53, 45, 37, 29,
<a name="l00246"></a>00246            21, 13,  5, 28, 20, 12,  4
<a name="l00247"></a>00247 };
<a name="l00248"></a>00248 
<a name="l00249"></a>00249 <span class="comment">/* number left rotations of pc1 */</span>
<a name="l00250"></a>00250 <span class="keyword">static</span> <span class="keyword">const</span> byte totrot[] = {
<a name="l00251"></a>00251            1,2,4,6,8,10,12,14,15,17,19,21,23,25,27,28
<a name="l00252"></a>00252 };
<a name="l00253"></a>00253 
<a name="l00254"></a>00254 <span class="comment">/* permuted choice key (table) */</span>
<a name="l00255"></a>00255 <span class="keyword">static</span> <span class="keyword">const</span> byte pc2[] = {
<a name="l00256"></a>00256            14, 17, 11, 24,  1,  5,
<a name="l00257"></a>00257                 3, 28, 15,  6, 21, 10,
<a name="l00258"></a>00258            23, 19, 12,  4, 26,  8,
<a name="l00259"></a>00259            16,  7, 27, 20, 13,  2,
<a name="l00260"></a>00260            41, 52, 31, 37, 47, 55,
<a name="l00261"></a>00261            30, 40, 51, 45, 33, 48,
<a name="l00262"></a>00262            44, 49, 39, 56, 34, 53,
<a name="l00263"></a>00263            46, 42, 50, 36, 29, 32
<a name="l00264"></a>00264 };
<a name="l00265"></a>00265 
<a name="l00266"></a>00266 <span class="comment">/* End of DES-defined tables */</span>
<a name="l00267"></a>00267 
<a name="l00268"></a>00268 <span class="comment">/* bit 0 is left-most in byte */</span>
<a name="l00269"></a>00269 <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> bytebit[] = {
<a name="l00270"></a>00270            0200,0100,040,020,010,04,02,01
<a name="l00271"></a>00271 };
<a name="l00272"></a>00272 
<a name="l00273"></a>00273 <span class="comment">/* Set key (initialize key schedule array) */</span>
<a name="l00274"></a><a class="code" href="class_raw_d_e_s.html#4f94683c379a4d98c191297eb95289b3">00274</a> <span class="keywordtype">void</span> <a class="code" href="class_raw_d_e_s.html#4f94683c379a4d98c191297eb95289b3">RawDES::RawSetKey</a>(<a class="code" href="cryptlib_8h.html#353ccabf5ddc119a6a33e92f7b9961c7" title="used to specify a direction for a cipher to operate in (encrypt or decrypt)">CipherDir</a> dir, <span class="keyword">const</span> byte *key)
<a name="l00275"></a>00275 {
<a name="l00276"></a>00276         <a class="code" href="class_sec_block.html" title="a block of memory allocated using A">SecByteBlock</a> buffer(56+56+8);
<a name="l00277"></a>00277         byte *<span class="keyword">const</span> pc1m=buffer;                 <span class="comment">/* place to modify pc1 into */</span>
<a name="l00278"></a>00278         byte *<span class="keyword">const</span> pcr=pc1m+56;                 <span class="comment">/* place to rotate pc1 into */</span>
<a name="l00279"></a>00279         byte *<span class="keyword">const</span> ks=pcr+56;
<a name="l00280"></a>00280         <span class="keyword">register</span> <span class="keywordtype">int</span> i,j,l;
<a name="l00281"></a>00281         <span class="keywordtype">int</span> m;
<a name="l00282"></a>00282         
<a name="l00283"></a>00283         <span class="keywordflow">for</span> (j=0; j&lt;56; j++) {          <span class="comment">/* convert pc1 to bits of key */</span>
<a name="l00284"></a>00284                 l=pc1[j]-1;             <span class="comment">/* integer bit location  */</span>
<a name="l00285"></a>00285                 m = l &amp; 07;             <span class="comment">/* find bit              */</span>
<a name="l00286"></a>00286                 pc1m[j]=(key[l&gt;&gt;3] &amp;    <span class="comment">/* find which key byte l is in */</span>
<a name="l00287"></a>00287                         bytebit[m])     <span class="comment">/* and which bit of that byte */</span>
<a name="l00288"></a>00288                         ? 1 : 0;        <span class="comment">/* and store 1-bit result */</span>
<a name="l00289"></a>00289         }
<a name="l00290"></a>00290         <span class="keywordflow">for</span> (i=0; i&lt;16; i++) {          <span class="comment">/* key chunk for each iteration */</span>
<a name="l00291"></a>00291                 memset(ks,0,8);         <span class="comment">/* Clear key schedule */</span>
<a name="l00292"></a>00292                 <span class="keywordflow">for</span> (j=0; j&lt;56; j++)    <span class="comment">/* rotate pc1 the right amount */</span>
<a name="l00293"></a>00293                         pcr[j] = pc1m[(l=j+totrot[i])&lt;(j&lt;28? 28 : 56) ? l: l-28];
<a name="l00294"></a>00294                 <span class="comment">/* rotate left and right halves independently */</span>
<a name="l00295"></a>00295                 <span class="keywordflow">for</span> (j=0; j&lt;48; j++){   <span class="comment">/* select bits individually */</span>
<a name="l00296"></a>00296                         <span class="comment">/* check bit that goes to ks[j] */</span>
<a name="l00297"></a>00297                         <span class="keywordflow">if</span> (pcr[pc2[j]-1]){