mirror of
https://github.com/taigrr/arduinolibs
synced 2025-01-18 04:33:12 -08:00
366 lines
44 KiB
HTML
366 lines
44 KiB
HTML
<!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.6"/>
|
|
<title>Arduino Cryptography Library: Poly1305.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="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<script type="text/javascript">
|
|
$(document).ready(function() { searchBox.OnSelectItem(0); });
|
|
</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 style="padding-left: 0.5em;">
|
|
<div id="projectname">Arduino Cryptography Library
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.6 -->
|
|
<script type="text/javascript">
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
</script>
|
|
<div id="navrow1" class="tabs">
|
|
<ul class="tablist">
|
|
<li><a href="index.html"><span>Main Page</span></a></li>
|
|
<li><a href="pages.html"><span>Related Pages</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>
|
|
<li>
|
|
<div id="MSearchBox" class="MSearchBoxInactive">
|
|
<span class="left">
|
|
<img id="MSearchSelect" src="search/mag_sel.png"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
alt=""/>
|
|
<input type="text" id="MSearchField" value="Search" accesskey="S"
|
|
onfocus="searchBox.OnSearchFieldFocus(true)"
|
|
onblur="searchBox.OnSearchFieldFocus(false)"
|
|
onkeyup="searchBox.OnSearchFieldChange(event)"/>
|
|
</span><span class="right">
|
|
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
|
|
</span>
|
|
</div>
|
|
</li>
|
|
</ul>
|
|
</div>
|
|
<div id="navrow2" class="tabs2">
|
|
<ul class="tablist">
|
|
<li><a href="files.html"><span>File List</span></a></li>
|
|
</ul>
|
|
</div>
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark"> </span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark"> </span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark"> </span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark"> </span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark"> </span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark"> </span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark"> </span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark"> </span>Pages</a></div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div id="nav-path" class="navpath">
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_bc0718b08fb2015b8e59c47b2805f60c.html">libraries</a></li><li class="navelem"><a class="el" href="dir_e2ce51835550ba18edf07a8311722290.html">Crypto</a></li> </ul>
|
|
</div>
|
|
</div><!-- top -->
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">Poly1305.cpp</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">/*</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment"> * Copyright (C) 2015 Southern Storm Software, Pty Ltd.</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> *</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> * Permission is hereby granted, free of charge, to any person obtaining a</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> * copy of this software and associated documentation files (the "Software"),</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"> * to deal in the Software without restriction, including without limitation</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment"> * the rights to use, copy, modify, merge, publish, distribute, sublicense,</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment"> * and/or sell copies of the Software, and to permit persons to whom the</span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment"> * Software is furnished to do so, subject to the following conditions:</span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment"> *</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment"> * The above copyright notice and this permission notice shall be included</span></div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment"> * in all copies or substantial portions of the Software.</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment"> *</span></div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment"> * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment"> * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,</span></div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment"> * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE</span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment"> * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER</span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment"> * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING</span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment"> * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER</span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment"> * DEALINGS IN THE SOFTWARE.</span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> </div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "Poly1305.h"</span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "Crypto.h"</span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "utility/EndianUtil.h"</span></div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "utility/LimbUtil.h"</span></div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include <string.h></span></div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> </div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="comment">// Limb array with enough space for 130 bits.</span></div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="preprocessor">#define NUM_LIMBS_130BIT (NUM_LIMBS_128BIT + 1)</span></div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="preprocessor"></span></div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="comment">// Endian helper macros for limbs and arrays of limbs.</span></div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="preprocessor">#if BIGNUMBER_LIMB_8BIT</span></div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="preprocessor"></span><span class="preprocessor">#define lelimbtoh(x) (x)</span></div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="preprocessor"></span><span class="preprocessor">#define htolelimb(x) (x)</span></div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="preprocessor"></span><span class="preprocessor">#elif BIGNUMBER_LIMB_16BIT</span></div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="preprocessor"></span><span class="preprocessor">#define lelimbtoh(x) (le16toh((x)))</span></div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="preprocessor"></span><span class="preprocessor">#define htolelimb(x) (htole16((x)))</span></div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="preprocessor"></span><span class="preprocessor">#elif BIGNUMBER_LIMB_32BIT</span></div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="preprocessor"></span><span class="preprocessor">#define lelimbtoh(x) (le32toh((x)))</span></div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="preprocessor"></span><span class="preprocessor">#define htolelimb(x) (htole32((x)))</span></div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="preprocessor"></span><span class="preprocessor">#elif BIGNUMBER_LIMB_64BIT</span></div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="preprocessor"></span><span class="preprocessor">#define lelimbtoh(x) (le64toh((x)))</span></div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="preprocessor"></span><span class="preprocessor">#define htolelimb(x) (htole64((x)))</span></div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="preprocessor"></span><span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="preprocessor"></span><span class="preprocessor">#if defined(CRYPTO_LITTLE_ENDIAN)</span></div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="preprocessor"></span><span class="preprocessor">#define littleToHost(r,size) do { ; } while (0)</span></div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="preprocessor"></span><span class="preprocessor">#else</span></div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="preprocessor"></span><span class="preprocessor">#define littleToHost(r,size) \</span></div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="preprocessor"> do { \</span></div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="preprocessor"> for (uint8_t i = 0; i < (size); ++i) \</span></div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="preprocessor"> (r)[i] = lelimbtoh((r)[i]); \</span></div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="preprocessor"> } while (0)</span></div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="preprocessor"></span><span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="preprocessor"></span></div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"><a class="line" href="classPoly1305.html#a7d62e7cd2d67f1c72142580036066fa2"> 92</a></span> <a class="code" href="classPoly1305.html#a7d62e7cd2d67f1c72142580036066fa2">Poly1305::Poly1305</a>()</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span> {</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  state.chunkSize = 0;</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span> }</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span> </div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"><a class="line" href="classPoly1305.html#ac021b5ebbc123fa4c0ee36330472c25d"> 101</a></span> <a class="code" href="classPoly1305.html#ac021b5ebbc123fa4c0ee36330472c25d">Poly1305::~Poly1305</a>()</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span> {</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  clean(state);</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span> }</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span> </div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"><a class="line" href="classPoly1305.html#a544839403d0a19300c239708bc1e6ed8"> 113</a></span> <span class="keywordtype">void</span> <a class="code" href="classPoly1305.html#a544839403d0a19300c239708bc1e6ed8">Poly1305::reset</a>(<span class="keyword">const</span> <span class="keywordtype">void</span> *key)</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span> {</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="comment">// Copy the key into place and clear the bits we don't need.</span></div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  uint8_t *r = (uint8_t *)state.r;</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  memcpy(r, key, 16);</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  r[3] &= 0x0F;</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  r[4] &= 0xFC;</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  r[7] &= 0x0F;</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  r[8] &= 0xFC;</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  r[11] &= 0x0F;</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  r[12] &= 0xFC;</div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  r[15] &= 0x0F;</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span> </div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="comment">// Convert into little-endian if necessary.</span></div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  littleToHost(state.r, NUM_LIMBS_128BIT);</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span> </div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="comment">// Reset the hashing process.</span></div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  state.chunkSize = 0;</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  memset(state.h, 0, <span class="keyword">sizeof</span>(state.h));</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span> }</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span> </div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"><a class="line" href="classPoly1305.html#ae4e0b647ff93f501bd01459b1616557c"> 145</a></span> <span class="keywordtype">void</span> <a class="code" href="classPoly1305.html#ae4e0b647ff93f501bd01459b1616557c">Poly1305::update</a>(<span class="keyword">const</span> <span class="keywordtype">void</span> *data, <span class="keywordtype">size_t</span> len)</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span> {</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="comment">// Break the input up into 128-bit chunks and process each in turn.</span></div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keyword">const</span> uint8_t *d = (<span class="keyword">const</span> uint8_t *)data;</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keywordflow">while</span> (len > 0) {</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  uint8_t size = 16 - state.chunkSize;</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordflow">if</span> (size > len)</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  size = len;</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  memcpy(((uint8_t *)state.c) + state.chunkSize, d, size);</div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  state.chunkSize += size;</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  len -= size;</div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  d += size;</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordflow">if</span> (state.chunkSize == 16) {</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  littleToHost(state.c, NUM_LIMBS_128BIT);</div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  state.c[NUM_LIMBS_128BIT] = 1;</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  processChunk();</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  state.chunkSize = 0;</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  }</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  }</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span> }</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span> </div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"><a class="line" href="classPoly1305.html#aab3fa6c5f6fa7d9ca6c82bead38f499c"> 182</a></span> <span class="keywordtype">void</span> <a class="code" href="classPoly1305.html#aab3fa6c5f6fa7d9ca6c82bead38f499c">Poly1305::finalize</a>(<span class="keyword">const</span> <span class="keywordtype">void</span> *nonce, <span class="keywordtype">void</span> *token, <span class="keywordtype">size_t</span> len)</div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span> {</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  dlimb_t carry;</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  uint8_t i;</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  limb_t t[NUM_LIMBS_256BIT + 1];</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span> </div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="comment">// Pad and flush the final chunk.</span></div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">if</span> (state.chunkSize > 0) {</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  uint8_t *c = (uint8_t *)state.c;</div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  c[state.chunkSize] = 1;</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  memset(c + state.chunkSize + 1, 0, 16 - state.chunkSize - 1);</div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  littleToHost(state.c, NUM_LIMBS_128BIT);</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  state.c[NUM_LIMBS_128BIT] = 0;</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  processChunk();</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  }</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span> </div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="comment">// At this point, processChunk() has left h as a partially reduced</span></div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="comment">// result that is less than (2^130 - 5) * 6. Perform one more</span></div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="comment">// reduction and a trial subtraction to produce the final result.</span></div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span> </div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="comment">// Multiply the high bits of h by 5 and add them to the 130 low bits.</span></div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  carry = (dlimb_t)((state.h[NUM_LIMBS_128BIT] >> 2) +</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  (state.h[NUM_LIMBS_128BIT] & ~((limb_t)3)));</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  state.h[NUM_LIMBS_128BIT] &= 0x0003;</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keywordflow">for</span> (i = 0; i < NUM_LIMBS_128BIT; ++i) {</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  carry += state.h[i];</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  state.h[i] = (limb_t)carry;</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  carry >>= LIMB_BITS;</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  }</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  state.h[i] += (limb_t)carry;</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span> </div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="comment">// Subtract (2^130 - 5) from h by computing t = h + 5 - 2^130.</span></div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="comment">// The "minus 2^130" step is implicit.</span></div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  carry = 5;</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keywordflow">for</span> (i = 0; i < NUM_LIMBS_130BIT; ++i) {</div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  carry += state.h[i];</div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  t[i] = (limb_t)carry;</div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  carry >>= LIMB_BITS;</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  }</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span> </div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="comment">// Borrow occurs if bit 2^130 of the previous t result is zero.</span></div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="comment">// Carefully turn this into a selection mask so we can select either</span></div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="comment">// h or t as the final result. We don't care about the highest word</span></div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="comment">// of the result because we are about to drop it in the next step.</span></div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="comment">// We have to do it this way to avoid giving away any information</span></div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="comment">// about the value of h in the instruction timing.</span></div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  limb_t mask = (~((t[NUM_LIMBS_128BIT] >> 2) & 1)) + 1;</div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  limb_t nmask = ~mask;</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keywordflow">for</span> (i = 0; i < NUM_LIMBS_128BIT; ++i) {</div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  state.h[i] = (state.h[i] & nmask) | (t[i] & mask);</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  }</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span> </div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="comment">// Add the encrypted nonce and format the final hash.</span></div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  memcpy(state.c, nonce, 16);</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  littleToHost(state.c, NUM_LIMBS_128BIT);</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  carry = 0;</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keywordflow">for</span> (i = 0; i < NUM_LIMBS_128BIT; ++i) {</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  carry += state.h[i];</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  carry += state.c[i];</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  state.h[i] = htolelimb((limb_t)carry);</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  carry >>= LIMB_BITS;</div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  }</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keywordflow">if</span> (len > 16)</div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  len = 16;</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  memcpy(token, state.h, len);</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span> }</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span> </div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"><a class="line" href="classPoly1305.html#aaea2f40c1f22dcc2f8f690c793fb4388"> 254</a></span> <span class="keywordtype">void</span> <a class="code" href="classPoly1305.html#aaea2f40c1f22dcc2f8f690c793fb4388">Poly1305::pad</a>()</div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span> {</div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="keywordflow">if</span> (state.chunkSize != 0) {</div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  memset(((uint8_t *)state.c) + state.chunkSize, 0, 16 - state.chunkSize);</div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  littleToHost(state.c, NUM_LIMBS_128BIT);</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  state.c[NUM_LIMBS_128BIT] = 1;</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  processChunk();</div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  state.chunkSize = 0;</div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  }</div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span> }</div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span> </div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"><a class="line" href="classPoly1305.html#ae3f3392b9a2bd0f3472e7e50dd7e21dd"> 268</a></span> <span class="keywordtype">void</span> <a class="code" href="classPoly1305.html#ae3f3392b9a2bd0f3472e7e50dd7e21dd">Poly1305::clear</a>()</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span> {</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  clean(state);</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span> }</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span> </div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span> <span class="keywordtype">void</span> Poly1305::processChunk()</div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span> {</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  limb_t t[NUM_LIMBS_256BIT + 1];</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span> </div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="comment">// Compute h = ((h + c) * r) mod (2^130 - 5).</span></div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span> </div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="comment">// Start with h += c. We assume that h is less than (2^130 - 5) * 6</span></div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="comment">// and that c is less than 2^129, so the result will be less than 2^133.</span></div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  dlimb_t carry = 0;</div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  uint8_t i, j;</div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keywordflow">for</span> (i = 0; i < NUM_LIMBS_130BIT; ++i) {</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  carry += state.h[i];</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  carry += state.c[i];</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  state.h[i] = (limb_t)carry;</div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  carry >>= LIMB_BITS;</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  }</div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span> </div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="comment">// Multiply h by r. We know that r is less than 2^124 because the</span></div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="comment">// top 4 bits were AND-ed off by reset(). That makes h * r less</span></div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="comment">// than 2^257. Which is less than the (2^130 - 6)^2 we want for</span></div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="comment">// the modulo reduction step that follows.</span></div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  carry = 0;</div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  limb_t word = state.r[0];</div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keywordflow">for</span> (i = 0; i < NUM_LIMBS_130BIT; ++i) {</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  carry += ((dlimb_t)(state.h[i])) * word;</div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  t[i] = (limb_t)carry;</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  carry >>= LIMB_BITS;</div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  }</div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  t[NUM_LIMBS_130BIT] = (limb_t)carry;</div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keywordflow">for</span> (i = 1; i < NUM_LIMBS_128BIT; ++i) {</div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  word = state.r[i];</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  carry = 0;</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keywordflow">for</span> (j = 0; j < NUM_LIMBS_130BIT; ++j) {</div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  carry += ((dlimb_t)(state.h[j])) * word;</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  carry += t[i + j];</div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  t[i + j] = (limb_t)carry;</div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  carry >>= LIMB_BITS;</div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  }</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  t[i + NUM_LIMBS_130BIT] = (limb_t)carry;</div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  }</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span> </div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="comment">// Reduce h * r modulo (2^130 - 5) by multiplying the high 130 bits by 5</span></div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="comment">// and adding them to the low 130 bits. See the explaination in the</span></div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="comment">// comments for Curve25519::reduce() for a description of how this works.</span></div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  carry = ((dlimb_t)(t[NUM_LIMBS_128BIT] >> 2)) +</div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  (t[NUM_LIMBS_128BIT] & ~((limb_t)3));</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  t[NUM_LIMBS_128BIT] &= 0x0003;</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keywordflow">for</span> (i = 0; i < NUM_LIMBS_128BIT; ++i) {</div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="comment">// Shift the next word of t up by (LIMB_BITS - 2) bits and then</span></div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="comment">// multiply it by 5. Breaking it down, we can add the results</span></div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="comment">// of shifting up by LIMB_BITS and shifting up by (LIMB_BITS - 2).</span></div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="comment">// The main wrinkle here is that this can result in an intermediate</span></div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="comment">// carry that is (LIMB_BITS * 2 + 1) bits in size which doesn't</span></div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="comment">// fit within a dlimb_t variable. However, we can defer adding</span></div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="comment">// (word << LIMB_BITS) until after the "carry >>= LIMB_BITS" step</span></div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="comment">// because it won't affect the low bits of the carry.</span></div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  word = t[i + NUM_LIMBS_130BIT];</div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  carry += ((dlimb_t)word) << (LIMB_BITS - 2);</div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  carry += t[i];</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  state.h[i] = (limb_t)carry;</div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  carry >>= LIMB_BITS;</div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  carry += word;</div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  }</div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  state.h[i] = (limb_t)(carry + t[NUM_LIMBS_128BIT]);</div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span> </div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="comment">// At this point, h is either the answer of reducing modulo (2^130 - 5)</span></div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="comment">// or it is at most 5 subtractions away from the answer we want.</span></div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="comment">// Leave it as-is for now with h less than (2^130 - 5) * 6. It is</span></div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="comment">// still within a range where the next h * r step will not overflow.</span></div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span> }</div>
|
|
<div class="ttc" id="classPoly1305_html_aab3fa6c5f6fa7d9ca6c82bead38f499c"><div class="ttname"><a href="classPoly1305.html#aab3fa6c5f6fa7d9ca6c82bead38f499c">Poly1305::finalize</a></div><div class="ttdeci">void finalize(const void *nonce, void *token, size_t len)</div><div class="ttdoc">Finalizes the authentication process and returns the token. </div><div class="ttdef"><b>Definition:</b> <a href="Poly1305_8cpp_source.html#l00182">Poly1305.cpp:182</a></div></div>
|
|
<div class="ttc" id="classPoly1305_html_a544839403d0a19300c239708bc1e6ed8"><div class="ttname"><a href="classPoly1305.html#a544839403d0a19300c239708bc1e6ed8">Poly1305::reset</a></div><div class="ttdeci">void reset(const void *key)</div><div class="ttdoc">Resets the Poly1305 message authenticator for a new session. </div><div class="ttdef"><b>Definition:</b> <a href="Poly1305_8cpp_source.html#l00113">Poly1305.cpp:113</a></div></div>
|
|
<div class="ttc" id="classPoly1305_html_ae4e0b647ff93f501bd01459b1616557c"><div class="ttname"><a href="classPoly1305.html#ae4e0b647ff93f501bd01459b1616557c">Poly1305::update</a></div><div class="ttdeci">void update(const void *data, size_t len)</div><div class="ttdoc">Updates the message authenticator with more data. </div><div class="ttdef"><b>Definition:</b> <a href="Poly1305_8cpp_source.html#l00145">Poly1305.cpp:145</a></div></div>
|
|
<div class="ttc" id="classPoly1305_html_aaea2f40c1f22dcc2f8f690c793fb4388"><div class="ttname"><a href="classPoly1305.html#aaea2f40c1f22dcc2f8f690c793fb4388">Poly1305::pad</a></div><div class="ttdeci">void pad()</div><div class="ttdoc">Pads the input stream with zero bytes to a multiple of 16. </div><div class="ttdef"><b>Definition:</b> <a href="Poly1305_8cpp_source.html#l00254">Poly1305.cpp:254</a></div></div>
|
|
<div class="ttc" id="classPoly1305_html_ac021b5ebbc123fa4c0ee36330472c25d"><div class="ttname"><a href="classPoly1305.html#ac021b5ebbc123fa4c0ee36330472c25d">Poly1305::~Poly1305</a></div><div class="ttdeci">~Poly1305()</div><div class="ttdoc">Destroys this Poly1305 message authenticator after clearing all sensitive information. </div><div class="ttdef"><b>Definition:</b> <a href="Poly1305_8cpp_source.html#l00101">Poly1305.cpp:101</a></div></div>
|
|
<div class="ttc" id="classPoly1305_html_a7d62e7cd2d67f1c72142580036066fa2"><div class="ttname"><a href="classPoly1305.html#a7d62e7cd2d67f1c72142580036066fa2">Poly1305::Poly1305</a></div><div class="ttdeci">Poly1305()</div><div class="ttdoc">Constructs a new Poly1305 message authenticator. </div><div class="ttdef"><b>Definition:</b> <a href="Poly1305_8cpp_source.html#l00092">Poly1305.cpp:92</a></div></div>
|
|
<div class="ttc" id="classPoly1305_html_ae3f3392b9a2bd0f3472e7e50dd7e21dd"><div class="ttname"><a href="classPoly1305.html#ae3f3392b9a2bd0f3472e7e50dd7e21dd">Poly1305::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdoc">Clears the authenticator's state, removing all sensitive data. </div><div class="ttdef"><b>Definition:</b> <a href="Poly1305_8cpp_source.html#l00268">Poly1305.cpp:268</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
<!-- start footer part -->
|
|
<hr class="footer"/><address class="footer"><small>
|
|
Generated on Thu Apr 26 2018 06:55:48 for Arduino Cryptography Library by  <a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/>
|
|
</a> 1.8.6
|
|
</small></address>
|
|
</body>
|
|
</html>
|