📄 skipjack_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++: skipjack.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>skipjack.cpp</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// skipjack.cpp - modified by Wei Dai from Paulo Barreto's skipjack32.c,</span><a name="l00002"></a>00002 <span class="comment">// which is public domain according to his web site.</span><a name="l00003"></a>00003 <a name="l00004"></a>00004 <span class="preprocessor">#include "pch.h"</span><a name="l00005"></a>00005 <a name="l00006"></a>00006 <span class="preprocessor">#ifndef CRYPTOPP_IMPORTS</span><a name="l00007"></a>00007 <span class="preprocessor"></span><a name="l00008"></a>00008 <span class="preprocessor">#include "<a class="code" href="skipjack_8h.html">skipjack.h</a>"</span><a name="l00009"></a>00009 <a name="l00010"></a>00010 <span class="comment">/* </span><a name="l00011"></a>00011 <span class="comment"> * Optimized implementation of SKIPJACK algorithm</span><a name="l00012"></a>00012 <span class="comment"> *</span><a name="l00013"></a>00013 <span class="comment"> * originally written by Panu Rissanen <bande@lut.fi> 1998.06.24</span><a name="l00014"></a>00014 <span class="comment"> * optimized by Mark Tillotson <markt@chaos.org.uk> 1998.06.25</span><a name="l00015"></a>00015 <span class="comment"> * optimized by Paulo Barreto <pbarreto@nw.com.br> 1998.06.30</span><a name="l00016"></a>00016 <span class="comment"> */</span><a name="l00017"></a>00017 <a name="l00018"></a>00018 NAMESPACE_BEGIN(CryptoPP)<a name="l00019"></a>00019 <a name="l00020"></a>00020 <span class="comment">/**</span><a name="l00021"></a>00021 <span class="comment"> * The F-table byte permutation (see description of the G-box permutation)</span><a name="l00022"></a>00022 <span class="comment"> */</span><a name="l00023"></a>00023 const byte <a class="code" href="class_s_k_i_p_j_a_c_k.html" title="SKIPJACK">SKIPJACK</a>::Base::fTable[256] = { <a name="l00024"></a>00024 0xa3,0xd7,0x09,0x83,0xf8,0x48,0xf6,0xf4,0xb3,0x21,0x15,0x78,0x99,0xb1,0xaf,0xf9,<a name="l00025"></a>00025 0xe7,0x2d,0x4d,0x8a,0xce,0x4c,0xca,0x2e,0x52,0x95,0xd9,0x1e,0x4e,0x38,0x44,0x28,<a name="l00026"></a>00026 0x0a,0xdf,0x02,0xa0,0x17,0xf1,0x60,0x68,0x12,0xb7,0x7a,0xc3,0xe9,0xfa,0x3d,0x53,<a name="l00027"></a>00027 0x96,0x84,0x6b,0xba,0xf2,0x63,0x9a,0x19,0x7c,0xae,0xe5,0xf5,0xf7,0x16,0x6a,0xa2,<a name="l00028"></a>00028 0x39,0xb6,0x7b,0x0f,0xc1,0x93,0x81,0x1b,0xee,0xb4,0x1a,0xea,0xd0,0x91,0x2f,0xb8,<a name="l00029"></a>00029 0x55,0xb9,0xda,0x85,0x3f,0x41,0xbf,0xe0,0x5a,0x58,0x80,0x5f,0x66,0x0b,0xd8,0x90,<a name="l00030"></a>00030 0x35,0xd5,0xc0,0xa7,0x33,0x06,0x65,0x69,0x45,0x00,0x94,0x56,0x6d,0x98,0x9b,0x76,<a name="l00031"></a>00031 0x97,0xfc,0xb2,0xc2,0xb0,0xfe,0xdb,0x20,0xe1,0xeb,0xd6,0xe4,0xdd,0x47,0x4a,0x1d,<a name="l00032"></a>00032 0x42,0xed,0x9e,0x6e,0x49,0x3c,0xcd,0x43,0x27,0xd2,0x07,0xd4,0xde,0xc7,0x67,0x18,<a name="l00033"></a>00033 0x89,0xcb,0x30,0x1f,0x8d,0xc6,0x8f,0xaa,0xc8,0x74,0xdc,0xc9,0x5d,0x5c,0x31,0xa4,<a name="l00034"></a>00034 0x70,0x88,0x61,0x2c,0x9f,0x0d,0x2b,0x87,0x50,0x82,0x54,0x64,0x26,0x7d,0x03,0x40,<a name="l00035"></a>00035 0x34,0x4b,0x1c,0x73,0xd1,0xc4,0xfd,0x3b,0xcc,0xfb,0x7f,0xab,0xe6,0x3e,0x5b,0xa5,<a name="l00036"></a>00036 0xad,0x04,0x23,0x9c,0x14,0x51,0x22,0xf0,0x29,0x79,0x71,0x7e,0xff,0x8c,0x0e,0xe2,<a name="l00037"></a>00037 0x0c,0xef,0xbc,0x72,0x75,0x6f,0x37,0xa1,0xec,0xd3,0x8e,0x62,0x8b,0x86,0x10,0xe8,<a name="l00038"></a>00038 0x08,0x77,0x11,0xbe,0x92,0x4f,0x24,0xc5,0x32,0x36,0x9d,0xcf,0xf3,0xa6,0xbb,0xac,<a name="l00039"></a>00039 0x5e,0x6c,0xa9,0x13,0x57,0x25,0xb5,0xe3,0xbd,0xa8,0x3a,0x01,0x05,0x59,0x2a,0x46<a name="l00040"></a>00040 };<a name="l00041"></a>00041 <span class="comment"></span><a name="l00042"></a>00042 <span class="comment">/**</span><a name="l00043"></a>00043 <span class="comment"> * The key-dependent permutation G on V^16 is a four-round Feistel network.</span><a name="l00044"></a>00044 <span class="comment"> * The round function is a fixed byte-substitution table (permutation on V^8),</span><a name="l00045"></a>00045 <span class="comment"> * the F-table. Each round of G incorporates a single byte from the key.</span><a name="l00046"></a>00046 <span class="comment"> */</span><a name="l00047"></a>00047 <span class="preprocessor">#define g(tab, w, i, j, k, l) \</span><a name="l00048"></a>00048 <span class="preprocessor">{ \</span><a name="l00049"></a>00049 <span class="preprocessor"> w ^= (word)tab[i][w & 0xff] << 8; \</span><a name="l00050"></a>00050 <span class="preprocessor"> w ^= (word)tab[j][w >> 8]; \</span><a name="l00051"></a>00051 <span class="preprocessor"> w ^= (word)tab[k][w & 0xff] << 8; \</span><a name="l00052"></a>00052 <span class="preprocessor"> w ^= (word)tab[l][w >> 8]; \</span><a name="l00053"></a>00053 <span class="preprocessor">}</span><a name="l00054"></a>00054 <span class="preprocessor"></span><a name="l00055"></a>00055 <span class="preprocessor">#define g0(tab, w) g(tab, w, 0, 1, 2, 3)</span><a name="l00056"></a>00056 <span class="preprocessor"></span><span class="preprocessor">#define g1(tab, w) g(tab, w, 4, 5, 6, 7)</span><a name="l00057"></a>00057 <span class="preprocessor"></span><span class="preprocessor">#define g2(tab, w) g(tab, w, 8, 9, 0, 1)</span><a name="l00058"></a>00058 <span class="preprocessor"></span><span class="preprocessor">#define g3(tab, w) g(tab, w, 2, 3, 4, 5)</span><a name="l00059"></a>00059 <span class="preprocessor"></span><span class="preprocessor">#define g4(tab, w) g(tab, w, 6, 7, 8, 9)</span><a name="l00060"></a>00060 <span class="preprocessor"></span><span class="comment"></span><a name="l00061"></a>00061 <span class="comment">/**</span><a name="l00062"></a>00062 <span class="comment"> * The inverse of the G permutation.</span><a name="l00063"></a>00063 <span class="comment"> */</span><a name="l00064"></a>00064 <span class="preprocessor">#define h(tab, w, i, j, k, l) \</span><a name="l00065"></a>00065 <span class="preprocessor">{ \</span><a name="l00066"></a>00066 <span class="preprocessor"> w ^= (word)tab[l][w >> 8]; \</span><a name="l00067"></a>00067 <span class="preprocessor"> w ^= (word)tab[k][w & 0xff] << 8; \</span><a name="l00068"></a>00068 <span class="preprocessor"> w ^= (word)tab[j][w >> 8]; \</span><a name="l00069"></a>00069 <span class="preprocessor"> w ^= (word)tab[i][w & 0xff] << 8; \</span><a name="l00070"></a>00070 <span class="preprocessor">}</span><a name="l00071"></a>00071 <span class="preprocessor"></span><a name="l00072"></a>00072 <span class="preprocessor">#define h0(tab, w) h(tab, w, 0, 1, 2, 3)</span><a name="l00073"></a>00073 <span class="preprocessor"></span><span class="preprocessor">#define h1(tab, w) h(tab, w, 4, 5, 6, 7)</span><a name="l00074"></a>00074 <span class="preprocessor"></span><span class="preprocessor">#define h2(tab, w) h(tab, w, 8, 9, 0, 1)</span><a name="l00075"></a>00075 <span class="preprocessor"></span><span class="preprocessor">#define h3(tab, w) h(tab, w, 2, 3, 4, 5)</span><a name="l00076"></a>00076 <span class="preprocessor"></span><span class="preprocessor">#define h4(tab, w) h(tab, w, 6, 7, 8, 9)</span><a name="l00077"></a>00077 <span class="preprocessor"></span><span class="comment"></span><a name="l00078"></a>00078 <span class="comment">/**</span><a name="l00079"></a>00079 <span class="comment"> * Preprocess a user key into a table to save an XOR at each F-table access.</span><a name="l00080"></a>00080 <span class="comment"> */</span><a name="l00081"></a>00081 <span class="keywordtype">void</span> SKIPJACK::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="l00082"></a>00082 {<a name="l00083"></a>00083 AssertValidKeyLength(length);<a name="l00084"></a>00084 <a name="l00085"></a>00085 <span class="comment">/* tab[i][c] = fTable[c ^ key[i]] */</span><a name="l00086"></a>00086 <span class="keywordtype">int</span> i;<a name="l00087"></a>00087 <span class="keywordflow">for</span> (i = 0; i < 10; i++) {<a name="l00088"></a>00088 byte *t = tab[i], k = key[9-i];<a name="l00089"></a>00089 <span class="keywordtype">int</span> c;<a name="l00090"></a>00090 <span class="keywordflow">for</span> (c = 0; c < 256; c++) {<a name="l00091"></a>00091 t[c] = fTable[c ^ k];<a name="l00092"></a>00092 }<a name="l00093"></a>00093 }<a name="l00094"></a>00094 }⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -