<!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++: tea.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.6.1 -->
<div class="navigation" id="top">
<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="annotated.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>tea.cpp</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// tea.cpp - modified by Wei Dai from code in the original paper</span>
<a name="l00002"></a>00002
<a name="l00003"></a>00003 <span class="preprocessor">#include "pch.h"</span>
<a name="l00004"></a>00004 <span class="preprocessor">#include "<a class="code" href="tea_8h.html">tea.h</a>"</span>
<a name="l00005"></a>00005 <span class="preprocessor">#include "misc.h"</span>
<a name="l00006"></a>00006
<a name="l00007"></a>00007 NAMESPACE_BEGIN(CryptoPP)
<a name="l00008"></a>00008
<a name="l00009"></a>00009 static const word32 DELTA = 0x9e3779b9;
<a name="l00010"></a>00010 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="l00011"></a>00011
<a name="l00012"></a>00012 <span class="keywordtype">void</span> <a class="code" href="class_t_e_a.html" title="TEA">TEA</a>::Base::UncheckedSetKey(const byte *userKey, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> length, const <a class="code" href="class_name_value_pairs.html" title="interface for retrieving values given their names">NameValuePairs</a> &params)
<a name="l00013"></a>00013 {
<a name="l00014"></a>00014 AssertValidKeyLength(length);
<a name="l00015"></a>00015
<a name="l00016"></a>00016 GetUserKey(BIG_ENDIAN_ORDER, m_k.begin(), 4, userKey, KEYLENGTH);
<a name="l00017"></a>00017 m_limit = GetRoundsAndThrowIfInvalid(params, <span class="keyword">this</span>) * DELTA;
<a name="l00018"></a>00018 }
<a name="l00019"></a>00019
<a name="l00020"></a>00020 <span class="keywordtype">void</span> TEA::Enc::ProcessAndXorBlock(<span class="keyword">const</span> byte *inBlock, <span class="keyword">const</span> byte *xorBlock, byte *outBlock)<span class="keyword"> const</span>
<a name="l00021"></a>00021 <span class="keyword"></span>{
<a name="l00022"></a>00022 word32 y, z;
<a name="l00023"></a>00023 Block::Get(inBlock)(y)(z);
<a name="l00024"></a>00024
<a name="l00025"></a>00025 word32 sum = 0;
<a name="l00026"></a>00026 <span class="keywordflow">while</span> (sum != m_limit)
<a name="l00027"></a>00027 {
<a name="l00028"></a>00028 sum += DELTA;
<a name="l00029"></a>00029 y += (z << 4) + m_k[0] ^ z + sum ^ (z >> 5) + m_k[1];
<a name="l00030"></a>00030 z += (y << 4) + m_k[2] ^ y + sum ^ (y >> 5) + m_k[3];
<a name="l00031"></a>00031 }
<a name="l00032"></a>00032
<a name="l00033"></a>00033 <a class="code" href="class_put_block.html">Block::Put</a>(xorBlock, outBlock)(y)(z);
<a name="l00034"></a>00034 }
<a name="l00035"></a>00035
<a name="l00036"></a>00036 <span class="keywordtype">void</span> TEA::Dec::ProcessAndXorBlock(<span class="keyword">const</span> byte *inBlock, <span class="keyword">const</span> byte *xorBlock, byte *outBlock)<span class="keyword"> const</span>
<a name="l00037"></a>00037 <span class="keyword"></span>{
<a name="l00038"></a>00038 word32 y, z;
<a name="l00039"></a>00039 Block::Get(inBlock)(y)(z);
<a name="l00040"></a>00040
<a name="l00041"></a>00041 word32 sum = m_limit;
<a name="l00042"></a>00042 <span class="keywordflow">while</span> (sum != 0)
<a name="l00043"></a>00043 {
<a name="l00044"></a>00044 z -= (y << 4) + m_k[2] ^ y + sum ^ (y >> 5) + m_k[3];
<a name="l00045"></a>00045 y -= (z << 4) + m_k[0] ^ z + sum ^ (z >> 5) + m_k[1];
<a name="l00046"></a>00046 sum -= DELTA;
<a name="l00047"></a>00047 }
<a name="l00048"></a>00048
<a name="l00049"></a>00049 <a class="code" href="class_put_block.html">Block::Put</a>(xorBlock, outBlock)(y)(z);
<a name="l00050"></a>00050 }
<a name="l00051"></a>00051
<a name="l00052"></a>00052 <span class="keywordtype">void</span> XTEA::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> &params)
<a name="l00053"></a>00053 {
<a name="l00054"></a>00054 AssertValidKeyLength(length);
<a name="l00055"></a>00055
<a name="l00056"></a>00056 GetUserKey(BIG_ENDIAN_ORDER, m_k.begin(), 4, userKey, KEYLENGTH);
<a name="l00057"></a>00057 m_limit = GetRoundsAndThrowIfInvalid(params, <span class="keyword">this</span>) * DELTA;
<a name="l00058"></a>00058 }
<a name="l00059"></a>00059
<a name="l00060"></a>00060 <span class="keywordtype">void</span> XTEA::Enc::ProcessAndXorBlock(<span class="keyword">const</span> byte *inBlock, <span class="keyword">const</span> byte *xorBlock, byte *outBlock)<span class="keyword"> const</span>
<a name="l00061"></a>00061 <span class="keyword"></span>{
<a name="l00062"></a>00062 word32 y, z;
<a name="l00063"></a>00063 Block::Get(inBlock)(y)(z);
<a name="l00064"></a>00064
<a name="l00065"></a>00065 word32 sum = 0;
<a name="l00066"></a>00066 <span class="keywordflow">while</span> (sum != m_limit)
<a name="l00067"></a>00067 {
<a name="l00068"></a>00068 y += (z<<4 ^ z>>5) + z ^ sum + m_k[sum&3];
<a name="l00069"></a>00069 sum += DELTA;
<a name="l00070"></a>00070 z += (y<<4 ^ y>>5) + y ^ sum + m_k[sum>>11 & 3];
<a name="l00071"></a>00071 }
<a name="l00072"></a>00072
<a name="l00073"></a>00073 <a class="code" href="class_put_block.html">Block::Put</a>(xorBlock, outBlock)(y)(z);
<a name="l00074"></a>00074 }
<a name="l00075"></a>00075
<a name="l00076"></a>00076 <span class="keywordtype">void</span> XTEA::Dec::ProcessAndXorBlock(<span class="keyword">const</span> byte *inBlock, <span class="keyword">const</span> byte *xorBlock, byte *outBlock)<span class="keyword"> const</span>
<a name="l00077"></a>00077 <span class="keyword"></span>{
<a name="l00078"></a>00078 word32 y, z;
<a name="l00079"></a>00079 Block::Get(inBlock)(y)(z);
<a name="l00080"></a>00080
<a name="l00081"></a>00081 word32 sum = m_limit;
<a name="l00082"></a>00082 <span class="keywordflow">while</span> (sum != 0)
<a name="l00083"></a>00083 {
<a name="l00084"></a>00084 z -= (y<<4 ^ y>>5) + y ^ sum + m_k[sum>>11 & 3];
<a name="l00085"></a>00085 sum -= DELTA;
<a name="l00086"></a>00086 y -= (z<<4 ^ z>>5) + z ^ sum + m_k[sum&3];
<a name="l00087"></a>00087 }
<a name="l00088"></a>00088
<a name="l00089"></a>00089 <a class="code" href="class_put_block.html">Block::Put</a>(xorBlock, outBlock)(y)(z);
<a name="l00090"></a>00090 }
<a name="l00091"></a>00091
<a name="l00092"></a>00092 <span class="preprocessor">#define MX (z>>5^y<<2)+(y>>3^z<<4)^(sum^y)+(m_k[p&3^e]^z)</span>
<a name="l00093"></a>00093 <span class="preprocessor"></span>
<a name="l00094"></a>00094 <span class="keywordtype">void</span> BTEA::Enc::ProcessAndXorBlock(<span class="keyword">const</span> byte *inBlock, <span class="keyword">const</span> byte *xorBlock, byte *outBlock)<span class="keyword"> const</span>
<a name="l00095"></a>00095 <span class="keyword"></span>{
<a name="l00096"></a>00096 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n = m_blockSize / 4;
<a name="l00097"></a>00097 word32 *v = (word32*)outBlock;
<a name="l00098"></a>00098 ConditionalByteReverse(BIG_ENDIAN_ORDER, v, (<span class="keyword">const</span> word32*)inBlock, m_blockSize);
<a name="l00099"></a>00099
<a name="l00100"></a>00100 word32 y = v[0], z = v[n-1], e;
<a name="l00101"></a>00101 word32 p, q = 6+52/n;
<a name="l00102"></a>00102 word32 sum = 0;
<a name="l00103"></a>00103
<a name="l00104"></a>00104 <span class="keywordflow">while</span> (q-- > 0)
<a name="l00105"></a>00105 {
<a name="l00106"></a>00106 sum += DELTA;
<a name="l00107"></a>00107 e = sum>>2 & 3;
<a name="l00108"></a>00108 <span class="keywordflow">for</span> (p = 0; p < n-1; p++)
<a name="l00109"></a>00109 {
<a name="l00110"></a>00110 y = v[p+1];
<a name="l00111"></a>00111 z = v[p] += MX;
<a name="l00112"></a>00112 }
<a name="l00113"></a>00113 y = v[0];
<a name="l00114"></a>00114 z = v[n-1] += MX;
<a name="l00115"></a>00115 }
<a name="l00116"></a>00116
<a name="l00117"></a>00117 ConditionalByteReverse(BIG_ENDIAN_ORDER, v, v, m_blockSize);
<a name="l00118"></a>00118 }
<a name="l00119"></a>00119
<a name="l00120"></a>00120 <span class="keywordtype">void</span> BTEA::Dec::ProcessAndXorBlock(<span class="keyword">const</span> byte *inBlock, <span class="keyword">const</span> byte *xorBlock, byte *outBlock)<span class="keyword"> const</span>
<a name="l00121"></a>00121 <span class="keyword"></span>{
<a name="l00122"></a>00122 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n = m_blockSize / 4;
<a name="l00123"></a>00123 word32 *v = (word32*)outBlock;
<a name="l00124"></a>00124 ConditionalByteReverse(BIG_ENDIAN_ORDER, v, (<span class="keyword">const</span> word32*)inBlock, m_blockSize);
<a name="l00125"></a>00125
<a name="l00126"></a>00126 word32 y = v[0], z = v[n-1], e;
<a name="l00127"></a>00127 word32 p, q = 6+52/n;
<a name="l00128"></a>00128 word32 sum = q * DELTA;
<a name="l00129"></a>00129
<a name="l00130"></a>00130 <span class="keywordflow">while</span> (sum != 0)
<a name="l00131"></a>00131 {
<a name="l00132"></a>00132 e = sum>>2 & 3;
<a name="l00133"></a>00133 <span class="keywordflow">for</span> (p = n-1; p > 0; p--)
<a name="l00134"></a>00134 {
<a name="l00135"></a>00135 z = v[p-1];
<a name="l00136"></a>00136 y = v[p] -= MX;
<a name="l00137"></a>00137 }
<a name="l00138"></a>00138
<a name="l00139"></a>00139 z = v[n-1];
<a name="l00140"></a>00140 y = v[0] -= MX;
<a name="l00141"></a>00141 sum -= DELTA;
<a name="l00142"></a>00142 }
<a name="l00143"></a>00143
<a name="l00144"></a>00144 ConditionalByteReverse(BIG_ENDIAN_ORDER, v, v, m_blockSize);
<a name="l00145"></a>00145 }
<a name="l00146"></a>00146
<a name="l00147"></a>00147 NAMESPACE_END
</pre></div></div>
<hr size="1"/><address style="text-align: right;"><small>Generated on 9 Dec 2009 for Crypto++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.6.1 </small></address>
</body>
</html>
distrib
>
Fedora
>
13
>
i386
>
media
>
os
>
by-pkgid
>
07dfcfe50d66c9a48a3c5e6c1693f12a
>
files
>
2399
