Sophie

Sophie

distrib > Mageia > 7 > armv7hl > media > core-release > by-pkgid > 0a67b807a02637f2cae68649d519a89d > files > 2425

libcryptopp-devel-7.0.0-1.mga7.armv7hl.rpm

<!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"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.14"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Crypto++: md2.cpp Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Crypto++
   &#160;<span id="projectnumber">7.0</span>
   </div>
   <div id="projectbrief">Free&nbsp;C&#43;&#43;&nbsp;class&nbsp;library&nbsp;of&nbsp;cryptographic&nbsp;schemes</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.14 -->
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
  initMenu('',false,false,'search.php','Search');
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div class="header">
  <div class="headertitle">
<div class="title">md2.cpp</div>  </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">// md2.cpp - modified by Wei Dai from Andrew M. Kuchling&#39;s md2.c</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment">// The original code and all modifications are in the public domain.</span></div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;</div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment">// This is the original introductory comment:</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;</div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment">/*</span></div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment"> *  md2.c : MD2 hash algorithm.</span></div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment"> *</span></div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment"> * Part of the Python Cryptography Toolkit, version 1.1</span></div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment"> *</span></div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment"> * Distribute and use freely; there are no restrictions on further</span></div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment"> * dissemination and usage except those imposed by the laws of your</span></div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment"> * country of residence.</span></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment"> *</span></div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;</div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="pch_8h.html">pch.h</a>&quot;</span></div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="preprocessor">#define CRYPTOPP_ENABLE_NAMESPACE_WEAK 1</span></div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="md2_8h.html">md2.h</a>&quot;</span></div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;</div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;NAMESPACE_BEGIN(<a class="code" href="namespace_crypto_p_p.html">CryptoPP</a>)</div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="keyword">namespace </span>Weak1 {</div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;</div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;MD2::MD2()</div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;    : m_X(48), m_C(16), m_buf(16)</div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;{</div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;    Init();</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;}</div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;</div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;<span class="keywordtype">void</span> MD2::Init()</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;{</div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;    memset(m_X, 0, 48);</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;    memset(m_C, 0, 16);</div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;    memset(m_buf, 0, 16);</div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;    m_count = 0;</div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;}</div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;</div><div class="line"><a name="l00038"></a><span class="lineno"><a class="line" href="class_weak_1_1_m_d2.html#aed0c8db8407fb1c6c0014d68bedc10fd">   38</a></span>&#160;<span class="keywordtype">void</span> MD2::Update(<span class="keyword">const</span> byte *buf, <span class="keywordtype">size_t</span> len)</div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;{</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;    <span class="keyword">static</span> <span class="keyword">const</span> byte S[256] = {</div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;        41, 46, 67, 201, 162, 216, 124, 1, 61, 54, 84, 161, 236, 240, 6,</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;        19, 98, 167, 5, 243, 192, 199, 115, 140, 152, 147, 43, 217, 188,</div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;        76, 130, 202, 30, 155, 87, 60, 253, 212, 224, 22, 103, 66, 111, 24,</div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;        138, 23, 229, 18, 190, 78, 196, 214, 218, 158, 222, 73, 160, 251,</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;        245, 142, 187, 47, 238, 122, 169, 104, 121, 145, 21, 178, 7, 63,</div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;        148, 194, 16, 137, 11, 34, 95, 33, 128, 127, 93, 154, 90, 144, 50,</div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;        39, 53, 62, 204, 231, 191, 247, 151, 3, 255, 25, 48, 179, 72, 165,</div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;        181, 209, 215, 94, 146, 42, 172, 86, 170, 198, 79, 184, 56, 210,</div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;        150, 164, 125, 182, 118, 252, 107, 226, 156, 116, 4, 241, 69, 157,</div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;        112, 89, 100, 113, 135, 32, 134, 91, 207, 101, 230, 45, 168, 2, 27,</div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;        96, 37, 173, 174, 176, 185, 246, 28, 70, 97, 105, 52, 64, 126, 15,</div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;        85, 71, 163, 35, 221, 81, 175, 58, 195, 92, 249, 206, 186, 197,</div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;        234, 38, 44, 83, 13, 110, 133, 40, 132, 9, 211, 223, 205, 244, 65,</div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;        129, 77, 82, 106, 220, 55, 200, 108, 193, 171, 250, 36, 225, 123,</div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;        8, 12, 189, 177, 74, 120, 136, 149, 139, 227, 99, 232, 109, 233,</div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;        203, 213, 254, 59, 0, 29, 57, 242, 239, 183, 14, 102, 88, 208, 228,</div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;        166, 119, 114, 248, 235, 117, 75, 10, 49, 68, 80, 180, 143, 237,</div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;        31, 26, 219, 153, 141, 51, 159, 17, 131, 20</div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;    };</div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;    <span class="keywordflow">while</span> (len)</div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;    {</div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;        <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> L = <a class="code" href="misc_8h.html#ac8391e7d9d613a6c401787d2cdab1f51">UnsignedMin</a>(16U-m_count, len);</div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;        memcpy(m_buf+m_count, buf, L);</div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;        m_count+=L;</div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;        buf+=L;</div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;        len-=L;</div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;        <span class="keywordflow">if</span> (m_count==16)</div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;        {</div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;            byte t;</div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;            <span class="keywordtype">int</span> i,j;</div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;</div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;            m_count=0;</div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;            memcpy(m_X+16, m_buf, 16);</div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;            t=m_C[15];</div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;            <span class="keywordflow">for</span>(i=0; i&lt;16; i++)</div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;            {</div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;                m_X[32+i]=m_X[16+i]^m_X[i];</div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;                t=m_C[i]^=S[m_buf[i]^t];</div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;            }</div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;</div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;            t=0;</div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;            <span class="keywordflow">for</span>(i=0; i&lt;18; i++)</div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;            {</div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;                <span class="keywordflow">for</span>(j=0; j&lt;48; j+=8)</div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;                {</div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;                    t=m_X[j+0]^=S[t];</div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;                    t=m_X[j+1]^=S[t];</div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;                    t=m_X[j+2]^=S[t];</div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;                    t=m_X[j+3]^=S[t];</div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;                    t=m_X[j+4]^=S[t];</div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;                    t=m_X[j+5]^=S[t];</div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;                    t=m_X[j+6]^=S[t];</div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;                    t=m_X[j+7]^=S[t];</div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;                }</div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;                t = byte((t+i) &amp; 0xFF);</div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;            }</div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;        }</div><div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;    }</div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;}</div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;</div><div class="line"><a name="l00102"></a><span class="lineno"><a class="line" href="class_weak_1_1_m_d2.html#a52532c3a06bd29559db192738fca5944">  102</a></span>&#160;<span class="keywordtype">void</span> MD2::TruncatedFinal(byte *hash, <span class="keywordtype">size_t</span> size)</div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;{</div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;    ThrowIfInvalidTruncatedSize(size);</div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;</div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;    byte padding[16];</div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;    word32 padlen;</div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;    <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i;</div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;</div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;    padlen= 16-m_count;</div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;    <span class="keywordflow">for</span>(i=0; i&lt;padlen; i++) padding[i]=(byte)padlen;</div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;    Update(padding, padlen);</div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;    Update(m_C, 16);</div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;    memcpy(hash, m_X, size);</div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;</div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;    Init();</div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;}</div><div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;</div><div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;}</div><div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;NAMESPACE_END</div><div class="ttc" id="pch_8h_html"><div class="ttname"><a href="pch_8h.html">pch.h</a></div><div class="ttdoc">Precompiled header file. </div></div>
<div class="ttc" id="misc_8h_html_ac8391e7d9d613a6c401787d2cdab1f51"><div class="ttname"><a href="misc_8h.html#ac8391e7d9d613a6c401787d2cdab1f51">UnsignedMin</a></div><div class="ttdeci">const T1 UnsignedMin(const T1 &amp;a, const T2 &amp;b)</div><div class="ttdoc">Safe comparison of values that could be neagtive and incorrectly promoted. </div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l00546">misc.h:546</a></div></div>
<div class="ttc" id="namespace_crypto_p_p_html"><div class="ttname"><a href="namespace_crypto_p_p.html">CryptoPP</a></div><div class="ttdoc">Crypto++ library namespace. </div></div>
<div class="ttc" id="md2_8h_html"><div class="ttname"><a href="md2_8h.html">md2.h</a></div><div class="ttdoc">Classes for the MD2 message digest. </div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Sun Sep 16 2018 07:57:57 for Crypto++ by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.14
</small></address>
</body>
</html>