<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>Crypto++: des.cpp Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.4 -->
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">Crypto++</div>
</td>
</tr>
</tbody>
</table>
</div>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>File Members</span></a></li>
</ul>
</div>
<div class="header">
<div class="headertitle">
<div class="title">des.cpp</div> </div>
</div>
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// des.cpp - modified by Wei Dai from Phil Karn's des.c</span>
<a name="l00002"></a>00002 <span class="comment">// The original code and all modifications are in the public domain.</span>
<a name="l00003"></a>00003
<a name="l00004"></a>00004 <span class="comment">/*</span>
<a name="l00005"></a>00005 <span class="comment"> * This is a major rewrite of my old public domain DES code written</span>
<a name="l00006"></a>00006 <span class="comment"> * circa 1987, which in turn borrowed heavily from Jim Gillogly's 1977</span>
<a name="l00007"></a>00007 <span class="comment"> * public domain code. I pretty much kept my key scheduling code, but</span>
<a name="l00008"></a>00008 <span class="comment"> * the actual encrypt/decrypt routines are taken from from Richard</span>
<a name="l00009"></a>00009 <span class="comment"> * Outerbridge's DES code as printed in Schneier's "Applied Cryptography."</span>
<a name="l00010"></a>00010 <span class="comment"> *</span>
<a name="l00011"></a>00011 <span class="comment"> * This code is in the public domain. I would appreciate bug reports and</span>
<a name="l00012"></a>00012 <span class="comment"> * enhancements.</span>
<a name="l00013"></a>00013 <span class="comment"> *</span>
<a name="l00014"></a>00014 <span class="comment"> * Phil Karn KA9Q, karn@unix.ka9q.ampr.org, August 1994.</span>
<a name="l00015"></a>00015 <span class="comment"> */</span>
<a name="l00016"></a>00016
<a name="l00017"></a>00017 <span class="preprocessor">#include "pch.h"</span>
<a name="l00018"></a>00018 <span class="preprocessor">#include "misc.h"</span>
<a name="l00019"></a>00019 <span class="preprocessor">#include "<a class="code" href="des_8h.html">des.h</a>"</span>
<a name="l00020"></a>00020
<a name="l00021"></a>00021 NAMESPACE_BEGIN(CryptoPP)
<a name="l00022"></a>00022
<a name="l00023"></a>00023 typedef <a class="code" href="struct_block_get_and_put.html">BlockGetAndPut</a><word32, <a class="code" href="struct_enum_to_type.html">BigEndian</a>> <a class="code" href="struct_block_get_and_put.html">Block</a>;
<a name="l00024"></a>00024
<a name="l00025"></a>00025 <span class="comment">// Richard Outerbridge's initial permutation algorithm</span>
<a name="l00026"></a>00026 <span class="comment">/*</span>
<a name="l00027"></a>00027 <span class="comment">inline void IPERM(word32 &left, word32 &right)</span>
<a name="l00028"></a>00028 <span class="comment">{</span>
<a name="l00029"></a>00029 <span class="comment"> word32 work;</span>
<a name="l00030"></a>00030 <span class="comment"></span>
<a name="l00031"></a>00031 <span class="comment"> work = ((left >> 4) ^ right) & 0x0f0f0f0f;</span>
<a name="l00032"></a>00032 <span class="comment"> right ^= work;</span>
<a name="l00033"></a>00033 <span class="comment"> left ^= work << 4;</span>
<a name="l00034"></a>00034 <span class="comment"> work = ((left >> 16) ^ right) & 0xffff;</span>
<a name="l00035"></a>00035 <span class="comment"> right ^= work;</span>
<a name="l00036"></a>00036 <span class="comment"> left ^= work << 16;</span>
<a name="l00037"></a>00037 <span class="comment"> work = ((right >> 2) ^ left) & 0x33333333;</span>
<a name="l00038"></a>00038 <span class="comment"> left ^= work;</span>
<a name="l00039"></a>00039 <span class="comment"> right ^= (work << 2);</span>
<a name="l00040"></a>00040 <span class="comment"> work = ((right >> 8) ^ left) & 0xff00ff;</span>
<a name="l00041"></a>00041 <span class="comment"> left ^= work;</span>
<a name="l00042"></a>00042 <span class="comment"> right ^= (work << 8);</span>
<a name="l00043"></a>00043 <span class="comment"> right = rotl(right, 1);</span>
<a name="l00044"></a>00044 <span class="comment"> work = (left ^ right) & 0xaaaaaaaa;</span>
<a name="l00045"></a>00045 <span class="comment"> left ^= work;</span>
<a name="l00046"></a>00046 <span class="comment"> right ^= work;</span>
<a name="l00047"></a>00047 <span class="comment"> left = rotl(left, 1);</span>
<a name="l00048"></a>00048 <span class="comment">}</span>
<a name="l00049"></a>00049 <span class="comment">inline void FPERM(word32 &left, word32 &right)</span>
<a name="l00050"></a>00050 <span class="comment">{</span>
<a name="l00051"></a>00051 <span class="comment"> word32 work;</span>
<a name="l00052"></a>00052 <span class="comment"></span>
<a name="l00053"></a>00053 <span class="comment"> right = rotr(right, 1);</span>
<a name="l00054"></a>00054 <span class="comment"> work = (left ^ right) & 0xaaaaaaaa;</span>
<a name="l00055"></a>00055 <span class="comment"> left ^= work;</span>
<a name="l00056"></a>00056 <span class="comment"> right ^= work;</span>
<a name="l00057"></a>00057 <span class="comment"> left = rotr(left, 1);</span>
<a name="l00058"></a>00058 <span class="comment"> work = ((left >> 8) ^ right) & 0xff00ff;</span>
<a name="l00059"></a>00059 <span class="comment"> right ^= work;</span>
<a name="l00060"></a>00060 <span class="comment"> left ^= work << 8;</span>
<a name="l00061"></a>00061 <span class="comment"> work = ((left >> 2) ^ right) & 0x33333333;</span>
<a name="l00062"></a>00062 <span class="comment"> right ^= work;</span>
<a name="l00063"></a>00063 <span class="comment"> left ^= work << 2;</span>
<a name="l00064"></a>00064 <span class="comment"> work = ((right >> 16) ^ left) & 0xffff;</span>
<a name="l00065"></a>00065 <span class="comment"> left ^= work;</span>
<a name="l00066"></a>00066 <span class="comment"> right ^= work << 16;</span>
<a name="l00067"></a>00067 <span class="comment"> work = ((right >> 4) ^ left) & 0x0f0f0f0f;</span>
<a name="l00068"></a>00068 <span class="comment"> left ^= work;</span>
<a name="l00069"></a>00069 <span class="comment"> right ^= work << 4;</span>
<a name="l00070"></a>00070 <span class="comment">}</span>
<a name="l00071"></a>00071 <span class="comment">*/</span>
<a name="l00072"></a>00072
<a name="l00073"></a>00073 <span class="comment">// Wei Dai's modification to Richard Outerbridge's initial permutation </span>
<a name="l00074"></a>00074 <span class="comment">// algorithm, this one is faster if you have access to rotate instructions </span>
<a name="l00075"></a>00075 <span class="comment">// (like in MSVC)</span>
<a name="l00076"></a>00076 static inline <span class="keywordtype">void</span> IPERM(word32 &left, word32 &right)
<a name="l00077"></a>00077 {
<a name="l00078"></a>00078 word32 work;
<a name="l00079"></a>00079
<a name="l00080"></a>00080 right = rotlFixed(right, 4U);
<a name="l00081"></a>00081 work = (left ^ right) & 0xf0f0f0f0;
<a name="l00082"></a>00082 left ^= work;
<a name="l00083"></a>00083 right = rotrFixed(right^work, 20U);
<a name="l00084"></a>00084 work = (left ^ right) & 0xffff0000;
<a name="l00085"></a>00085 left ^= work;
<a name="l00086"></a>00086 right = rotrFixed(right^work, 18U);
<a name="l00087"></a>00087 work = (left ^ right) & 0x33333333;
<a name="l00088"></a>00088 left ^= work;
<a name="l00089"></a>00089 right = rotrFixed(right^work, 6U);
<a name="l00090"></a>00090 work = (left ^ right) & 0x00ff00ff;
<a name="l00091"></a>00091 left ^= work;
<a name="l00092"></a>00092 right = rotlFixed(right^work, 9U);
<a name="l00093"></a>00093 work = (left ^ right) & 0xaaaaaaaa;
<a name="l00094"></a>00094 left = rotlFixed(left^work, 1U);
<a name="l00095"></a>00095 right ^= work;
<a name="l00096"></a>00096 }
<a name="l00097"></a>00097
<a name="l00098"></a>00098 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> FPERM(word32 &left, word32 &right)
<a name="l00099"></a>00099 {
<a name="l00100"></a>00100 word32 work;
<a name="l00101"></a>00101
<a name="l00102"></a>00102 right = rotrFixed(right, 1U);
<a name="l00103"></a>00103 work = (left ^ right) & 0xaaaaaaaa;
<a name="l00104"></a>00104 right ^= work;
<a name="l00105"></a>00105 left = rotrFixed(left^work, 9U);
<a name="l00106"></a>00106 work = (left ^ right) & 0x00ff00ff;
<a name="l00107"></a>00107 right ^= work;
<a name="l00108"></a>00108 left = rotlFixed(left^work, 6U);
<a name="l00109"></a>00109 work = (left ^ right) & 0x33333333;
<a name="l00110"></a>00110 right ^= work;
<a name="l00111"></a>00111 left = rotlFixed(left^work, 18U);
<a name="l00112"></a>00112 work = (left ^ right) & 0xffff0000;
<a name="l00113"></a>00113 right ^= work;
<a name="l00114"></a>00114 left = rotlFixed(left^work, 20U);
<a name="l00115"></a>00115 work = (left ^ right) & 0xf0f0f0f0;
<a name="l00116"></a>00116 right ^= work;
<a name="l00117"></a>00117 left = rotrFixed(left^work, 4U);
<a name="l00118"></a>00118 }
<a name="l00119"></a>00119
<a name="l00120"></a>00120 <span class="keywordtype">void</span> DES::Base::UncheckedSetKey(<span class="keyword">const</span> byte *userKey, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> length, <span class="keyword">const</span> <a class="code" href="class_name_value_pairs.html" title="interface for retrieving values given their names">NameValuePairs</a> &)
<a name="l00121"></a>00121 {
<a name="l00122"></a>00122 AssertValidKeyLength(length);
<a name="l00123"></a>00123
<a name="l00124"></a>00124 RawSetKey(GetCipherDirection(), userKey);
<a name="l00125"></a>00125 }
<a name="l00126"></a>00126
<a name="l00127"></a>00127 <span class="preprocessor">#ifndef CRYPTOPP_IMPORTS</span>
<a name="l00128"></a>00128 <span class="preprocessor"></span>
<a name="l00129"></a>00129 <span class="comment">/* Tables defined in the Data Encryption Standard documents</span>
<a name="l00130"></a>00130 <span class="comment"> * Three of these tables, the initial permutation, the final</span>
<a name="l00131"></a>00131 <span class="comment"> * permutation and the expansion operator, are regular enough that</span>
<a name="l00132"></a>00132 <span class="comment"> * for speed, we hard-code them. They're here for reference only.</span>
<a name="l00133"></a>00133 <span class="comment"> * Also, the S and P boxes are used by a separate program, gensp.c,</span>
<a name="l00134"></a>00134 <span class="comment"> * to build the combined SP box, Spbox[]. They're also here just</span>
<a name="l00135"></a>00135 <span class="comment"> * for reference.</span>
<a name="l00136"></a>00136 <span class="comment"> */</span>
<a name="l00137"></a>00137 <span class="preprocessor">#ifdef notdef</span>
<a name="l00138"></a>00138 <span class="preprocessor"></span><span class="comment">/* initial permutation IP */</span>
<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>00274 <span class="keywordtype">void</span> RawDES::RawSetKey(<a class="code" href="cryptlib_8h.html#a353ccabf5ddc119a6a33e92f7b9961c7" 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<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 & 07; <span class="comment">/* find bit */</span>
<a name="l00286"></a>00286 pc1m[j]=(key[l>>3] & <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<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<56; j++) <span class="comment">/* rotate pc1 the right amount */</span>
<a name="l00293"></a>00293 pcr[j] = pc1m[(l=j+totrot[i])<(j<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<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]){
<a name="l00298"></a>00298 <span class="comment">/* mask it in if it's there */</span>
<a name="l00299"></a>00299 l= j % 6;
<a name="l00300"></a>00300 ks[j/6] |= bytebit[l] >> 2;
<a name="l00301"></a>00301 }
<a name="l00302"></a>00302 }
<a name="l00303"></a>00303 <span class="comment">/* Now convert to odd/even interleaved form for use in F */</span>
<a name="l00304"></a>00304 k[2*i] = ((word32)ks[0] << 24)
<a name="l00305"></a>00305 | ((word32)ks[2] << 16)
<a name="l00306"></a>00306 | ((word32)ks[4] << 8)
<a name="l00307"></a>00307 | ((word32)ks[6]);
<a name="l00308"></a>00308 k[2*i+1] = ((word32)ks[1] << 24)
<a name="l00309"></a>00309 | ((word32)ks[3] << 16)
<a name="l00310"></a>00310 | ((word32)ks[5] << 8)
<a name="l00311"></a>00311 | ((word32)ks[7]);
<a name="l00312"></a>00312 }
<a name="l00313"></a>00313
<a name="l00314"></a>00314 <span class="keywordflow">if</span> (dir==DECRYPTION) <span class="comment">// reverse key schedule order</span>
<a name="l00315"></a>00315 <span class="keywordflow">for</span> (i=0; i<16; i+=2)
<a name="l00316"></a>00316 {
<a name="l00317"></a>00317 std::swap(k[i], k[32-2-i]);
<a name="l00318"></a>00318 std::swap(k[i+1], k[32-1-i]);
<a name="l00319"></a>00319 }
<a name="l00320"></a>00320 }
<a name="l00321"></a>00321
<a name="l00322"></a>00322 <span class="keywordtype">void</span> RawDES::RawProcessBlock(word32 &l_, word32 &r_)<span class="keyword"> const</span>
<a name="l00323"></a>00323 <span class="keyword"></span>{
<a name="l00324"></a>00324 word32 l = l_, r = r_;
<a name="l00325"></a>00325 <span class="keyword">const</span> word32 *kptr=k;
<a name="l00326"></a>00326
<a name="l00327"></a>00327 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i=0; i<8; i++)
<a name="l00328"></a>00328 {
<a name="l00329"></a>00329 word32 work = rotrFixed(r, 4U) ^ kptr[4*i+0];
<a name="l00330"></a>00330 l ^= Spbox[6][(work) & 0x3f]
<a name="l00331"></a>00331 ^ Spbox[4][(work >> 8) & 0x3f]
<a name="l00332"></a>00332 ^ Spbox[2][(work >> 16) & 0x3f]
<a name="l00333"></a>00333 ^ Spbox[0][(work >> 24) & 0x3f];
<a name="l00334"></a>00334 work = r ^ kptr[4*i+1];
<a name="l00335"></a>00335 l ^= Spbox[7][(work) & 0x3f]
<a name="l00336"></a>00336 ^ Spbox[5][(work >> 8) & 0x3f]
<a name="l00337"></a>00337 ^ Spbox[3][(work >> 16) & 0x3f]
<a name="l00338"></a>00338 ^ Spbox[1][(work >> 24) & 0x3f];
<a name="l00339"></a>00339
<a name="l00340"></a>00340 work = rotrFixed(l, 4U) ^ kptr[4*i+2];
<a name="l00341"></a>00341 r ^= Spbox[6][(work) & 0x3f]
<a name="l00342"></a>00342 ^ Spbox[4][(work >> 8) & 0x3f]
<a name="l00343"></a>00343 ^ Spbox[2][(work >> 16) & 0x3f]
<a name="l00344"></a>00344 ^ Spbox[0][(work >> 24) & 0x3f];
<a name="l00345"></a>00345 work = l ^ kptr[4*i+3];
<a name="l00346"></a>00346 r ^= Spbox[7][(work) & 0x3f]
<a name="l00347"></a>00347 ^ Spbox[5][(work >> 8) & 0x3f]
<a name="l00348"></a>00348 ^ Spbox[3][(work >> 16) & 0x3f]
<a name="l00349"></a>00349 ^ Spbox[1][(work >> 24) & 0x3f];
<a name="l00350"></a>00350 }
<a name="l00351"></a>00351
<a name="l00352"></a>00352 l_ = l; r_ = r;
<a name="l00353"></a>00353 }
<a name="l00354"></a>00354
<a name="l00355"></a>00355 <span class="keywordtype">void</span> DES_EDE2::Base::UncheckedSetKey(<span class="keyword">const</span> byte *userKey, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> length, <span class="keyword">const</span> <a class="code" href="class_name_value_pairs.html" title="interface for retrieving values given their names">NameValuePairs</a> &)
<a name="l00356"></a>00356 {
<a name="l00357"></a>00357 AssertValidKeyLength(length);
<a name="l00358"></a>00358
<a name="l00359"></a>00359 m_des1.RawSetKey(GetCipherDirection(), userKey);
<a name="l00360"></a>00360 m_des2.RawSetKey(ReverseCipherDir(GetCipherDirection()), userKey+8);
<a name="l00361"></a>00361 }
<a name="l00362"></a>00362
<a name="l00363"></a>00363 <span class="keywordtype">void</span> DES_EDE2::Base::ProcessAndXorBlock(<span class="keyword">const</span> byte *inBlock, <span class="keyword">const</span> byte *xorBlock, byte *outBlock)<span class="keyword"> const</span>
<a name="l00364"></a>00364 <span class="keyword"></span>{
<a name="l00365"></a>00365 word32 l,r;
<a name="l00366"></a>00366 Block::Get(inBlock)(l)(r);
<a name="l00367"></a>00367 IPERM(l,r);
<a name="l00368"></a>00368 m_des1.RawProcessBlock(l, r);
<a name="l00369"></a>00369 m_des2.RawProcessBlock(r, l);
<a name="l00370"></a>00370 m_des1.RawProcessBlock(l, r);
<a name="l00371"></a>00371 FPERM(l,r);
<a name="l00372"></a>00372 <a class="code" href="class_put_block.html">Block::Put</a>(xorBlock, outBlock)(r)(l);
<a name="l00373"></a>00373 }
<a name="l00374"></a>00374
<a name="l00375"></a>00375 <span class="keywordtype">void</span> DES_EDE3::Base::UncheckedSetKey(<span class="keyword">const</span> byte *userKey, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> length, <span class="keyword">const</span> <a class="code" href="class_name_value_pairs.html" title="interface for retrieving values given their names">NameValuePairs</a> &)
<a name="l00376"></a>00376 {
<a name="l00377"></a>00377 AssertValidKeyLength(length);
<a name="l00378"></a>00378
<a name="l00379"></a>00379 m_des1.RawSetKey(GetCipherDirection(), userKey + (IsForwardTransformation() ? 0 : 16));
<a name="l00380"></a>00380 m_des2.RawSetKey(ReverseCipherDir(GetCipherDirection()), userKey + 8);
<a name="l00381"></a>00381 m_des3.RawSetKey(GetCipherDirection(), userKey + (IsForwardTransformation() ? 16 : 0));
<a name="l00382"></a>00382 }
<a name="l00383"></a>00383
<a name="l00384"></a>00384 <span class="keywordtype">void</span> DES_EDE3::Base::ProcessAndXorBlock(<span class="keyword">const</span> byte *inBlock, <span class="keyword">const</span> byte *xorBlock, byte *outBlock)<span class="keyword"> const</span>
<a name="l00385"></a>00385 <span class="keyword"></span>{
<a name="l00386"></a>00386 word32 l,r;
<a name="l00387"></a>00387 Block::Get(inBlock)(l)(r);
<a name="l00388"></a>00388 IPERM(l,r);
<a name="l00389"></a>00389 m_des1.RawProcessBlock(l, r);
<a name="l00390"></a>00390 m_des2.RawProcessBlock(r, l);
<a name="l00391"></a>00391 m_des3.RawProcessBlock(l, r);
<a name="l00392"></a>00392 FPERM(l,r);
<a name="l00393"></a>00393 <a class="code" href="class_put_block.html">Block::Put</a>(xorBlock, outBlock)(r)(l);
<a name="l00394"></a>00394 }
<a name="l00395"></a>00395
<a name="l00396"></a>00396 <span class="preprocessor">#endif // #ifndef CRYPTOPP_IMPORTS</span>
<a name="l00397"></a>00397 <span class="preprocessor"></span>
<a name="l00398"></a>00398 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> CheckParity(byte b)
<a name="l00399"></a>00399 {
<a name="l00400"></a>00400 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> a = b ^ (b >> 4);
<a name="l00401"></a>00401 <span class="keywordflow">return</span> ((a ^ (a>>1) ^ (a>>2) ^ (a>>3)) & 1) == 1;
<a name="l00402"></a>00402 }
<a name="l00403"></a>00403
<a name="l00404"></a><a class="code" href="class_d_e_s.html#a6f490a975dee8704a9c68771ce746335">00404</a> <span class="keywordtype">bool</span> <a class="code" href="class_d_e_s.html#a6f490a975dee8704a9c68771ce746335" title="check DES key parity bits">DES::CheckKeyParityBits</a>(<span class="keyword">const</span> byte *key)
<a name="l00405"></a>00405 {
<a name="l00406"></a>00406 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=0; i<8; i++)
<a name="l00407"></a>00407 <span class="keywordflow">if</span> (!CheckParity(key[i]))
<a name="l00408"></a>00408 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00409"></a>00409 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00410"></a>00410 }
<a name="l00411"></a>00411
<a name="l00412"></a><a class="code" href="class_d_e_s.html#ab4b48b141706addb33c955c694dd9ead">00412</a> <span class="keywordtype">void</span> <a class="code" href="class_d_e_s.html#ab4b48b141706addb33c955c694dd9ead" title="correct DES key parity bits">DES::CorrectKeyParityBits</a>(byte *key)
<a name="l00413"></a>00413 {
<a name="l00414"></a>00414 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=0; i<8; i++)
<a name="l00415"></a>00415 <span class="keywordflow">if</span> (!CheckParity(key[i]))
<a name="l00416"></a>00416 key[i] ^= 1;
<a name="l00417"></a>00417 }
<a name="l00418"></a>00418
<a name="l00419"></a>00419 <span class="comment">// Encrypt or decrypt a block of data in ECB mode</span>
<a name="l00420"></a>00420 <span class="keywordtype">void</span> DES::Base::ProcessAndXorBlock(<span class="keyword">const</span> byte *inBlock, <span class="keyword">const</span> byte *xorBlock, byte *outBlock)<span class="keyword"> const</span>
<a name="l00421"></a>00421 <span class="keyword"></span>{
<a name="l00422"></a>00422 word32 l,r;
<a name="l00423"></a>00423 Block::Get(inBlock)(l)(r);
<a name="l00424"></a>00424 IPERM(l,r);
<a name="l00425"></a>00425 RawProcessBlock(l, r);
<a name="l00426"></a>00426 FPERM(l,r);
<a name="l00427"></a>00427 <a class="code" href="class_put_block.html">Block::Put</a>(xorBlock, outBlock)(r)(l);
<a name="l00428"></a>00428 }
<a name="l00429"></a>00429
<a name="l00430"></a>00430 <span class="keywordtype">void</span> DES_XEX3::Base::UncheckedSetKey(<span class="keyword">const</span> byte *key, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> length, <span class="keyword">const</span> <a class="code" href="class_name_value_pairs.html" title="interface for retrieving values given their names">NameValuePairs</a> &)
<a name="l00431"></a>00431 {
<a name="l00432"></a>00432 AssertValidKeyLength(length);
<a name="l00433"></a>00433
<a name="l00434"></a>00434 <span class="keywordflow">if</span> (!m_des.get())
<a name="l00435"></a>00435 m_des.reset(<span class="keyword">new</span> <a class="code" href="class_block_cipher_final.html" title="_">DES::Encryption</a>);
<a name="l00436"></a>00436
<a name="l00437"></a>00437 memcpy(m_x1, key + (IsForwardTransformation() ? 0 : 16), BLOCKSIZE);
<a name="l00438"></a>00438 m_des->RawSetKey(GetCipherDirection(), key + 8);
<a name="l00439"></a>00439 memcpy(m_x3, key + (IsForwardTransformation() ? 16 : 0), BLOCKSIZE);
<a name="l00440"></a>00440 }
<a name="l00441"></a>00441
<a name="l00442"></a>00442 <span class="keywordtype">void</span> DES_XEX3::Base::ProcessAndXorBlock(<span class="keyword">const</span> byte *inBlock, <span class="keyword">const</span> byte *xorBlock, byte *outBlock)<span class="keyword"> const</span>
<a name="l00443"></a>00443 <span class="keyword"></span>{
<a name="l00444"></a>00444 xorbuf(outBlock, inBlock, m_x1, BLOCKSIZE);
<a name="l00445"></a>00445 m_des->ProcessAndXorBlock(outBlock, xorBlock, outBlock);
<a name="l00446"></a>00446 xorbuf(outBlock, m_x3, BLOCKSIZE);
<a name="l00447"></a>00447 }
<a name="l00448"></a>00448
<a name="l00449"></a>00449 NAMESPACE_END
</pre></div></div>
</div>
<hr class="footer"/><address class="footer"><small>Generated on Sun Oct 16 2011 for Crypto++ by 
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.4 </small></address>
</body>
</html>
