📄 des_8cpp-source.html
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8"><title>Crypto++: des.cpp Source File</title><link href="doxygen.css" rel="stylesheet" type="text/css"><link href="tabs.css" rel="stylesheet" type="text/css"></head><body><!-- Generated by Doxygen 1.5.2 --><div class="tabs"> <ul> <li><a href="index.html"><span>Main Page</span></a></li> <li><a href="namespaces.html"><span>Namespaces</span></a></li> <li><a href="classes.html"><span>Classes</span></a></li> <li class="current"><a href="files.html"><span>Files</span></a></li> </ul></div><div class="tabs"> <ul> <li><a href="files.html"><span>File List</span></a></li> <li><a href="globals.html"><span>File Members</span></a></li> </ul></div><h1>des.cpp</h1><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>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -