📄 mars_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++: mars.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>mars.cpp</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// mars.cpp - modified by Sean Woods from Brian Gladman's mars6.c for Crypto++</span><a name="l00002"></a>00002 <span class="comment">// key setup updated by Wei Dai to reflect IBM's "tweak" proposed in August 1999</span><a name="l00003"></a>00003 <a name="l00004"></a>00004 <span class="comment">/* This is an independent implementation of the MARS encryption */</span><a name="l00005"></a>00005 <span class="comment">/* algorithm designed by a team at IBM as a candidate for the US */</span><a name="l00006"></a>00006 <span class="comment">/* NIST Advanced Encryption Standard (AES) effort. The algorithm */</span><a name="l00007"></a>00007 <span class="comment">/* is subject to Patent action by IBM, who intend to offer royalty */</span><a name="l00008"></a>00008 <span class="comment">/* free use if a Patent is granted. */</span><a name="l00009"></a>00009 <span class="comment">/* */</span><a name="l00010"></a>00010 <span class="comment">/* Copyright in this implementation is held by Dr B R Gladman but */</span><a name="l00011"></a>00011 <span class="comment">/* I hereby give permission for its free direct or derivative use */</span><a name="l00012"></a>00012 <span class="comment">/* subject to acknowledgment of its origin and compliance with any */</span><a name="l00013"></a>00013 <span class="comment">/* constraints that IBM place on the use of the MARS algorithm. */</span><a name="l00014"></a>00014 <span class="comment">/* */</span><a name="l00015"></a>00015 <span class="comment">/* Dr Brian Gladman (gladman@seven77.demon.co.uk) 4th October 1998 */</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 "<a class="code" href="mars_8h.html">mars.h</a>"</span><a name="l00019"></a>00019 <span class="preprocessor">#include "misc.h"</span><a name="l00020"></a>00020 <a name="l00021"></a>00021 NAMESPACE_BEGIN(CryptoPP)<a name="l00022"></a>00022 <a name="l00023"></a>00023 ANONYMOUS_NAMESPACE_BEGIN<a name="l00024"></a>00024 static word32 gen_mask(word32 x)<a name="l00025"></a>00025 {<a name="l00026"></a>00026 word32 m;<a name="l00027"></a>00027 <a name="l00028"></a>00028 m = (~x ^ (x >> 1)) & 0x7fffffff;<a name="l00029"></a>00029 m &= (m >> 1) & (m >> 2); m &= (m >> 3) & (m >> 6); <a name="l00030"></a>00030 <a name="l00031"></a>00031 <span class="keywordflow">if</span>(!m)<a name="l00032"></a>00032 <span class="keywordflow">return</span> 0;<a name="l00033"></a>00033 <a name="l00034"></a>00034 m <<= 1; m |= (m << 1); m |= (m << 2); m |= (m << 4);<a name="l00035"></a>00035 m |= (m << 1) & ~x & 0x80000000;<a name="l00036"></a>00036 <a name="l00037"></a>00037 <span class="keywordflow">return</span> m & 0xfffffffc;<a name="l00038"></a>00038 };<a name="l00039"></a>00039 NAMESPACE_END<a name="l00040"></a>00040 <a name="l00041"></a>00041 <span class="keywordtype">void</span> MARS::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="l00042"></a>00042 {<a name="l00043"></a>00043 AssertValidKeyLength(length);<a name="l00044"></a>00044 <a name="l00045"></a>00045 <span class="comment">// Initialize T[] with the key data</span><a name="l00046"></a>00046 <a class="code" href="class_fixed_size_sec_block.html" title="a SecBlock with fixed size, allocated statically">FixedSizeSecBlock<word32, 15></a> T;<a name="l00047"></a>00047 GetUserKey(<a class="code" href="cryptlib_8h.html#aeb92d42f5a6e27b8ba19f18d69d142bccd5b3585bd07d6bdae383aa8271b9d2">LITTLE_ENDIAN_ORDER</a>, T.<a class="code" href="class_sec_block.html#11a05906688172579cd3520816799446">begin</a>(), 15, userKey, length);<a name="l00048"></a>00048 T[length/4] = length/4;<a name="l00049"></a>00049 <a name="l00050"></a>00050 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> j=0; j<4; j++) <span class="comment">// compute 10 words of K[] in each iteration</span><a name="l00051"></a>00051 {<a name="l00052"></a>00052 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i;<a name="l00053"></a>00053 <span class="comment">// Do linear transformation</span><a name="l00054"></a>00054 <span class="keywordflow">for</span> (i=0; i<15; i++)<a name="l00055"></a>00055 T[i] = T[i] ^ rotlFixed(T[(i+8)%15] ^ T[(i+13)%15], 3) ^ (4*i+j);<a name="l00056"></a>00056 <a name="l00057"></a>00057 <span class="comment">// Do four rounds of stirring</span><a name="l00058"></a>00058 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> k=0; k<4; k++)<a name="l00059"></a>00059 <span class="keywordflow">for</span> (i=0; i<15; i++)<a name="l00060"></a>00060 T[i] = rotlFixed(T[i] + Sbox[T[(i+14)%15]%512], 9);<a name="l00061"></a>00061 <a name="l00062"></a>00062 <span class="comment">// Store next 10 key words into K[]</span><a name="l00063"></a>00063 <span class="keywordflow">for</span> (i=0; i<10; i++)<a name="l00064"></a>00064 EK[10*j+i] = T[4*i%15];<a name="l00065"></a>00065 }<a name="l00066"></a>00066 <a name="l00067"></a>00067 <span class="comment">// Modify multiplication key-words</span><a name="l00068"></a>00068 <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 5; i < 37; i += 2)<a name="l00069"></a>00069 {<a name="l00070"></a>00070 word32 w = EK[i] | 3;<a name="l00071"></a>00071 word32 m = gen_mask(w);<a name="l00072"></a>00072 <span class="keywordflow">if</span>(m)<a name="l00073"></a>00073 w ^= (rotlMod(Sbox[265 + (EK[i] & 3)], EK[i-1]) & m);<a name="l00074"></a>00074 EK[i] = w;<a name="l00075"></a>00075 }<a name="l00076"></a>00076 }<a name="l00077"></a>00077 <a name="l00078"></a>00078 <span class="preprocessor">#define f_mix(a,b,c,d) \</span><a name="l00079"></a>00079 <span class="preprocessor"> r = rotrFixed(a, 8); \</span><a name="l00080"></a>00080 <span class="preprocessor"> b ^= Sbox[a & 255]; \</span><a name="l00081"></a>00081 <span class="preprocessor"> b += Sbox[(r & 255) + 256]; \</span><a name="l00082"></a>00082 <span class="preprocessor"> r = rotrFixed(a, 16); \</span><a name="l00083"></a>00083 <span class="preprocessor"> a = rotrFixed(a, 24); \</span><a name="l00084"></a>00084 <span class="preprocessor"> c += Sbox[r & 255]; \</span><a name="l00085"></a>00085 <span class="preprocessor"> d ^= Sbox[(a & 255) + 256]</span><a name="l00086"></a>00086 <span class="preprocessor"></span><a name="l00087"></a>00087 <span class="preprocessor">#define b_mix(a,b,c,d) \</span><a name="l00088"></a>00088 <span class="preprocessor"> r = rotlFixed(a, 8); \</span><a name="l00089"></a>00089 <span class="preprocessor"> b ^= Sbox[(a & 255) + 256]; \</span><a name="l00090"></a>00090 <span class="preprocessor"> c -= Sbox[r & 255]; \</span><a name="l00091"></a>00091 <span class="preprocessor"> r = rotlFixed(a, 16); \</span><a name="l00092"></a>00092 <span class="preprocessor"> a = rotlFixed(a, 24); \</span><a name="l00093"></a>00093 <span class="preprocessor"> d -= Sbox[(r & 255) + 256]; \</span><a name="l00094"></a>00094 <span class="preprocessor"> d ^= Sbox[a & 255]</span><a name="l00095"></a>00095 <span class="preprocessor"></span><a name="l00096"></a>00096 <span class="preprocessor">#define f_ktr(a,b,c,d,i) \</span><a name="l00097"></a>00097 <span class="preprocessor"> m = a + EK[i]; \</span><a name="l00098"></a>00098 <span class="preprocessor"> a = rotlFixed(a, 13); \</span>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -