doc/www/doxygen/html/sha1_8cc-source.html

   1 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
   2 <html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
   3 <title>Barry: sha1.cc Source File</title>
   4 <link href="doxygen.css" rel="stylesheet" type="text/css">
   5 <link href="tabs.css" rel="stylesheet" type="text/css">
   6 </head><body>
   7 <!-- Generated by Doxygen 1.5.6 -->
   8 <div class="navigation" id="top">
   9   <div class="tabs">
  10     <ul>
  11       <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>
  12       <li><a href="modules.html"><span>Modules</span></a></li>
  13       <li><a href="namespaces.html"><span>Namespaces</span></a></li>
  14       <li><a href="classes.html"><span>Classes</span></a></li>
  15       <li class="current"><a href="files.html"><span>Files</span></a></li>
  16       <li><a href="dirs.html"><span>Directories</span></a></li>
  17     </ul>
  18   </div>
  19   <div class="navpath"><a class="el" href="dir_edc0f428e3eefcfdce9c25befd901c57.html">src</a>
  20   </div>
  21 </div>
  22 <div class="contents">
  23 <h1>sha1.cc</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
  24 <a name="l00002"></a>00002 <span class="comment"> * The contents of this file are subject to the Mozilla Public</span>
  25 <a name="l00003"></a>00003 <span class="comment"> * License Version 1.1 (the "License"); you may not use this file</span>
  26 <a name="l00004"></a>00004 <span class="comment"> * except in compliance with the License. You may obtain a copy of</span>
  27 <a name="l00005"></a>00005 <span class="comment"> * the License at http://www.mozilla.org/MPL/</span>
  28 <a name="l00006"></a>00006 <span class="comment"> *</span>
  29 <a name="l00007"></a>00007 <span class="comment"> * Software distributed under the License is distributed on an "AS</span>
  30 <a name="l00008"></a>00008 <span class="comment"> * IS" basis, WITHOUT WARRANTY OF ANY KIND, either express or</span>
  31 <a name="l00009"></a>00009 <span class="comment"> * implied. See the License for the specific language governing</span>
  32 <a name="l00010"></a>00010 <span class="comment"> * rights and limitations under the License.</span>
  33 <a name="l00011"></a>00011 <span class="comment"> *</span>
  34 <a name="l00012"></a>00012 <span class="comment"> * The Original Code is SHA 180-1 Reference Implementation (Compact version)</span>
  35 <a name="l00013"></a>00013 <span class="comment"> *</span>
  36 <a name="l00014"></a>00014 <span class="comment"> * The Initial Developer of the Original Code is Paul Kocher of</span>
  37 <a name="l00015"></a>00015 <span class="comment"> * Cryptography Research.  Portions created by Paul Kocher are</span>
  38 <a name="l00016"></a>00016 <span class="comment"> * Copyright (C) 1995-9 by Cryptography Research, Inc.  All</span>
  39 <a name="l00017"></a>00017 <span class="comment"> * Rights Reserved.</span>
  40 <a name="l00018"></a>00018 <span class="comment"> *</span>
  41 <a name="l00019"></a>00019 <span class="comment"> * Contributor(s):</span>
  42 <a name="l00020"></a>00020 <span class="comment"> *</span>
  43 <a name="l00021"></a>00021 <span class="comment"> *     Paul Kocher</span>
  44 <a name="l00022"></a>00022 <span class="comment"> *</span>
  45 <a name="l00023"></a>00023 <span class="comment"> * Alternatively, the contents of this file may be used under the</span>
  46 <a name="l00024"></a>00024 <span class="comment"> * terms of the GNU General Public License Version 2 or later (the</span>
  47 <a name="l00025"></a>00025 <span class="comment"> * "GPL"), in which case the provisions of the GPL are applicable</span>
  48 <a name="l00026"></a>00026 <span class="comment"> * instead of those above.  If you wish to allow use of your</span>
  49 <a name="l00027"></a>00027 <span class="comment"> * version of this file only under the terms of the GPL and not to</span>
  50 <a name="l00028"></a>00028 <span class="comment"> * allow others to use your version of this file under the MPL,</span>
  51 <a name="l00029"></a>00029 <span class="comment"> * indicate your decision by deleting the provisions above and</span>
  52 <a name="l00030"></a>00030 <span class="comment"> * replace them with the notice and other provisions required by</span>
  53 <a name="l00031"></a>00031 <span class="comment"> * the GPL.  If you do not delete the provisions above, a recipient</span>
  54 <a name="l00032"></a>00032 <span class="comment"> * may use your version of this file under either the MPL or the</span>
  55 <a name="l00033"></a>00033 <span class="comment"> * GPL.</span>
  56 <a name="l00034"></a>00034 <span class="comment"> */</span>
  57 <a name="l00035"></a>00035
  58 <a name="l00036"></a>00036 <span class="comment">/*</span>
  59 <a name="l00037"></a>00037 <span class="comment">Copied from the git sources, with the following revision history:</span>
  60 <a name="l00038"></a>00038 <span class="comment"></span>
  61 <a name="l00039"></a>00039 <span class="comment">commit 77ab8798d3f8df39877235be17bb6e70077aaba2</span>
  62 <a name="l00040"></a>00040 <span class="comment">Author: Junio C Hamano &lt;junkio@cox.net&gt;</span>
  63 <a name="l00041"></a>00041 <span class="comment">Date:   Tue Nov 1 10:56:03 2005 -0800</span>
  64 <a name="l00042"></a>00042 <span class="comment"></span>
  65 <a name="l00043"></a>00043 <span class="comment">    Fix constness of input in mozilla-sha1/sha1.c::SHA1_Update().</span>
  66 <a name="l00044"></a>00044 <span class="comment"></span>
  67 <a name="l00045"></a>00045 <span class="comment">    Among the three of our own implementations, only this one lacked</span>
  68 <a name="l00046"></a>00046 <span class="comment">    "const" from the second argument.</span>
  69 <a name="l00047"></a>00047 <span class="comment"></span>
  70 <a name="l00048"></a>00048 <span class="comment">    Signed-off-by: Junio C Hamano &lt;junkio@cox.net&gt;</span>
  71 <a name="l00049"></a>00049 <span class="comment"></span>
  72 <a name="l00050"></a>00050 <span class="comment">commit cef661fc799a3a13ffdea4a3f69f1acd295de53d</span>
  73 <a name="l00051"></a>00051 <span class="comment">Author: Linus Torvalds &lt;torvalds@ppc970.osdl.org&gt;</span>
  74 <a name="l00052"></a>00052 <span class="comment">Date:   Thu Apr 21 12:33:22 2005 -0700</span>
  75 <a name="l00053"></a>00053 <span class="comment"></span>
  76 <a name="l00054"></a>00054 <span class="comment">    Add support for alternate SHA1 library implementations.</span>
  77 <a name="l00055"></a>00055 <span class="comment"></span>
  78 <a name="l00056"></a>00056 <span class="comment">    This one includes the Mozilla SHA1 implementation sent in by Edgar Toernig.</span>
  79 <a name="l00057"></a>00057 <span class="comment">    It's dual-licenced under MPL-1.1 or GPL, so in the context of git, we</span>
  80 <a name="l00058"></a>00058 <span class="comment">    obviously use the GPL version.</span>
  81 <a name="l00059"></a>00059 <span class="comment"></span>
  82 <a name="l00060"></a>00060 <span class="comment">    Side note: the Mozilla SHA1 implementation is about twice as fast as the</span>
  83 <a name="l00061"></a>00061 <span class="comment">    default openssl one on my G5, but the default openssl one has optimized</span>
  84 <a name="l00062"></a>00062 <span class="comment">    x86 assembly language on x86. So choose wisely.</span>
  85 <a name="l00063"></a>00063 <span class="comment"></span>
  86 <a name="l00064"></a>00064 <span class="comment">*/</span>
  87 <a name="l00065"></a>00065
  88 <a name="l00066"></a>00066 <span class="preprocessor">#include "sha1.h"</span>
  89 <a name="l00067"></a>00067
  90 <a name="l00068"></a>00068 <span class="keyword">namespace </span>Barry {
  91 <a name="l00069"></a>00069
  92 <a name="l00070"></a>00070 <span class="keyword">static</span> <span class="keywordtype">void</span> shaHashBlock(SHA_CTX *ctx);
  93 <a name="l00071"></a>00071
  94 <a name="l00072"></a>00072 <span class="keywordtype">void</span> SHA1(<span class="keyword">const</span> <span class="keywordtype">void</span> *dataIn, <span class="keywordtype">int</span> len, <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *hashout)
  95 <a name="l00073"></a>00073 {
  96 <a name="l00074"></a>00074         SHA_CTX ctx;
  97 <a name="l00075"></a>00075         SHA1_Init(&amp;ctx);
  98 <a name="l00076"></a>00076         SHA1_Update(&amp;ctx, dataIn, len);
  99 <a name="l00077"></a>00077         SHA1_Final(hashout, &amp;ctx);
 100 <a name="l00078"></a>00078 }
 101 <a name="l00079"></a>00079
 102 <a name="l00080"></a>00080 <span class="keywordtype">void</span> SHA1_Init(SHA_CTX *ctx) {
 103 <a name="l00081"></a>00081   <span class="keywordtype">int</span> i;
 104 <a name="l00082"></a>00082
 105 <a name="l00083"></a>00083   ctx-&gt;lenW = 0;
 106 <a name="l00084"></a>00084   ctx-&gt;sizeHi = ctx-&gt;sizeLo = 0;
 107 <a name="l00085"></a>00085
 108 <a name="l00086"></a>00086   <span class="comment">/* Initialize H with the magic constants (see FIPS180 for constants)</span>
 109 <a name="l00087"></a>00087 <span class="comment">   */</span>
 110 <a name="l00088"></a>00088   ctx-&gt;H[0] = 0x67452301;
 111 <a name="l00089"></a>00089   ctx-&gt;H[1] = 0xefcdab89;
 112 <a name="l00090"></a>00090   ctx-&gt;H[2] = 0x98badcfe;
 113 <a name="l00091"></a>00091   ctx-&gt;H[3] = 0x10325476;
 114 <a name="l00092"></a>00092   ctx-&gt;H[4] = 0xc3d2e1f0;
 115 <a name="l00093"></a>00093
 116 <a name="l00094"></a>00094   <span class="keywordflow">for</span> (i = 0; i &lt; 80; i++)
 117 <a name="l00095"></a>00095     ctx-&gt;W[i] = 0;
 118 <a name="l00096"></a>00096 }
 119 <a name="l00097"></a>00097
 120 <a name="l00098"></a>00098
 121 <a name="l00099"></a>00099 <span class="keywordtype">void</span> SHA1_Update(SHA_CTX *ctx, <span class="keyword">const</span> <span class="keywordtype">void</span> *_dataIn, <span class="keywordtype">int</span> len) {
 122 <a name="l00100"></a>00100   <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *dataIn = (<span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *) _dataIn;
 123 <a name="l00101"></a>00101   <span class="keywordtype">int</span> i;
 124 <a name="l00102"></a>00102
 125 <a name="l00103"></a>00103   <span class="comment">/* Read the data into W and process blocks as they get full</span>
 126 <a name="l00104"></a>00104 <span class="comment">   */</span>
 127 <a name="l00105"></a>00105   <span class="keywordflow">for</span> (i = 0; i &lt; len; i++) {
 128 <a name="l00106"></a>00106     ctx-&gt;W[ctx-&gt;lenW / 4] &lt;&lt;= 8;
 129 <a name="l00107"></a>00107     ctx-&gt;W[ctx-&gt;lenW / 4] |= (<span class="keywordtype">unsigned</span> int)dataIn[i];
 130 <a name="l00108"></a>00108     <span class="keywordflow">if</span> ((++ctx-&gt;lenW) % 64 == 0) {
 131 <a name="l00109"></a>00109       shaHashBlock(ctx);
 132 <a name="l00110"></a>00110       ctx-&gt;lenW = 0;
 133 <a name="l00111"></a>00111     }
 134 <a name="l00112"></a>00112     ctx-&gt;sizeLo += 8;
 135 <a name="l00113"></a>00113     ctx-&gt;sizeHi += (ctx-&gt;sizeLo &lt; 8);
 136 <a name="l00114"></a>00114   }
 137 <a name="l00115"></a>00115 }
 138 <a name="l00116"></a>00116
 139 <a name="l00117"></a>00117
 140 <a name="l00118"></a>00118 <span class="keywordtype">void</span> SHA1_Final(<span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> hashout[20], SHA_CTX *ctx) {
 141 <a name="l00119"></a>00119   <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> pad0x80 = 0x80;
 142 <a name="l00120"></a>00120   <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> pad0x00 = 0x00;
 143 <a name="l00121"></a>00121   <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> padlen[8];
 144 <a name="l00122"></a>00122   <span class="keywordtype">int</span> i;
 145 <a name="l00123"></a>00123
 146 <a name="l00124"></a>00124   <span class="comment">/* Pad with a binary 1 (e.g. 0x80), then zeroes, then length</span>
 147 <a name="l00125"></a>00125 <span class="comment">   */</span>
 148 <a name="l00126"></a>00126   padlen[0] = (<span class="keywordtype">unsigned</span> char)((ctx-&gt;sizeHi &gt;&gt; 24) &amp; 255);
 149 <a name="l00127"></a>00127   padlen[1] = (<span class="keywordtype">unsigned</span> char)((ctx-&gt;sizeHi &gt;&gt; 16) &amp; 255);
 150 <a name="l00128"></a>00128   padlen[2] = (<span class="keywordtype">unsigned</span> char)((ctx-&gt;sizeHi &gt;&gt; 8) &amp; 255);
 151 <a name="l00129"></a>00129   padlen[3] = (<span class="keywordtype">unsigned</span> char)((ctx-&gt;sizeHi &gt;&gt; 0) &amp; 255);
 152 <a name="l00130"></a>00130   padlen[4] = (<span class="keywordtype">unsigned</span> char)((ctx-&gt;sizeLo &gt;&gt; 24) &amp; 255);
 153 <a name="l00131"></a>00131   padlen[5] = (<span class="keywordtype">unsigned</span> char)((ctx-&gt;sizeLo &gt;&gt; 16) &amp; 255);
 154 <a name="l00132"></a>00132   padlen[6] = (<span class="keywordtype">unsigned</span> char)((ctx-&gt;sizeLo &gt;&gt; 8) &amp; 255);
 155 <a name="l00133"></a>00133   padlen[7] = (<span class="keywordtype">unsigned</span> char)((ctx-&gt;sizeLo &gt;&gt; 0) &amp; 255);
 156 <a name="l00134"></a>00134   SHA1_Update(ctx, &amp;pad0x80, 1);
 157 <a name="l00135"></a>00135   <span class="keywordflow">while</span> (ctx-&gt;lenW != 56)
 158 <a name="l00136"></a>00136     SHA1_Update(ctx, &amp;pad0x00, 1);
 159 <a name="l00137"></a>00137   SHA1_Update(ctx, padlen, 8);
 160 <a name="l00138"></a>00138
 161 <a name="l00139"></a>00139   <span class="comment">/* Output hash</span>
 162 <a name="l00140"></a>00140 <span class="comment">   */</span>
 163 <a name="l00141"></a>00141   <span class="keywordflow">for</span> (i = 0; i &lt; 20; i++) {
 164 <a name="l00142"></a>00142     hashout[i] = (<span class="keywordtype">unsigned</span> char)(ctx-&gt;H[i / 4] &gt;&gt; 24);
 165 <a name="l00143"></a>00143     ctx-&gt;H[i / 4] &lt;&lt;= 8;
 166 <a name="l00144"></a>00144   }
 167 <a name="l00145"></a>00145
 168 <a name="l00146"></a>00146   <span class="comment">/*</span>
 169 <a name="l00147"></a>00147 <span class="comment">   *  Re-initialize the context (also zeroizes contents)</span>
 170 <a name="l00148"></a>00148 <span class="comment">   */</span>
 171 <a name="l00149"></a>00149   SHA1_Init(ctx);
 172 <a name="l00150"></a>00150 }
 173 <a name="l00151"></a>00151
 174 <a name="l00152"></a>00152
 175 <a name="l00153"></a>00153 <span class="preprocessor">#define SHA_ROT(X,n) (((X) &lt;&lt; (n)) | ((X) &gt;&gt; (32-(n))))</span>
 176 <a name="l00154"></a>00154 <span class="preprocessor"></span>
 177 <a name="l00155"></a>00155 <span class="keyword">static</span> <span class="keywordtype">void</span> shaHashBlock(SHA_CTX *ctx) {
 178 <a name="l00156"></a>00156   <span class="keywordtype">int</span> t;
 179 <a name="l00157"></a>00157   <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> A,B,C,D,E,TEMP;
 180 <a name="l00158"></a>00158
 181 <a name="l00159"></a>00159   <span class="keywordflow">for</span> (t = 16; t &lt;= 79; t++)
 182 <a name="l00160"></a>00160     ctx-&gt;W[t] =
 183 <a name="l00161"></a>00161       SHA_ROT(ctx-&gt;W[t-3] ^ ctx-&gt;W[t-8] ^ ctx-&gt;W[t-14] ^ ctx-&gt;W[t-16], 1);
 184 <a name="l00162"></a>00162
 185 <a name="l00163"></a>00163   A = ctx-&gt;H[0];
 186 <a name="l00164"></a>00164   B = ctx-&gt;H[1];
 187 <a name="l00165"></a>00165   C = ctx-&gt;H[2];
 188 <a name="l00166"></a>00166   D = ctx-&gt;H[3];
 189 <a name="l00167"></a>00167   E = ctx-&gt;H[4];
 190 <a name="l00168"></a>00168
 191 <a name="l00169"></a>00169   <span class="keywordflow">for</span> (t = 0; t &lt;= 19; t++) {
 192 <a name="l00170"></a>00170     TEMP = SHA_ROT(A,5) + (((C^D)&amp;B)^D)     + E + ctx-&gt;W[t] + 0x5a827999;
 193 <a name="l00171"></a>00171     E = D; D = C; C = SHA_ROT(B, 30); B = A; A = TEMP;
 194 <a name="l00172"></a>00172   }
 195 <a name="l00173"></a>00173   <span class="keywordflow">for</span> (t = 20; t &lt;= 39; t++) {
 196 <a name="l00174"></a>00174     TEMP = SHA_ROT(A,5) + (B^C^D)           + E + ctx-&gt;W[t] + 0x6ed9eba1;
 197 <a name="l00175"></a>00175     E = D; D = C; C = SHA_ROT(B, 30); B = A; A = TEMP;
 198 <a name="l00176"></a>00176   }
 199 <a name="l00177"></a>00177   <span class="keywordflow">for</span> (t = 40; t &lt;= 59; t++) {
 200 <a name="l00178"></a>00178     TEMP = SHA_ROT(A,5) + ((B&amp;C)|(D&amp;(B|C))) + E + ctx-&gt;W[t] + 0x8f1bbcdc;
 201 <a name="l00179"></a>00179     E = D; D = C; C = SHA_ROT(B, 30); B = A; A = TEMP;
 202 <a name="l00180"></a>00180   }
 203 <a name="l00181"></a>00181   <span class="keywordflow">for</span> (t = 60; t &lt;= 79; t++) {
 204 <a name="l00182"></a>00182     TEMP = SHA_ROT(A,5) + (B^C^D)           + E + ctx-&gt;W[t] + 0xca62c1d6;
 205 <a name="l00183"></a>00183     E = D; D = C; C = SHA_ROT(B, 30); B = A; A = TEMP;
 206 <a name="l00184"></a>00184   }
 207 <a name="l00185"></a>00185
 208 <a name="l00186"></a>00186   ctx-&gt;H[0] += A;
 209 <a name="l00187"></a>00187   ctx-&gt;H[1] += B;
 210 <a name="l00188"></a>00188   ctx-&gt;H[2] += C;
 211 <a name="l00189"></a>00189   ctx-&gt;H[3] += D;
 212 <a name="l00190"></a>00190   ctx-&gt;H[4] += E;
 213 <a name="l00191"></a>00191 }
 214 <a name="l00192"></a>00192
 215 <a name="l00193"></a>00193 }
 216 <a name="l00194"></a>00194
 217 </pre></div></div>
 218 <hr size="1"><address style="text-align: right;"><small>Generated on Sat Aug 29 00:01:53 2009 for Barry by&nbsp;
 219 <a href="http://www.doxygen.org/index.html">
 220 <img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.6 </small></address>
 221 </body>
 222 </html>