| <!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `/root/.cargo/registry/src/github.com-1ecc6299db9ec823/ring-0.16.20/src/arithmetic/bigint.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>bigint.rs - source</title><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../SourceSerif4-Regular.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../FiraSans-Regular.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../FiraSans-Medium.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../SourceCodePro-Regular.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../SourceSerif4-Bold.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../SourceCodePro-Semibold.ttf.woff2"><link rel="stylesheet" href="../../../normalize.css"><link rel="stylesheet" href="../../../rustdoc.css" id="mainThemeStyle"><link rel="stylesheet" href="../../../ayu.css" disabled><link rel="stylesheet" href="../../../dark.css" disabled><link rel="stylesheet" href="../../../light.css" id="themeStyle"><script id="default-settings" ></script><script src="../../../storage.js"></script><script defer src="../../../source-script.js"></script><script defer src="../../../source-files.js"></script><script defer src="../../../main.js"></script><noscript><link rel="stylesheet" href="../../../noscript.css"></noscript><link rel="alternate icon" type="image/png" href="../../../favicon-16x16.png"><link rel="alternate icon" type="image/png" href="../../../favicon-32x32.png"><link rel="icon" type="image/svg+xml" href="../../../favicon.svg"></head><body class="rustdoc source"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="sidebar"><a class="sidebar-logo" href="../../../ring/index.html"><div class="logo-container"><img class="rust-logo" src="../../../rust-logo.svg" alt="logo"></div></a></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../../ring/index.html"><img class="rust-logo" src="../../../rust-logo.svg" alt="logo"></a><form class="search-form"><div class="search-container"><span></span><input class="search-input" name="search" autocomplete="off" spellcheck="false" placeholder="Click or press ‘S’ to search, ‘?’ for more options…" type="search"><div id="help-button" title="help" tabindex="-1"><a href="../../../help.html">?</a></div><div id="settings-menu" tabindex="-1"><a href="../../../settings.html" title="settings"><img width="22" height="22" alt="Change settings" src="../../../wheel.svg"></a></div></div></form></nav><section id="main-content" class="content"><div class="example-wrap"><pre class="src-line-numbers"><span id="1">1</span> |
| <span id="2">2</span> |
| <span id="3">3</span> |
| <span id="4">4</span> |
| <span id="5">5</span> |
| <span id="6">6</span> |
| <span id="7">7</span> |
| <span id="8">8</span> |
| <span id="9">9</span> |
| <span id="10">10</span> |
| <span id="11">11</span> |
| <span id="12">12</span> |
| <span id="13">13</span> |
| <span id="14">14</span> |
| <span id="15">15</span> |
| <span id="16">16</span> |
| <span id="17">17</span> |
| <span id="18">18</span> |
| <span id="19">19</span> |
| <span id="20">20</span> |
| <span id="21">21</span> |
| <span id="22">22</span> |
| <span id="23">23</span> |
| <span id="24">24</span> |
| <span id="25">25</span> |
| <span id="26">26</span> |
| <span id="27">27</span> |
| <span id="28">28</span> |
| <span id="29">29</span> |
| <span id="30">30</span> |
| <span id="31">31</span> |
| <span id="32">32</span> |
| <span id="33">33</span> |
| <span id="34">34</span> |
| <span id="35">35</span> |
| <span id="36">36</span> |
| <span id="37">37</span> |
| <span id="38">38</span> |
| <span id="39">39</span> |
| <span id="40">40</span> |
| <span id="41">41</span> |
| <span id="42">42</span> |
| <span id="43">43</span> |
| <span id="44">44</span> |
| <span id="45">45</span> |
| <span id="46">46</span> |
| <span id="47">47</span> |
| <span id="48">48</span> |
| <span id="49">49</span> |
| <span id="50">50</span> |
| <span id="51">51</span> |
| <span id="52">52</span> |
| <span id="53">53</span> |
| <span id="54">54</span> |
| <span id="55">55</span> |
| <span id="56">56</span> |
| <span id="57">57</span> |
| <span id="58">58</span> |
| <span id="59">59</span> |
| <span id="60">60</span> |
| <span id="61">61</span> |
| <span id="62">62</span> |
| <span id="63">63</span> |
| <span id="64">64</span> |
| <span id="65">65</span> |
| <span id="66">66</span> |
| <span id="67">67</span> |
| <span id="68">68</span> |
| <span id="69">69</span> |
| <span id="70">70</span> |
| <span id="71">71</span> |
| <span id="72">72</span> |
| <span id="73">73</span> |
| <span id="74">74</span> |
| <span id="75">75</span> |
| <span id="76">76</span> |
| <span id="77">77</span> |
| <span id="78">78</span> |
| <span id="79">79</span> |
| <span id="80">80</span> |
| <span id="81">81</span> |
| <span id="82">82</span> |
| <span id="83">83</span> |
| <span id="84">84</span> |
| <span id="85">85</span> |
| <span id="86">86</span> |
| <span id="87">87</span> |
| <span id="88">88</span> |
| <span id="89">89</span> |
| <span id="90">90</span> |
| <span id="91">91</span> |
| <span id="92">92</span> |
| <span id="93">93</span> |
| <span id="94">94</span> |
| <span id="95">95</span> |
| <span id="96">96</span> |
| <span id="97">97</span> |
| <span id="98">98</span> |
| <span id="99">99</span> |
| <span id="100">100</span> |
| <span id="101">101</span> |
| <span id="102">102</span> |
| <span id="103">103</span> |
| <span id="104">104</span> |
| <span id="105">105</span> |
| <span id="106">106</span> |
| <span id="107">107</span> |
| <span id="108">108</span> |
| <span id="109">109</span> |
| <span id="110">110</span> |
| <span id="111">111</span> |
| <span id="112">112</span> |
| <span id="113">113</span> |
| <span id="114">114</span> |
| <span id="115">115</span> |
| <span id="116">116</span> |
| <span id="117">117</span> |
| <span id="118">118</span> |
| <span id="119">119</span> |
| <span id="120">120</span> |
| <span id="121">121</span> |
| <span id="122">122</span> |
| <span id="123">123</span> |
| <span id="124">124</span> |
| <span id="125">125</span> |
| <span id="126">126</span> |
| <span id="127">127</span> |
| <span id="128">128</span> |
| <span id="129">129</span> |
| <span id="130">130</span> |
| <span id="131">131</span> |
| <span id="132">132</span> |
| <span id="133">133</span> |
| <span id="134">134</span> |
| <span id="135">135</span> |
| <span id="136">136</span> |
| <span id="137">137</span> |
| <span id="138">138</span> |
| <span id="139">139</span> |
| <span id="140">140</span> |
| <span id="141">141</span> |
| <span id="142">142</span> |
| <span id="143">143</span> |
| <span id="144">144</span> |
| <span id="145">145</span> |
| <span id="146">146</span> |
| <span id="147">147</span> |
| <span id="148">148</span> |
| <span id="149">149</span> |
| <span id="150">150</span> |
| <span id="151">151</span> |
| <span id="152">152</span> |
| <span id="153">153</span> |
| <span id="154">154</span> |
| <span id="155">155</span> |
| <span id="156">156</span> |
| <span id="157">157</span> |
| <span id="158">158</span> |
| <span id="159">159</span> |
| <span id="160">160</span> |
| <span id="161">161</span> |
| <span id="162">162</span> |
| <span id="163">163</span> |
| <span id="164">164</span> |
| <span id="165">165</span> |
| <span id="166">166</span> |
| <span id="167">167</span> |
| <span id="168">168</span> |
| <span id="169">169</span> |
| <span id="170">170</span> |
| <span id="171">171</span> |
| <span id="172">172</span> |
| <span id="173">173</span> |
| <span id="174">174</span> |
| <span id="175">175</span> |
| <span id="176">176</span> |
| <span id="177">177</span> |
| <span id="178">178</span> |
| <span id="179">179</span> |
| <span id="180">180</span> |
| <span id="181">181</span> |
| <span id="182">182</span> |
| <span id="183">183</span> |
| <span id="184">184</span> |
| <span id="185">185</span> |
| <span id="186">186</span> |
| <span id="187">187</span> |
| <span id="188">188</span> |
| <span id="189">189</span> |
| <span id="190">190</span> |
| <span id="191">191</span> |
| <span id="192">192</span> |
| <span id="193">193</span> |
| <span id="194">194</span> |
| <span id="195">195</span> |
| <span id="196">196</span> |
| <span id="197">197</span> |
| <span id="198">198</span> |
| <span id="199">199</span> |
| <span id="200">200</span> |
| <span id="201">201</span> |
| <span id="202">202</span> |
| <span id="203">203</span> |
| <span id="204">204</span> |
| <span id="205">205</span> |
| <span id="206">206</span> |
| <span id="207">207</span> |
| <span id="208">208</span> |
| <span id="209">209</span> |
| <span id="210">210</span> |
| <span id="211">211</span> |
| <span id="212">212</span> |
| <span id="213">213</span> |
| <span id="214">214</span> |
| <span id="215">215</span> |
| <span id="216">216</span> |
| <span id="217">217</span> |
| <span id="218">218</span> |
| <span id="219">219</span> |
| <span id="220">220</span> |
| <span id="221">221</span> |
| <span id="222">222</span> |
| <span id="223">223</span> |
| <span id="224">224</span> |
| <span id="225">225</span> |
| <span id="226">226</span> |
| <span id="227">227</span> |
| <span id="228">228</span> |
| <span id="229">229</span> |
| <span id="230">230</span> |
| <span id="231">231</span> |
| <span id="232">232</span> |
| <span id="233">233</span> |
| <span id="234">234</span> |
| <span id="235">235</span> |
| <span id="236">236</span> |
| <span id="237">237</span> |
| <span id="238">238</span> |
| <span id="239">239</span> |
| <span id="240">240</span> |
| <span id="241">241</span> |
| <span id="242">242</span> |
| <span id="243">243</span> |
| <span id="244">244</span> |
| <span id="245">245</span> |
| <span id="246">246</span> |
| <span id="247">247</span> |
| <span id="248">248</span> |
| <span id="249">249</span> |
| <span id="250">250</span> |
| <span id="251">251</span> |
| <span id="252">252</span> |
| <span id="253">253</span> |
| <span id="254">254</span> |
| <span id="255">255</span> |
| <span id="256">256</span> |
| <span id="257">257</span> |
| <span id="258">258</span> |
| <span id="259">259</span> |
| <span id="260">260</span> |
| <span id="261">261</span> |
| <span id="262">262</span> |
| <span id="263">263</span> |
| <span id="264">264</span> |
| <span id="265">265</span> |
| <span id="266">266</span> |
| <span id="267">267</span> |
| <span id="268">268</span> |
| <span id="269">269</span> |
| <span id="270">270</span> |
| <span id="271">271</span> |
| <span id="272">272</span> |
| <span id="273">273</span> |
| <span id="274">274</span> |
| <span id="275">275</span> |
| <span id="276">276</span> |
| <span id="277">277</span> |
| <span id="278">278</span> |
| <span id="279">279</span> |
| <span id="280">280</span> |
| <span id="281">281</span> |
| <span id="282">282</span> |
| <span id="283">283</span> |
| <span id="284">284</span> |
| <span id="285">285</span> |
| <span id="286">286</span> |
| <span id="287">287</span> |
| <span id="288">288</span> |
| <span id="289">289</span> |
| <span id="290">290</span> |
| <span id="291">291</span> |
| <span id="292">292</span> |
| <span id="293">293</span> |
| <span id="294">294</span> |
| <span id="295">295</span> |
| <span id="296">296</span> |
| <span id="297">297</span> |
| <span id="298">298</span> |
| <span id="299">299</span> |
| <span id="300">300</span> |
| <span id="301">301</span> |
| <span id="302">302</span> |
| <span id="303">303</span> |
| <span id="304">304</span> |
| <span id="305">305</span> |
| <span id="306">306</span> |
| <span id="307">307</span> |
| <span id="308">308</span> |
| <span id="309">309</span> |
| <span id="310">310</span> |
| <span id="311">311</span> |
| <span id="312">312</span> |
| <span id="313">313</span> |
| <span id="314">314</span> |
| <span id="315">315</span> |
| <span id="316">316</span> |
| <span id="317">317</span> |
| <span id="318">318</span> |
| <span id="319">319</span> |
| <span id="320">320</span> |
| <span id="321">321</span> |
| <span id="322">322</span> |
| <span id="323">323</span> |
| <span id="324">324</span> |
| <span id="325">325</span> |
| <span id="326">326</span> |
| <span id="327">327</span> |
| <span id="328">328</span> |
| <span id="329">329</span> |
| <span id="330">330</span> |
| <span id="331">331</span> |
| <span id="332">332</span> |
| <span id="333">333</span> |
| <span id="334">334</span> |
| <span id="335">335</span> |
| <span id="336">336</span> |
| <span id="337">337</span> |
| <span id="338">338</span> |
| <span id="339">339</span> |
| <span id="340">340</span> |
| <span id="341">341</span> |
| <span id="342">342</span> |
| <span id="343">343</span> |
| <span id="344">344</span> |
| <span id="345">345</span> |
| <span id="346">346</span> |
| <span id="347">347</span> |
| <span id="348">348</span> |
| <span id="349">349</span> |
| <span id="350">350</span> |
| <span id="351">351</span> |
| <span id="352">352</span> |
| <span id="353">353</span> |
| <span id="354">354</span> |
| <span id="355">355</span> |
| <span id="356">356</span> |
| <span id="357">357</span> |
| <span id="358">358</span> |
| <span id="359">359</span> |
| <span id="360">360</span> |
| <span id="361">361</span> |
| <span id="362">362</span> |
| <span id="363">363</span> |
| <span id="364">364</span> |
| <span id="365">365</span> |
| <span id="366">366</span> |
| <span id="367">367</span> |
| <span id="368">368</span> |
| <span id="369">369</span> |
| <span id="370">370</span> |
| <span id="371">371</span> |
| <span id="372">372</span> |
| <span id="373">373</span> |
| <span id="374">374</span> |
| <span id="375">375</span> |
| <span id="376">376</span> |
| <span id="377">377</span> |
| <span id="378">378</span> |
| <span id="379">379</span> |
| <span id="380">380</span> |
| <span id="381">381</span> |
| <span id="382">382</span> |
| <span id="383">383</span> |
| <span id="384">384</span> |
| <span id="385">385</span> |
| <span id="386">386</span> |
| <span id="387">387</span> |
| <span id="388">388</span> |
| <span id="389">389</span> |
| <span id="390">390</span> |
| <span id="391">391</span> |
| <span id="392">392</span> |
| <span id="393">393</span> |
| <span id="394">394</span> |
| <span id="395">395</span> |
| <span id="396">396</span> |
| <span id="397">397</span> |
| <span id="398">398</span> |
| <span id="399">399</span> |
| <span id="400">400</span> |
| <span id="401">401</span> |
| <span id="402">402</span> |
| <span id="403">403</span> |
| <span id="404">404</span> |
| <span id="405">405</span> |
| <span id="406">406</span> |
| <span id="407">407</span> |
| <span id="408">408</span> |
| <span id="409">409</span> |
| <span id="410">410</span> |
| <span id="411">411</span> |
| <span id="412">412</span> |
| <span id="413">413</span> |
| <span id="414">414</span> |
| <span id="415">415</span> |
| <span id="416">416</span> |
| <span id="417">417</span> |
| <span id="418">418</span> |
| <span id="419">419</span> |
| <span id="420">420</span> |
| <span id="421">421</span> |
| <span id="422">422</span> |
| <span id="423">423</span> |
| <span id="424">424</span> |
| <span id="425">425</span> |
| <span id="426">426</span> |
| <span id="427">427</span> |
| <span id="428">428</span> |
| <span id="429">429</span> |
| <span id="430">430</span> |
| <span id="431">431</span> |
| <span id="432">432</span> |
| <span id="433">433</span> |
| <span id="434">434</span> |
| <span id="435">435</span> |
| <span id="436">436</span> |
| <span id="437">437</span> |
| <span id="438">438</span> |
| <span id="439">439</span> |
| <span id="440">440</span> |
| <span id="441">441</span> |
| <span id="442">442</span> |
| <span id="443">443</span> |
| <span id="444">444</span> |
| <span id="445">445</span> |
| <span id="446">446</span> |
| <span id="447">447</span> |
| <span id="448">448</span> |
| <span id="449">449</span> |
| <span id="450">450</span> |
| <span id="451">451</span> |
| <span id="452">452</span> |
| <span id="453">453</span> |
| <span id="454">454</span> |
| <span id="455">455</span> |
| <span id="456">456</span> |
| <span id="457">457</span> |
| <span id="458">458</span> |
| <span id="459">459</span> |
| <span id="460">460</span> |
| <span id="461">461</span> |
| <span id="462">462</span> |
| <span id="463">463</span> |
| <span id="464">464</span> |
| <span id="465">465</span> |
| <span id="466">466</span> |
| <span id="467">467</span> |
| <span id="468">468</span> |
| <span id="469">469</span> |
| <span id="470">470</span> |
| <span id="471">471</span> |
| <span id="472">472</span> |
| <span id="473">473</span> |
| <span id="474">474</span> |
| <span id="475">475</span> |
| <span id="476">476</span> |
| <span id="477">477</span> |
| <span id="478">478</span> |
| <span id="479">479</span> |
| <span id="480">480</span> |
| <span id="481">481</span> |
| <span id="482">482</span> |
| <span id="483">483</span> |
| <span id="484">484</span> |
| <span id="485">485</span> |
| <span id="486">486</span> |
| <span id="487">487</span> |
| <span id="488">488</span> |
| <span id="489">489</span> |
| <span id="490">490</span> |
| <span id="491">491</span> |
| <span id="492">492</span> |
| <span id="493">493</span> |
| <span id="494">494</span> |
| <span id="495">495</span> |
| <span id="496">496</span> |
| <span id="497">497</span> |
| <span id="498">498</span> |
| <span id="499">499</span> |
| <span id="500">500</span> |
| <span id="501">501</span> |
| <span id="502">502</span> |
| <span id="503">503</span> |
| <span id="504">504</span> |
| <span id="505">505</span> |
| <span id="506">506</span> |
| <span id="507">507</span> |
| <span id="508">508</span> |
| <span id="509">509</span> |
| <span id="510">510</span> |
| <span id="511">511</span> |
| <span id="512">512</span> |
| <span id="513">513</span> |
| <span id="514">514</span> |
| <span id="515">515</span> |
| <span id="516">516</span> |
| <span id="517">517</span> |
| <span id="518">518</span> |
| <span id="519">519</span> |
| <span id="520">520</span> |
| <span id="521">521</span> |
| <span id="522">522</span> |
| <span id="523">523</span> |
| <span id="524">524</span> |
| <span id="525">525</span> |
| <span id="526">526</span> |
| <span id="527">527</span> |
| <span id="528">528</span> |
| <span id="529">529</span> |
| <span id="530">530</span> |
| <span id="531">531</span> |
| <span id="532">532</span> |
| <span id="533">533</span> |
| <span id="534">534</span> |
| <span id="535">535</span> |
| <span id="536">536</span> |
| <span id="537">537</span> |
| <span id="538">538</span> |
| <span id="539">539</span> |
| <span id="540">540</span> |
| <span id="541">541</span> |
| <span id="542">542</span> |
| <span id="543">543</span> |
| <span id="544">544</span> |
| <span id="545">545</span> |
| <span id="546">546</span> |
| <span id="547">547</span> |
| <span id="548">548</span> |
| <span id="549">549</span> |
| <span id="550">550</span> |
| <span id="551">551</span> |
| <span id="552">552</span> |
| <span id="553">553</span> |
| <span id="554">554</span> |
| <span id="555">555</span> |
| <span id="556">556</span> |
| <span id="557">557</span> |
| <span id="558">558</span> |
| <span id="559">559</span> |
| <span id="560">560</span> |
| <span id="561">561</span> |
| <span id="562">562</span> |
| <span id="563">563</span> |
| <span id="564">564</span> |
| <span id="565">565</span> |
| <span id="566">566</span> |
| <span id="567">567</span> |
| <span id="568">568</span> |
| <span id="569">569</span> |
| <span id="570">570</span> |
| <span id="571">571</span> |
| <span id="572">572</span> |
| <span id="573">573</span> |
| <span id="574">574</span> |
| <span id="575">575</span> |
| <span id="576">576</span> |
| <span id="577">577</span> |
| <span id="578">578</span> |
| <span id="579">579</span> |
| <span id="580">580</span> |
| <span id="581">581</span> |
| <span id="582">582</span> |
| <span id="583">583</span> |
| <span id="584">584</span> |
| <span id="585">585</span> |
| <span id="586">586</span> |
| <span id="587">587</span> |
| <span id="588">588</span> |
| <span id="589">589</span> |
| <span id="590">590</span> |
| <span id="591">591</span> |
| <span id="592">592</span> |
| <span id="593">593</span> |
| <span id="594">594</span> |
| <span id="595">595</span> |
| <span id="596">596</span> |
| <span id="597">597</span> |
| <span id="598">598</span> |
| <span id="599">599</span> |
| <span id="600">600</span> |
| <span id="601">601</span> |
| <span id="602">602</span> |
| <span id="603">603</span> |
| <span id="604">604</span> |
| <span id="605">605</span> |
| <span id="606">606</span> |
| <span id="607">607</span> |
| <span id="608">608</span> |
| <span id="609">609</span> |
| <span id="610">610</span> |
| <span id="611">611</span> |
| <span id="612">612</span> |
| <span id="613">613</span> |
| <span id="614">614</span> |
| <span id="615">615</span> |
| <span id="616">616</span> |
| <span id="617">617</span> |
| <span id="618">618</span> |
| <span id="619">619</span> |
| <span id="620">620</span> |
| <span id="621">621</span> |
| <span id="622">622</span> |
| <span id="623">623</span> |
| <span id="624">624</span> |
| <span id="625">625</span> |
| <span id="626">626</span> |
| <span id="627">627</span> |
| <span id="628">628</span> |
| <span id="629">629</span> |
| <span id="630">630</span> |
| <span id="631">631</span> |
| <span id="632">632</span> |
| <span id="633">633</span> |
| <span id="634">634</span> |
| <span id="635">635</span> |
| <span id="636">636</span> |
| <span id="637">637</span> |
| <span id="638">638</span> |
| <span id="639">639</span> |
| <span id="640">640</span> |
| <span id="641">641</span> |
| <span id="642">642</span> |
| <span id="643">643</span> |
| <span id="644">644</span> |
| <span id="645">645</span> |
| <span id="646">646</span> |
| <span id="647">647</span> |
| <span id="648">648</span> |
| <span id="649">649</span> |
| <span id="650">650</span> |
| <span id="651">651</span> |
| <span id="652">652</span> |
| <span id="653">653</span> |
| <span id="654">654</span> |
| <span id="655">655</span> |
| <span id="656">656</span> |
| <span id="657">657</span> |
| <span id="658">658</span> |
| <span id="659">659</span> |
| <span id="660">660</span> |
| <span id="661">661</span> |
| <span id="662">662</span> |
| <span id="663">663</span> |
| <span id="664">664</span> |
| <span id="665">665</span> |
| <span id="666">666</span> |
| <span id="667">667</span> |
| <span id="668">668</span> |
| <span id="669">669</span> |
| <span id="670">670</span> |
| <span id="671">671</span> |
| <span id="672">672</span> |
| <span id="673">673</span> |
| <span id="674">674</span> |
| <span id="675">675</span> |
| <span id="676">676</span> |
| <span id="677">677</span> |
| <span id="678">678</span> |
| <span id="679">679</span> |
| <span id="680">680</span> |
| <span id="681">681</span> |
| <span id="682">682</span> |
| <span id="683">683</span> |
| <span id="684">684</span> |
| <span id="685">685</span> |
| <span id="686">686</span> |
| <span id="687">687</span> |
| <span id="688">688</span> |
| <span id="689">689</span> |
| <span id="690">690</span> |
| <span id="691">691</span> |
| <span id="692">692</span> |
| <span id="693">693</span> |
| <span id="694">694</span> |
| <span id="695">695</span> |
| <span id="696">696</span> |
| <span id="697">697</span> |
| <span id="698">698</span> |
| <span id="699">699</span> |
| <span id="700">700</span> |
| <span id="701">701</span> |
| <span id="702">702</span> |
| <span id="703">703</span> |
| <span id="704">704</span> |
| <span id="705">705</span> |
| <span id="706">706</span> |
| <span id="707">707</span> |
| <span id="708">708</span> |
| <span id="709">709</span> |
| <span id="710">710</span> |
| <span id="711">711</span> |
| <span id="712">712</span> |
| <span id="713">713</span> |
| <span id="714">714</span> |
| <span id="715">715</span> |
| <span id="716">716</span> |
| <span id="717">717</span> |
| <span id="718">718</span> |
| <span id="719">719</span> |
| <span id="720">720</span> |
| <span id="721">721</span> |
| <span id="722">722</span> |
| <span id="723">723</span> |
| <span id="724">724</span> |
| <span id="725">725</span> |
| <span id="726">726</span> |
| <span id="727">727</span> |
| <span id="728">728</span> |
| <span id="729">729</span> |
| <span id="730">730</span> |
| <span id="731">731</span> |
| <span id="732">732</span> |
| <span id="733">733</span> |
| <span id="734">734</span> |
| <span id="735">735</span> |
| <span id="736">736</span> |
| <span id="737">737</span> |
| <span id="738">738</span> |
| <span id="739">739</span> |
| <span id="740">740</span> |
| <span id="741">741</span> |
| <span id="742">742</span> |
| <span id="743">743</span> |
| <span id="744">744</span> |
| <span id="745">745</span> |
| <span id="746">746</span> |
| <span id="747">747</span> |
| <span id="748">748</span> |
| <span id="749">749</span> |
| <span id="750">750</span> |
| <span id="751">751</span> |
| <span id="752">752</span> |
| <span id="753">753</span> |
| <span id="754">754</span> |
| <span id="755">755</span> |
| <span id="756">756</span> |
| <span id="757">757</span> |
| <span id="758">758</span> |
| <span id="759">759</span> |
| <span id="760">760</span> |
| <span id="761">761</span> |
| <span id="762">762</span> |
| <span id="763">763</span> |
| <span id="764">764</span> |
| <span id="765">765</span> |
| <span id="766">766</span> |
| <span id="767">767</span> |
| <span id="768">768</span> |
| <span id="769">769</span> |
| <span id="770">770</span> |
| <span id="771">771</span> |
| <span id="772">772</span> |
| <span id="773">773</span> |
| <span id="774">774</span> |
| <span id="775">775</span> |
| <span id="776">776</span> |
| <span id="777">777</span> |
| <span id="778">778</span> |
| <span id="779">779</span> |
| <span id="780">780</span> |
| <span id="781">781</span> |
| <span id="782">782</span> |
| <span id="783">783</span> |
| <span id="784">784</span> |
| <span id="785">785</span> |
| <span id="786">786</span> |
| <span id="787">787</span> |
| <span id="788">788</span> |
| <span id="789">789</span> |
| <span id="790">790</span> |
| <span id="791">791</span> |
| <span id="792">792</span> |
| <span id="793">793</span> |
| <span id="794">794</span> |
| <span id="795">795</span> |
| <span id="796">796</span> |
| <span id="797">797</span> |
| <span id="798">798</span> |
| <span id="799">799</span> |
| <span id="800">800</span> |
| <span id="801">801</span> |
| <span id="802">802</span> |
| <span id="803">803</span> |
| <span id="804">804</span> |
| <span id="805">805</span> |
| <span id="806">806</span> |
| <span id="807">807</span> |
| <span id="808">808</span> |
| <span id="809">809</span> |
| <span id="810">810</span> |
| <span id="811">811</span> |
| <span id="812">812</span> |
| <span id="813">813</span> |
| <span id="814">814</span> |
| <span id="815">815</span> |
| <span id="816">816</span> |
| <span id="817">817</span> |
| <span id="818">818</span> |
| <span id="819">819</span> |
| <span id="820">820</span> |
| <span id="821">821</span> |
| <span id="822">822</span> |
| <span id="823">823</span> |
| <span id="824">824</span> |
| <span id="825">825</span> |
| <span id="826">826</span> |
| <span id="827">827</span> |
| <span id="828">828</span> |
| <span id="829">829</span> |
| <span id="830">830</span> |
| <span id="831">831</span> |
| <span id="832">832</span> |
| <span id="833">833</span> |
| <span id="834">834</span> |
| <span id="835">835</span> |
| <span id="836">836</span> |
| <span id="837">837</span> |
| <span id="838">838</span> |
| <span id="839">839</span> |
| <span id="840">840</span> |
| <span id="841">841</span> |
| <span id="842">842</span> |
| <span id="843">843</span> |
| <span id="844">844</span> |
| <span id="845">845</span> |
| <span id="846">846</span> |
| <span id="847">847</span> |
| <span id="848">848</span> |
| <span id="849">849</span> |
| <span id="850">850</span> |
| <span id="851">851</span> |
| <span id="852">852</span> |
| <span id="853">853</span> |
| <span id="854">854</span> |
| <span id="855">855</span> |
| <span id="856">856</span> |
| <span id="857">857</span> |
| <span id="858">858</span> |
| <span id="859">859</span> |
| <span id="860">860</span> |
| <span id="861">861</span> |
| <span id="862">862</span> |
| <span id="863">863</span> |
| <span id="864">864</span> |
| <span id="865">865</span> |
| <span id="866">866</span> |
| <span id="867">867</span> |
| <span id="868">868</span> |
| <span id="869">869</span> |
| <span id="870">870</span> |
| <span id="871">871</span> |
| <span id="872">872</span> |
| <span id="873">873</span> |
| <span id="874">874</span> |
| <span id="875">875</span> |
| <span id="876">876</span> |
| <span id="877">877</span> |
| <span id="878">878</span> |
| <span id="879">879</span> |
| <span id="880">880</span> |
| <span id="881">881</span> |
| <span id="882">882</span> |
| <span id="883">883</span> |
| <span id="884">884</span> |
| <span id="885">885</span> |
| <span id="886">886</span> |
| <span id="887">887</span> |
| <span id="888">888</span> |
| <span id="889">889</span> |
| <span id="890">890</span> |
| <span id="891">891</span> |
| <span id="892">892</span> |
| <span id="893">893</span> |
| <span id="894">894</span> |
| <span id="895">895</span> |
| <span id="896">896</span> |
| <span id="897">897</span> |
| <span id="898">898</span> |
| <span id="899">899</span> |
| <span id="900">900</span> |
| <span id="901">901</span> |
| <span id="902">902</span> |
| <span id="903">903</span> |
| <span id="904">904</span> |
| <span id="905">905</span> |
| <span id="906">906</span> |
| <span id="907">907</span> |
| <span id="908">908</span> |
| <span id="909">909</span> |
| <span id="910">910</span> |
| <span id="911">911</span> |
| <span id="912">912</span> |
| <span id="913">913</span> |
| <span id="914">914</span> |
| <span id="915">915</span> |
| <span id="916">916</span> |
| <span id="917">917</span> |
| <span id="918">918</span> |
| <span id="919">919</span> |
| <span id="920">920</span> |
| <span id="921">921</span> |
| <span id="922">922</span> |
| <span id="923">923</span> |
| <span id="924">924</span> |
| <span id="925">925</span> |
| <span id="926">926</span> |
| <span id="927">927</span> |
| <span id="928">928</span> |
| <span id="929">929</span> |
| <span id="930">930</span> |
| <span id="931">931</span> |
| <span id="932">932</span> |
| <span id="933">933</span> |
| <span id="934">934</span> |
| <span id="935">935</span> |
| <span id="936">936</span> |
| <span id="937">937</span> |
| <span id="938">938</span> |
| <span id="939">939</span> |
| <span id="940">940</span> |
| <span id="941">941</span> |
| <span id="942">942</span> |
| <span id="943">943</span> |
| <span id="944">944</span> |
| <span id="945">945</span> |
| <span id="946">946</span> |
| <span id="947">947</span> |
| <span id="948">948</span> |
| <span id="949">949</span> |
| <span id="950">950</span> |
| <span id="951">951</span> |
| <span id="952">952</span> |
| <span id="953">953</span> |
| <span id="954">954</span> |
| <span id="955">955</span> |
| <span id="956">956</span> |
| <span id="957">957</span> |
| <span id="958">958</span> |
| <span id="959">959</span> |
| <span id="960">960</span> |
| <span id="961">961</span> |
| <span id="962">962</span> |
| <span id="963">963</span> |
| <span id="964">964</span> |
| <span id="965">965</span> |
| <span id="966">966</span> |
| <span id="967">967</span> |
| <span id="968">968</span> |
| <span id="969">969</span> |
| <span id="970">970</span> |
| <span id="971">971</span> |
| <span id="972">972</span> |
| <span id="973">973</span> |
| <span id="974">974</span> |
| <span id="975">975</span> |
| <span id="976">976</span> |
| <span id="977">977</span> |
| <span id="978">978</span> |
| <span id="979">979</span> |
| <span id="980">980</span> |
| <span id="981">981</span> |
| <span id="982">982</span> |
| <span id="983">983</span> |
| <span id="984">984</span> |
| <span id="985">985</span> |
| <span id="986">986</span> |
| <span id="987">987</span> |
| <span id="988">988</span> |
| <span id="989">989</span> |
| <span id="990">990</span> |
| <span id="991">991</span> |
| <span id="992">992</span> |
| <span id="993">993</span> |
| <span id="994">994</span> |
| <span id="995">995</span> |
| <span id="996">996</span> |
| <span id="997">997</span> |
| <span id="998">998</span> |
| <span id="999">999</span> |
| <span id="1000">1000</span> |
| <span id="1001">1001</span> |
| <span id="1002">1002</span> |
| <span id="1003">1003</span> |
| <span id="1004">1004</span> |
| <span id="1005">1005</span> |
| <span id="1006">1006</span> |
| <span id="1007">1007</span> |
| <span id="1008">1008</span> |
| <span id="1009">1009</span> |
| <span id="1010">1010</span> |
| <span id="1011">1011</span> |
| <span id="1012">1012</span> |
| <span id="1013">1013</span> |
| <span id="1014">1014</span> |
| <span id="1015">1015</span> |
| <span id="1016">1016</span> |
| <span id="1017">1017</span> |
| <span id="1018">1018</span> |
| <span id="1019">1019</span> |
| <span id="1020">1020</span> |
| <span id="1021">1021</span> |
| <span id="1022">1022</span> |
| <span id="1023">1023</span> |
| <span id="1024">1024</span> |
| <span id="1025">1025</span> |
| <span id="1026">1026</span> |
| <span id="1027">1027</span> |
| <span id="1028">1028</span> |
| <span id="1029">1029</span> |
| <span id="1030">1030</span> |
| <span id="1031">1031</span> |
| <span id="1032">1032</span> |
| <span id="1033">1033</span> |
| <span id="1034">1034</span> |
| <span id="1035">1035</span> |
| <span id="1036">1036</span> |
| <span id="1037">1037</span> |
| <span id="1038">1038</span> |
| <span id="1039">1039</span> |
| <span id="1040">1040</span> |
| <span id="1041">1041</span> |
| <span id="1042">1042</span> |
| <span id="1043">1043</span> |
| <span id="1044">1044</span> |
| <span id="1045">1045</span> |
| <span id="1046">1046</span> |
| <span id="1047">1047</span> |
| <span id="1048">1048</span> |
| <span id="1049">1049</span> |
| <span id="1050">1050</span> |
| <span id="1051">1051</span> |
| <span id="1052">1052</span> |
| <span id="1053">1053</span> |
| <span id="1054">1054</span> |
| <span id="1055">1055</span> |
| <span id="1056">1056</span> |
| <span id="1057">1057</span> |
| <span id="1058">1058</span> |
| <span id="1059">1059</span> |
| <span id="1060">1060</span> |
| <span id="1061">1061</span> |
| <span id="1062">1062</span> |
| <span id="1063">1063</span> |
| <span id="1064">1064</span> |
| <span id="1065">1065</span> |
| <span id="1066">1066</span> |
| <span id="1067">1067</span> |
| <span id="1068">1068</span> |
| <span id="1069">1069</span> |
| <span id="1070">1070</span> |
| <span id="1071">1071</span> |
| <span id="1072">1072</span> |
| <span id="1073">1073</span> |
| <span id="1074">1074</span> |
| <span id="1075">1075</span> |
| <span id="1076">1076</span> |
| <span id="1077">1077</span> |
| <span id="1078">1078</span> |
| <span id="1079">1079</span> |
| <span id="1080">1080</span> |
| <span id="1081">1081</span> |
| <span id="1082">1082</span> |
| <span id="1083">1083</span> |
| <span id="1084">1084</span> |
| <span id="1085">1085</span> |
| <span id="1086">1086</span> |
| <span id="1087">1087</span> |
| <span id="1088">1088</span> |
| <span id="1089">1089</span> |
| <span id="1090">1090</span> |
| <span id="1091">1091</span> |
| <span id="1092">1092</span> |
| <span id="1093">1093</span> |
| <span id="1094">1094</span> |
| <span id="1095">1095</span> |
| <span id="1096">1096</span> |
| <span id="1097">1097</span> |
| <span id="1098">1098</span> |
| <span id="1099">1099</span> |
| <span id="1100">1100</span> |
| <span id="1101">1101</span> |
| <span id="1102">1102</span> |
| <span id="1103">1103</span> |
| <span id="1104">1104</span> |
| <span id="1105">1105</span> |
| <span id="1106">1106</span> |
| <span id="1107">1107</span> |
| <span id="1108">1108</span> |
| <span id="1109">1109</span> |
| <span id="1110">1110</span> |
| <span id="1111">1111</span> |
| <span id="1112">1112</span> |
| <span id="1113">1113</span> |
| <span id="1114">1114</span> |
| <span id="1115">1115</span> |
| <span id="1116">1116</span> |
| <span id="1117">1117</span> |
| <span id="1118">1118</span> |
| <span id="1119">1119</span> |
| <span id="1120">1120</span> |
| <span id="1121">1121</span> |
| <span id="1122">1122</span> |
| <span id="1123">1123</span> |
| <span id="1124">1124</span> |
| <span id="1125">1125</span> |
| <span id="1126">1126</span> |
| <span id="1127">1127</span> |
| <span id="1128">1128</span> |
| <span id="1129">1129</span> |
| <span id="1130">1130</span> |
| <span id="1131">1131</span> |
| <span id="1132">1132</span> |
| <span id="1133">1133</span> |
| <span id="1134">1134</span> |
| <span id="1135">1135</span> |
| <span id="1136">1136</span> |
| <span id="1137">1137</span> |
| <span id="1138">1138</span> |
| <span id="1139">1139</span> |
| <span id="1140">1140</span> |
| <span id="1141">1141</span> |
| <span id="1142">1142</span> |
| <span id="1143">1143</span> |
| <span id="1144">1144</span> |
| <span id="1145">1145</span> |
| <span id="1146">1146</span> |
| <span id="1147">1147</span> |
| <span id="1148">1148</span> |
| <span id="1149">1149</span> |
| <span id="1150">1150</span> |
| <span id="1151">1151</span> |
| <span id="1152">1152</span> |
| <span id="1153">1153</span> |
| <span id="1154">1154</span> |
| <span id="1155">1155</span> |
| <span id="1156">1156</span> |
| <span id="1157">1157</span> |
| <span id="1158">1158</span> |
| <span id="1159">1159</span> |
| <span id="1160">1160</span> |
| <span id="1161">1161</span> |
| <span id="1162">1162</span> |
| <span id="1163">1163</span> |
| <span id="1164">1164</span> |
| <span id="1165">1165</span> |
| <span id="1166">1166</span> |
| <span id="1167">1167</span> |
| <span id="1168">1168</span> |
| <span id="1169">1169</span> |
| <span id="1170">1170</span> |
| <span id="1171">1171</span> |
| <span id="1172">1172</span> |
| <span id="1173">1173</span> |
| <span id="1174">1174</span> |
| <span id="1175">1175</span> |
| <span id="1176">1176</span> |
| <span id="1177">1177</span> |
| <span id="1178">1178</span> |
| <span id="1179">1179</span> |
| <span id="1180">1180</span> |
| <span id="1181">1181</span> |
| <span id="1182">1182</span> |
| <span id="1183">1183</span> |
| <span id="1184">1184</span> |
| <span id="1185">1185</span> |
| <span id="1186">1186</span> |
| <span id="1187">1187</span> |
| <span id="1188">1188</span> |
| <span id="1189">1189</span> |
| <span id="1190">1190</span> |
| <span id="1191">1191</span> |
| <span id="1192">1192</span> |
| <span id="1193">1193</span> |
| <span id="1194">1194</span> |
| <span id="1195">1195</span> |
| <span id="1196">1196</span> |
| <span id="1197">1197</span> |
| <span id="1198">1198</span> |
| <span id="1199">1199</span> |
| <span id="1200">1200</span> |
| <span id="1201">1201</span> |
| <span id="1202">1202</span> |
| <span id="1203">1203</span> |
| <span id="1204">1204</span> |
| <span id="1205">1205</span> |
| <span id="1206">1206</span> |
| <span id="1207">1207</span> |
| <span id="1208">1208</span> |
| <span id="1209">1209</span> |
| <span id="1210">1210</span> |
| <span id="1211">1211</span> |
| <span id="1212">1212</span> |
| <span id="1213">1213</span> |
| <span id="1214">1214</span> |
| <span id="1215">1215</span> |
| <span id="1216">1216</span> |
| <span id="1217">1217</span> |
| <span id="1218">1218</span> |
| <span id="1219">1219</span> |
| <span id="1220">1220</span> |
| <span id="1221">1221</span> |
| <span id="1222">1222</span> |
| <span id="1223">1223</span> |
| <span id="1224">1224</span> |
| <span id="1225">1225</span> |
| <span id="1226">1226</span> |
| <span id="1227">1227</span> |
| <span id="1228">1228</span> |
| <span id="1229">1229</span> |
| <span id="1230">1230</span> |
| <span id="1231">1231</span> |
| <span id="1232">1232</span> |
| <span id="1233">1233</span> |
| <span id="1234">1234</span> |
| <span id="1235">1235</span> |
| <span id="1236">1236</span> |
| <span id="1237">1237</span> |
| <span id="1238">1238</span> |
| <span id="1239">1239</span> |
| <span id="1240">1240</span> |
| <span id="1241">1241</span> |
| <span id="1242">1242</span> |
| <span id="1243">1243</span> |
| <span id="1244">1244</span> |
| <span id="1245">1245</span> |
| <span id="1246">1246</span> |
| <span id="1247">1247</span> |
| <span id="1248">1248</span> |
| <span id="1249">1249</span> |
| <span id="1250">1250</span> |
| <span id="1251">1251</span> |
| <span id="1252">1252</span> |
| <span id="1253">1253</span> |
| <span id="1254">1254</span> |
| <span id="1255">1255</span> |
| <span id="1256">1256</span> |
| <span id="1257">1257</span> |
| <span id="1258">1258</span> |
| <span id="1259">1259</span> |
| <span id="1260">1260</span> |
| <span id="1261">1261</span> |
| <span id="1262">1262</span> |
| <span id="1263">1263</span> |
| <span id="1264">1264</span> |
| <span id="1265">1265</span> |
| <span id="1266">1266</span> |
| <span id="1267">1267</span> |
| <span id="1268">1268</span> |
| <span id="1269">1269</span> |
| <span id="1270">1270</span> |
| <span id="1271">1271</span> |
| <span id="1272">1272</span> |
| <span id="1273">1273</span> |
| <span id="1274">1274</span> |
| <span id="1275">1275</span> |
| <span id="1276">1276</span> |
| <span id="1277">1277</span> |
| <span id="1278">1278</span> |
| <span id="1279">1279</span> |
| <span id="1280">1280</span> |
| <span id="1281">1281</span> |
| <span id="1282">1282</span> |
| <span id="1283">1283</span> |
| <span id="1284">1284</span> |
| <span id="1285">1285</span> |
| <span id="1286">1286</span> |
| <span id="1287">1287</span> |
| <span id="1288">1288</span> |
| <span id="1289">1289</span> |
| <span id="1290">1290</span> |
| <span id="1291">1291</span> |
| <span id="1292">1292</span> |
| <span id="1293">1293</span> |
| <span id="1294">1294</span> |
| <span id="1295">1295</span> |
| <span id="1296">1296</span> |
| <span id="1297">1297</span> |
| <span id="1298">1298</span> |
| <span id="1299">1299</span> |
| <span id="1300">1300</span> |
| <span id="1301">1301</span> |
| <span id="1302">1302</span> |
| <span id="1303">1303</span> |
| <span id="1304">1304</span> |
| <span id="1305">1305</span> |
| <span id="1306">1306</span> |
| <span id="1307">1307</span> |
| <span id="1308">1308</span> |
| <span id="1309">1309</span> |
| <span id="1310">1310</span> |
| <span id="1311">1311</span> |
| <span id="1312">1312</span> |
| <span id="1313">1313</span> |
| <span id="1314">1314</span> |
| <span id="1315">1315</span> |
| <span id="1316">1316</span> |
| <span id="1317">1317</span> |
| <span id="1318">1318</span> |
| <span id="1319">1319</span> |
| <span id="1320">1320</span> |
| <span id="1321">1321</span> |
| <span id="1322">1322</span> |
| <span id="1323">1323</span> |
| <span id="1324">1324</span> |
| <span id="1325">1325</span> |
| <span id="1326">1326</span> |
| <span id="1327">1327</span> |
| <span id="1328">1328</span> |
| <span id="1329">1329</span> |
| <span id="1330">1330</span> |
| <span id="1331">1331</span> |
| <span id="1332">1332</span> |
| <span id="1333">1333</span> |
| <span id="1334">1334</span> |
| <span id="1335">1335</span> |
| <span id="1336">1336</span> |
| <span id="1337">1337</span> |
| <span id="1338">1338</span> |
| <span id="1339">1339</span> |
| <span id="1340">1340</span> |
| <span id="1341">1341</span> |
| <span id="1342">1342</span> |
| <span id="1343">1343</span> |
| <span id="1344">1344</span> |
| <span id="1345">1345</span> |
| <span id="1346">1346</span> |
| <span id="1347">1347</span> |
| <span id="1348">1348</span> |
| <span id="1349">1349</span> |
| <span id="1350">1350</span> |
| <span id="1351">1351</span> |
| <span id="1352">1352</span> |
| <span id="1353">1353</span> |
| <span id="1354">1354</span> |
| <span id="1355">1355</span> |
| <span id="1356">1356</span> |
| <span id="1357">1357</span> |
| <span id="1358">1358</span> |
| <span id="1359">1359</span> |
| <span id="1360">1360</span> |
| <span id="1361">1361</span> |
| <span id="1362">1362</span> |
| <span id="1363">1363</span> |
| <span id="1364">1364</span> |
| <span id="1365">1365</span> |
| <span id="1366">1366</span> |
| <span id="1367">1367</span> |
| <span id="1368">1368</span> |
| <span id="1369">1369</span> |
| <span id="1370">1370</span> |
| <span id="1371">1371</span> |
| <span id="1372">1372</span> |
| <span id="1373">1373</span> |
| <span id="1374">1374</span> |
| <span id="1375">1375</span> |
| <span id="1376">1376</span> |
| <span id="1377">1377</span> |
| <span id="1378">1378</span> |
| <span id="1379">1379</span> |
| <span id="1380">1380</span> |
| <span id="1381">1381</span> |
| <span id="1382">1382</span> |
| <span id="1383">1383</span> |
| <span id="1384">1384</span> |
| <span id="1385">1385</span> |
| <span id="1386">1386</span> |
| <span id="1387">1387</span> |
| <span id="1388">1388</span> |
| <span id="1389">1389</span> |
| <span id="1390">1390</span> |
| <span id="1391">1391</span> |
| <span id="1392">1392</span> |
| <span id="1393">1393</span> |
| <span id="1394">1394</span> |
| <span id="1395">1395</span> |
| <span id="1396">1396</span> |
| <span id="1397">1397</span> |
| <span id="1398">1398</span> |
| <span id="1399">1399</span> |
| <span id="1400">1400</span> |
| <span id="1401">1401</span> |
| <span id="1402">1402</span> |
| <span id="1403">1403</span> |
| <span id="1404">1404</span> |
| <span id="1405">1405</span> |
| <span id="1406">1406</span> |
| <span id="1407">1407</span> |
| <span id="1408">1408</span> |
| <span id="1409">1409</span> |
| <span id="1410">1410</span> |
| <span id="1411">1411</span> |
| <span id="1412">1412</span> |
| <span id="1413">1413</span> |
| <span id="1414">1414</span> |
| <span id="1415">1415</span> |
| <span id="1416">1416</span> |
| <span id="1417">1417</span> |
| <span id="1418">1418</span> |
| <span id="1419">1419</span> |
| <span id="1420">1420</span> |
| <span id="1421">1421</span> |
| <span id="1422">1422</span> |
| <span id="1423">1423</span> |
| <span id="1424">1424</span> |
| <span id="1425">1425</span> |
| <span id="1426">1426</span> |
| <span id="1427">1427</span> |
| <span id="1428">1428</span> |
| <span id="1429">1429</span> |
| <span id="1430">1430</span> |
| <span id="1431">1431</span> |
| <span id="1432">1432</span> |
| <span id="1433">1433</span> |
| <span id="1434">1434</span> |
| <span id="1435">1435</span> |
| <span id="1436">1436</span> |
| <span id="1437">1437</span> |
| <span id="1438">1438</span> |
| <span id="1439">1439</span> |
| <span id="1440">1440</span> |
| <span id="1441">1441</span> |
| <span id="1442">1442</span> |
| <span id="1443">1443</span> |
| <span id="1444">1444</span> |
| <span id="1445">1445</span> |
| <span id="1446">1446</span> |
| <span id="1447">1447</span> |
| <span id="1448">1448</span> |
| <span id="1449">1449</span> |
| <span id="1450">1450</span> |
| <span id="1451">1451</span> |
| <span id="1452">1452</span> |
| <span id="1453">1453</span> |
| <span id="1454">1454</span> |
| <span id="1455">1455</span> |
| <span id="1456">1456</span> |
| <span id="1457">1457</span> |
| <span id="1458">1458</span> |
| <span id="1459">1459</span> |
| <span id="1460">1460</span> |
| <span id="1461">1461</span> |
| <span id="1462">1462</span> |
| <span id="1463">1463</span> |
| <span id="1464">1464</span> |
| <span id="1465">1465</span> |
| <span id="1466">1466</span> |
| <span id="1467">1467</span> |
| <span id="1468">1468</span> |
| <span id="1469">1469</span> |
| <span id="1470">1470</span> |
| <span id="1471">1471</span> |
| <span id="1472">1472</span> |
| <span id="1473">1473</span> |
| <span id="1474">1474</span> |
| <span id="1475">1475</span> |
| <span id="1476">1476</span> |
| <span id="1477">1477</span> |
| <span id="1478">1478</span> |
| <span id="1479">1479</span> |
| <span id="1480">1480</span> |
| <span id="1481">1481</span> |
| <span id="1482">1482</span> |
| <span id="1483">1483</span> |
| <span id="1484">1484</span> |
| <span id="1485">1485</span> |
| <span id="1486">1486</span> |
| <span id="1487">1487</span> |
| <span id="1488">1488</span> |
| <span id="1489">1489</span> |
| <span id="1490">1490</span> |
| <span id="1491">1491</span> |
| <span id="1492">1492</span> |
| <span id="1493">1493</span> |
| <span id="1494">1494</span> |
| <span id="1495">1495</span> |
| <span id="1496">1496</span> |
| <span id="1497">1497</span> |
| <span id="1498">1498</span> |
| <span id="1499">1499</span> |
| <span id="1500">1500</span> |
| <span id="1501">1501</span> |
| <span id="1502">1502</span> |
| <span id="1503">1503</span> |
| <span id="1504">1504</span> |
| <span id="1505">1505</span> |
| <span id="1506">1506</span> |
| <span id="1507">1507</span> |
| <span id="1508">1508</span> |
| <span id="1509">1509</span> |
| <span id="1510">1510</span> |
| <span id="1511">1511</span> |
| <span id="1512">1512</span> |
| <span id="1513">1513</span> |
| <span id="1514">1514</span> |
| <span id="1515">1515</span> |
| <span id="1516">1516</span> |
| <span id="1517">1517</span> |
| <span id="1518">1518</span> |
| <span id="1519">1519</span> |
| <span id="1520">1520</span> |
| <span id="1521">1521</span> |
| <span id="1522">1522</span> |
| <span id="1523">1523</span> |
| <span id="1524">1524</span> |
| <span id="1525">1525</span> |
| <span id="1526">1526</span> |
| <span id="1527">1527</span> |
| <span id="1528">1528</span> |
| <span id="1529">1529</span> |
| <span id="1530">1530</span> |
| <span id="1531">1531</span> |
| <span id="1532">1532</span> |
| <span id="1533">1533</span> |
| <span id="1534">1534</span> |
| <span id="1535">1535</span> |
| <span id="1536">1536</span> |
| <span id="1537">1537</span> |
| <span id="1538">1538</span> |
| <span id="1539">1539</span> |
| <span id="1540">1540</span> |
| <span id="1541">1541</span> |
| <span id="1542">1542</span> |
| <span id="1543">1543</span> |
| <span id="1544">1544</span> |
| <span id="1545">1545</span> |
| <span id="1546">1546</span> |
| <span id="1547">1547</span> |
| <span id="1548">1548</span> |
| <span id="1549">1549</span> |
| <span id="1550">1550</span> |
| <span id="1551">1551</span> |
| <span id="1552">1552</span> |
| <span id="1553">1553</span> |
| <span id="1554">1554</span> |
| <span id="1555">1555</span> |
| <span id="1556">1556</span> |
| <span id="1557">1557</span> |
| <span id="1558">1558</span> |
| <span id="1559">1559</span> |
| <span id="1560">1560</span> |
| <span id="1561">1561</span> |
| <span id="1562">1562</span> |
| <span id="1563">1563</span> |
| <span id="1564">1564</span> |
| <span id="1565">1565</span> |
| <span id="1566">1566</span> |
| <span id="1567">1567</span> |
| <span id="1568">1568</span> |
| <span id="1569">1569</span> |
| <span id="1570">1570</span> |
| <span id="1571">1571</span> |
| <span id="1572">1572</span> |
| <span id="1573">1573</span> |
| <span id="1574">1574</span> |
| <span id="1575">1575</span> |
| <span id="1576">1576</span> |
| <span id="1577">1577</span> |
| <span id="1578">1578</span> |
| <span id="1579">1579</span> |
| <span id="1580">1580</span> |
| <span id="1581">1581</span> |
| <span id="1582">1582</span> |
| <span id="1583">1583</span> |
| <span id="1584">1584</span> |
| <span id="1585">1585</span> |
| <span id="1586">1586</span> |
| <span id="1587">1587</span> |
| <span id="1588">1588</span> |
| <span id="1589">1589</span> |
| <span id="1590">1590</span> |
| <span id="1591">1591</span> |
| <span id="1592">1592</span> |
| <span id="1593">1593</span> |
| <span id="1594">1594</span> |
| <span id="1595">1595</span> |
| <span id="1596">1596</span> |
| <span id="1597">1597</span> |
| <span id="1598">1598</span> |
| <span id="1599">1599</span> |
| <span id="1600">1600</span> |
| <span id="1601">1601</span> |
| <span id="1602">1602</span> |
| <span id="1603">1603</span> |
| <span id="1604">1604</span> |
| <span id="1605">1605</span> |
| <span id="1606">1606</span> |
| <span id="1607">1607</span> |
| <span id="1608">1608</span> |
| <span id="1609">1609</span> |
| <span id="1610">1610</span> |
| <span id="1611">1611</span> |
| <span id="1612">1612</span> |
| <span id="1613">1613</span> |
| <span id="1614">1614</span> |
| <span id="1615">1615</span> |
| <span id="1616">1616</span> |
| <span id="1617">1617</span> |
| <span id="1618">1618</span> |
| <span id="1619">1619</span> |
| <span id="1620">1620</span> |
| <span id="1621">1621</span> |
| <span id="1622">1622</span> |
| <span id="1623">1623</span> |
| <span id="1624">1624</span> |
| <span id="1625">1625</span> |
| <span id="1626">1626</span> |
| <span id="1627">1627</span> |
| </pre><pre class="rust"><code><span class="comment">// Copyright 2015-2016 Brian Smith. |
| // |
| // Permission to use, copy, modify, and/or distribute this software for any |
| // purpose with or without fee is hereby granted, provided that the above |
| // copyright notice and this permission notice appear in all copies. |
| // |
| // THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHORS DISCLAIM ALL WARRANTIES |
| // WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF |
| // MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY |
| // SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES |
| // WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION |
| // OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN |
| // CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
| |
| </span><span class="doccomment">//! Multi-precision integers. |
| //! |
| //! # Modular Arithmetic. |
| //! |
| //! Modular arithmetic is done in finite commutative rings ℤ/mℤ for some |
| //! modulus *m*. We work in finite commutative rings instead of finite fields |
| //! because the RSA public modulus *n* is not prime, which means ℤ/nℤ contains |
| //! nonzero elements that have no multiplicative inverse, so ℤ/nℤ is not a |
| //! finite field. |
| //! |
| //! In some calculations we need to deal with multiple rings at once. For |
| //! example, RSA private key operations operate in the rings ℤ/nℤ, ℤ/pℤ, and |
| //! ℤ/qℤ. Types and functions dealing with such rings are all parameterized |
| //! over a type `M` to ensure that we don't wrongly mix up the math, e.g. by |
| //! multiplying an element of ℤ/pℤ by an element of ℤ/qℤ modulo q. This follows |
| //! the "unit" pattern described in [Static checking of units in Servo]. |
| //! |
| //! `Elem` also uses the static unit checking pattern to statically track the |
| //! Montgomery factors that need to be canceled out in each value using it's |
| //! `E` parameter. |
| //! |
| //! [Static checking of units in Servo]: |
| //! https://blog.mozilla.org/research/2014/06/23/static-checking-of-units-in-servo/ |
| |
| </span><span class="kw">use crate</span>::{ |
| arithmetic::montgomery::<span class="kw-2">*</span>, |
| bits, bssl, c, error, |
| limb::{<span class="self">self</span>, Limb, LimbMask, LIMB_BITS, LIMB_BYTES}, |
| }; |
| <span class="kw">use </span>alloc::{borrow::ToOwned <span class="kw">as _</span>, boxed::Box, vec, vec::Vec}; |
| <span class="kw">use </span>core::{ |
| marker::PhantomData, |
| ops::{Deref, DerefMut}, |
| }; |
| |
| <span class="kw">pub unsafe trait </span>Prime {} |
| |
| <span class="kw">struct </span>Width<M> { |
| num_limbs: usize, |
| |
| <span class="doccomment">/// The modulus *m* that the width originated from. |
| </span>m: PhantomData<M>, |
| } |
| |
| <span class="doccomment">/// All `BoxedLimbs<M>` are stored in the same number of limbs. |
| </span><span class="kw">struct </span>BoxedLimbs<M> { |
| limbs: Box<[Limb]>, |
| |
| <span class="doccomment">/// The modulus *m* that determines the size of `limbx`. |
| </span>m: PhantomData<M>, |
| } |
| |
| <span class="kw">impl</span><M> Deref <span class="kw">for </span>BoxedLimbs<M> { |
| <span class="kw">type </span>Target = [Limb]; |
| <span class="attribute">#[inline] |
| </span><span class="kw">fn </span>deref(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span><span class="self">Self</span>::Target { |
| <span class="kw-2">&</span><span class="self">self</span>.limbs |
| } |
| } |
| |
| <span class="kw">impl</span><M> DerefMut <span class="kw">for </span>BoxedLimbs<M> { |
| <span class="attribute">#[inline] |
| </span><span class="kw">fn </span>deref_mut(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="kw-2">&mut </span><span class="self">Self</span>::Target { |
| <span class="kw-2">&mut </span><span class="self">self</span>.limbs |
| } |
| } |
| |
| <span class="comment">// TODO: `derive(Clone)` after https://github.com/rust-lang/rust/issues/26925 |
| // is resolved or restrict `M: Clone`. |
| </span><span class="kw">impl</span><M> Clone <span class="kw">for </span>BoxedLimbs<M> { |
| <span class="kw">fn </span>clone(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="self">Self </span>{ |
| <span class="self">Self </span>{ |
| limbs: <span class="self">self</span>.limbs.clone(), |
| m: <span class="self">self</span>.m, |
| } |
| } |
| } |
| |
| <span class="kw">impl</span><M> BoxedLimbs<M> { |
| <span class="kw">fn </span>positive_minimal_width_from_be_bytes( |
| input: untrusted::Input, |
| ) -> <span class="prelude-ty">Result</span><<span class="self">Self</span>, error::KeyRejected> { |
| <span class="comment">// Reject leading zeros. Also reject the value zero ([0]) because zero |
| // isn't positive. |
| </span><span class="kw">if </span>untrusted::Reader::new(input).peek(<span class="number">0</span>) { |
| <span class="kw">return </span><span class="prelude-val">Err</span>(error::KeyRejected::invalid_encoding()); |
| } |
| <span class="kw">let </span>num_limbs = (input.len() + LIMB_BYTES - <span class="number">1</span>) / LIMB_BYTES; |
| <span class="kw">let </span><span class="kw-2">mut </span>r = <span class="self">Self</span>::zero(Width { |
| num_limbs, |
| m: PhantomData, |
| }); |
| limb::parse_big_endian_and_pad_consttime(input, <span class="kw-2">&mut </span>r) |
| .map_err(|error::Unspecified| error::KeyRejected::unexpected_error())<span class="question-mark">?</span>; |
| <span class="prelude-val">Ok</span>(r) |
| } |
| |
| <span class="kw">fn </span>minimal_width_from_unpadded(limbs: <span class="kw-2">&</span>[Limb]) -> <span class="self">Self </span>{ |
| <span class="macro">debug_assert_ne!</span>(limbs.last(), <span class="prelude-val">Some</span>(<span class="kw-2">&</span><span class="number">0</span>)); |
| <span class="self">Self </span>{ |
| limbs: limbs.to_owned().into_boxed_slice(), |
| m: PhantomData, |
| } |
| } |
| |
| <span class="kw">fn </span>from_be_bytes_padded_less_than( |
| input: untrusted::Input, |
| m: <span class="kw-2">&</span>Modulus<M>, |
| ) -> <span class="prelude-ty">Result</span><<span class="self">Self</span>, error::Unspecified> { |
| <span class="kw">let </span><span class="kw-2">mut </span>r = <span class="self">Self</span>::zero(m.width()); |
| limb::parse_big_endian_and_pad_consttime(input, <span class="kw-2">&mut </span>r)<span class="question-mark">?</span>; |
| <span class="kw">if </span>limb::limbs_less_than_limbs_consttime(<span class="kw-2">&</span>r, <span class="kw-2">&</span>m.limbs) != LimbMask::True { |
| <span class="kw">return </span><span class="prelude-val">Err</span>(error::Unspecified); |
| } |
| <span class="prelude-val">Ok</span>(r) |
| } |
| |
| <span class="attribute">#[inline] |
| </span><span class="kw">fn </span>is_zero(<span class="kw-2">&</span><span class="self">self</span>) -> bool { |
| limb::limbs_are_zero_constant_time(<span class="kw-2">&</span><span class="self">self</span>.limbs) == LimbMask::True |
| } |
| |
| <span class="kw">fn </span>zero(width: Width<M>) -> <span class="self">Self </span>{ |
| <span class="self">Self </span>{ |
| limbs: <span class="macro">vec!</span>[<span class="number">0</span>; width.num_limbs].into_boxed_slice(), |
| m: PhantomData, |
| } |
| } |
| |
| <span class="kw">fn </span>width(<span class="kw-2">&</span><span class="self">self</span>) -> Width<M> { |
| Width { |
| num_limbs: <span class="self">self</span>.limbs.len(), |
| m: PhantomData, |
| } |
| } |
| } |
| |
| <span class="doccomment">/// A modulus *s* that is smaller than another modulus *l* so every element of |
| /// ℤ/sℤ is also an element of ℤ/lℤ. |
| </span><span class="kw">pub unsafe trait </span>SmallerModulus<L> {} |
| |
| <span class="doccomment">/// A modulus *s* where s < l < 2*s for the given larger modulus *l*. This is |
| /// the precondition for reduction by conditional subtraction, |
| /// `elem_reduce_once()`. |
| </span><span class="kw">pub unsafe trait </span>SlightlySmallerModulus<L>: SmallerModulus<L> {} |
| |
| <span class="doccomment">/// A modulus *s* where √l <= s < l for the given larger modulus *l*. This is |
| /// the precondition for the more general Montgomery reduction from ℤ/lℤ to |
| /// ℤ/sℤ. |
| </span><span class="kw">pub unsafe trait </span>NotMuchSmallerModulus<L>: SmallerModulus<L> {} |
| |
| <span class="kw">pub unsafe trait </span>PublicModulus {} |
| |
| <span class="doccomment">/// The x86 implementation of `GFp_bn_mul_mont`, at least, requires at least 4 |
| /// limbs. For a long time we have required 4 limbs for all targets, though |
| /// this may be unnecessary. TODO: Replace this with |
| /// `n.len() < 256 / LIMB_BITS` so that 32-bit and 64-bit platforms behave the |
| /// same. |
| </span><span class="kw">pub const </span>MODULUS_MIN_LIMBS: usize = <span class="number">4</span>; |
| |
| <span class="kw">pub const </span>MODULUS_MAX_LIMBS: usize = <span class="number">8192 </span>/ LIMB_BITS; |
| |
| <span class="doccomment">/// The modulus *m* for a ring ℤ/mℤ, along with the precomputed values needed |
| /// for efficient Montgomery multiplication modulo *m*. The value must be odd |
| /// and larger than 2. The larger-than-1 requirement is imposed, at least, by |
| /// the modular inversion code. |
| </span><span class="kw">pub struct </span>Modulus<M> { |
| limbs: BoxedLimbs<M>, <span class="comment">// Also `value >= 3`. |
| |
| // n0 * N == -1 (mod r). |
| // |
| // r == 2**(N0_LIMBS_USED * LIMB_BITS) and LG_LITTLE_R == lg(r). This |
| // ensures that we can do integer division by |r| by simply ignoring |
| // `N0_LIMBS_USED` limbs. Similarly, we can calculate values modulo `r` by |
| // just looking at the lowest `N0_LIMBS_USED` limbs. This is what makes |
| // Montgomery multiplication efficient. |
| // |
| // As shown in Algorithm 1 of "Fast Prime Field Elliptic Curve Cryptography |
| // with 256 Bit Primes" by Shay Gueron and Vlad Krasnov, in the loop of a |
| // multi-limb Montgomery multiplication of a * b (mod n), given the |
| // unreduced product t == a * b, we repeatedly calculate: |
| // |
| // t1 := t % r |t1| is |t|'s lowest limb (see previous paragraph). |
| // t2 := t1*n0*n |
| // t3 := t + t2 |
| // t := t3 / r copy all limbs of |t3| except the lowest to |t|. |
| // |
| // In the last step, it would only make sense to ignore the lowest limb of |
| // |t3| if it were zero. The middle steps ensure that this is the case: |
| // |
| // t3 == 0 (mod r) |
| // t + t2 == 0 (mod r) |
| // t + t1*n0*n == 0 (mod r) |
| // t1*n0*n == -t (mod r) |
| // t*n0*n == -t (mod r) |
| // n0*n == -1 (mod r) |
| // n0 == -1/n (mod r) |
| // |
| // Thus, in each iteration of the loop, we multiply by the constant factor |
| // n0, the negative inverse of n (mod r). |
| // |
| // TODO(perf): Not all 32-bit platforms actually make use of n0[1]. For the |
| // ones that don't, we could use a shorter `R` value and use faster `Limb` |
| // calculations instead of double-precision `u64` calculations. |
| </span>n0: N0, |
| |
| oneRR: One<M, RR>, |
| } |
| |
| <span class="kw">impl</span><M: PublicModulus> core::fmt::Debug <span class="kw">for </span>Modulus<M> { |
| <span class="kw">fn </span>fmt(<span class="kw-2">&</span><span class="self">self</span>, fmt: <span class="kw-2">&mut </span>::core::fmt::Formatter) -> <span class="prelude-ty">Result</span><(), ::core::fmt::Error> { |
| fmt.debug_struct(<span class="string">"Modulus"</span>) |
| <span class="comment">// TODO: Print modulus value. |
| </span>.finish() |
| } |
| } |
| |
| <span class="kw">impl</span><M> Modulus<M> { |
| <span class="kw">pub fn </span>from_be_bytes_with_bit_length( |
| input: untrusted::Input, |
| ) -> <span class="prelude-ty">Result</span><(<span class="self">Self</span>, bits::BitLength), error::KeyRejected> { |
| <span class="kw">let </span>limbs = BoxedLimbs::positive_minimal_width_from_be_bytes(input)<span class="question-mark">?</span>; |
| <span class="self">Self</span>::from_boxed_limbs(limbs) |
| } |
| |
| <span class="kw">pub fn </span>from_nonnegative_with_bit_length( |
| n: Nonnegative, |
| ) -> <span class="prelude-ty">Result</span><(<span class="self">Self</span>, bits::BitLength), error::KeyRejected> { |
| <span class="kw">let </span>limbs = BoxedLimbs { |
| limbs: n.limbs.into_boxed_slice(), |
| m: PhantomData, |
| }; |
| <span class="self">Self</span>::from_boxed_limbs(limbs) |
| } |
| |
| <span class="kw">fn </span>from_boxed_limbs(n: BoxedLimbs<M>) -> <span class="prelude-ty">Result</span><(<span class="self">Self</span>, bits::BitLength), error::KeyRejected> { |
| <span class="kw">if </span>n.len() > MODULUS_MAX_LIMBS { |
| <span class="kw">return </span><span class="prelude-val">Err</span>(error::KeyRejected::too_large()); |
| } |
| <span class="kw">if </span>n.len() < MODULUS_MIN_LIMBS { |
| <span class="kw">return </span><span class="prelude-val">Err</span>(error::KeyRejected::unexpected_error()); |
| } |
| <span class="kw">if </span>limb::limbs_are_even_constant_time(<span class="kw-2">&</span>n) != LimbMask::False { |
| <span class="kw">return </span><span class="prelude-val">Err</span>(error::KeyRejected::invalid_component()); |
| } |
| <span class="kw">if </span>limb::limbs_less_than_limb_constant_time(<span class="kw-2">&</span>n, <span class="number">3</span>) != LimbMask::False { |
| <span class="kw">return </span><span class="prelude-val">Err</span>(error::KeyRejected::unexpected_error()); |
| } |
| |
| <span class="comment">// n_mod_r = n % r. As explained in the documentation for `n0`, this is |
| // done by taking the lowest `N0_LIMBS_USED` limbs of `n`. |
| </span><span class="attribute">#[allow(clippy::useless_conversion)] |
| </span><span class="kw">let </span>n0 = { |
| <span class="kw">extern </span><span class="string">"C" </span>{ |
| <span class="kw">fn </span>GFp_bn_neg_inv_mod_r_u64(n: u64) -> u64; |
| } |
| |
| <span class="comment">// XXX: u64::from isn't guaranteed to be constant time. |
| </span><span class="kw">let </span><span class="kw-2">mut </span>n_mod_r: u64 = u64::from(n[<span class="number">0</span>]); |
| |
| <span class="kw">if </span>N0_LIMBS_USED == <span class="number">2 </span>{ |
| <span class="comment">// XXX: If we use `<< LIMB_BITS` here then 64-bit builds |
| // fail to compile because of `deny(exceeding_bitshifts)`. |
| </span><span class="macro">debug_assert_eq!</span>(LIMB_BITS, <span class="number">32</span>); |
| n_mod_r |= u64::from(n[<span class="number">1</span>]) << <span class="number">32</span>; |
| } |
| N0::from(<span class="kw">unsafe </span>{ GFp_bn_neg_inv_mod_r_u64(n_mod_r) }) |
| }; |
| |
| <span class="kw">let </span>bits = limb::limbs_minimal_bits(<span class="kw-2">&</span>n.limbs); |
| <span class="kw">let </span>oneRR = { |
| <span class="kw">let </span>partial = PartialModulus { |
| limbs: <span class="kw-2">&</span>n.limbs, |
| n0: n0.clone(), |
| m: PhantomData, |
| }; |
| |
| One::newRR(<span class="kw-2">&</span>partial, bits) |
| }; |
| |
| <span class="prelude-val">Ok</span>(( |
| <span class="self">Self </span>{ |
| limbs: n, |
| n0, |
| oneRR, |
| }, |
| bits, |
| )) |
| } |
| |
| <span class="attribute">#[inline] |
| </span><span class="kw">fn </span>width(<span class="kw-2">&</span><span class="self">self</span>) -> Width<M> { |
| <span class="self">self</span>.limbs.width() |
| } |
| |
| <span class="kw">fn </span>zero<E>(<span class="kw-2">&</span><span class="self">self</span>) -> Elem<M, E> { |
| Elem { |
| limbs: BoxedLimbs::zero(<span class="self">self</span>.width()), |
| encoding: PhantomData, |
| } |
| } |
| |
| <span class="comment">// TODO: Get rid of this |
| </span><span class="kw">fn </span>one(<span class="kw-2">&</span><span class="self">self</span>) -> Elem<M, Unencoded> { |
| <span class="kw">let </span><span class="kw-2">mut </span>r = <span class="self">self</span>.zero(); |
| r.limbs[<span class="number">0</span>] = <span class="number">1</span>; |
| r |
| } |
| |
| <span class="kw">pub fn </span>oneRR(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>One<M, RR> { |
| <span class="kw-2">&</span><span class="self">self</span>.oneRR |
| } |
| |
| <span class="kw">pub fn </span>to_elem<L>(<span class="kw-2">&</span><span class="self">self</span>, l: <span class="kw-2">&</span>Modulus<L>) -> Elem<L, Unencoded> |
| <span class="kw">where |
| </span>M: SmallerModulus<L>, |
| { |
| <span class="comment">// TODO: Encode this assertion into the `where` above. |
| </span><span class="macro">assert_eq!</span>(<span class="self">self</span>.width().num_limbs, l.width().num_limbs); |
| <span class="kw">let </span>limbs = <span class="self">self</span>.limbs.clone(); |
| Elem { |
| limbs: BoxedLimbs { |
| limbs: limbs.limbs, |
| m: PhantomData, |
| }, |
| encoding: PhantomData, |
| } |
| } |
| |
| <span class="kw">fn </span>as_partial(<span class="kw-2">&</span><span class="self">self</span>) -> PartialModulus<M> { |
| PartialModulus { |
| limbs: <span class="kw-2">&</span><span class="self">self</span>.limbs, |
| n0: <span class="self">self</span>.n0.clone(), |
| m: PhantomData, |
| } |
| } |
| } |
| |
| <span class="kw">struct </span>PartialModulus<<span class="lifetime">'a</span>, M> { |
| limbs: <span class="kw-2">&</span><span class="lifetime">'a </span>[Limb], |
| n0: N0, |
| m: PhantomData<M>, |
| } |
| |
| <span class="kw">impl</span><M> PartialModulus<<span class="lifetime">'_</span>, M> { |
| <span class="comment">// TODO: XXX Avoid duplication with `Modulus`. |
| </span><span class="kw">fn </span>zero(<span class="kw-2">&</span><span class="self">self</span>) -> Elem<M, R> { |
| <span class="kw">let </span>width = Width { |
| num_limbs: <span class="self">self</span>.limbs.len(), |
| m: PhantomData, |
| }; |
| Elem { |
| limbs: BoxedLimbs::zero(width), |
| encoding: PhantomData, |
| } |
| } |
| } |
| |
| <span class="doccomment">/// Elements of ℤ/mℤ for some modulus *m*. |
| </span><span class="comment">// |
| // Defaulting `E` to `Unencoded` is a convenience for callers from outside this |
| // submodule. However, for maximum clarity, we always explicitly use |
| // `Unencoded` within the `bigint` submodule. |
| </span><span class="kw">pub struct </span>Elem<M, E = Unencoded> { |
| limbs: BoxedLimbs<M>, |
| |
| <span class="doccomment">/// The number of Montgomery factors that need to be canceled out from |
| /// `value` to get the actual value. |
| </span>encoding: PhantomData<E>, |
| } |
| |
| <span class="comment">// TODO: `derive(Clone)` after https://github.com/rust-lang/rust/issues/26925 |
| // is resolved or restrict `M: Clone` and `E: Clone`. |
| </span><span class="kw">impl</span><M, E> Clone <span class="kw">for </span>Elem<M, E> { |
| <span class="kw">fn </span>clone(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="self">Self </span>{ |
| <span class="self">Self </span>{ |
| limbs: <span class="self">self</span>.limbs.clone(), |
| encoding: <span class="self">self</span>.encoding, |
| } |
| } |
| } |
| |
| <span class="kw">impl</span><M, E> Elem<M, E> { |
| <span class="attribute">#[inline] |
| </span><span class="kw">pub fn </span>is_zero(<span class="kw-2">&</span><span class="self">self</span>) -> bool { |
| <span class="self">self</span>.limbs.is_zero() |
| } |
| } |
| |
| <span class="kw">impl</span><M, E: ReductionEncoding> Elem<M, E> { |
| <span class="kw">fn </span>decode_once(<span class="self">self</span>, m: <span class="kw-2">&</span>Modulus<M>) -> Elem<M, <E <span class="kw">as </span>ReductionEncoding>::Output> { |
| <span class="comment">// A multiplication isn't required since we're multiplying by the |
| // unencoded value one (1); only a Montgomery reduction is needed. |
| // However the only non-multiplication Montgomery reduction function we |
| // have requires the input to be large, so we avoid using it here. |
| </span><span class="kw">let </span><span class="kw-2">mut </span>limbs = <span class="self">self</span>.limbs; |
| <span class="kw">let </span>num_limbs = m.width().num_limbs; |
| <span class="kw">let </span><span class="kw-2">mut </span>one = [<span class="number">0</span>; MODULUS_MAX_LIMBS]; |
| one[<span class="number">0</span>] = <span class="number">1</span>; |
| <span class="kw">let </span>one = <span class="kw-2">&</span>one[..num_limbs]; <span class="comment">// assert!(num_limbs <= MODULUS_MAX_LIMBS); |
| </span>limbs_mont_mul(<span class="kw-2">&mut </span>limbs, <span class="kw-2">&</span>one, <span class="kw-2">&</span>m.limbs, <span class="kw-2">&</span>m.n0); |
| Elem { |
| limbs, |
| encoding: PhantomData, |
| } |
| } |
| } |
| |
| <span class="kw">impl</span><M> Elem<M, R> { |
| <span class="attribute">#[inline] |
| </span><span class="kw">pub fn </span>into_unencoded(<span class="self">self</span>, m: <span class="kw-2">&</span>Modulus<M>) -> Elem<M, Unencoded> { |
| <span class="self">self</span>.decode_once(m) |
| } |
| } |
| |
| <span class="kw">impl</span><M> Elem<M, Unencoded> { |
| <span class="kw">pub fn </span>from_be_bytes_padded( |
| input: untrusted::Input, |
| m: <span class="kw-2">&</span>Modulus<M>, |
| ) -> <span class="prelude-ty">Result</span><<span class="self">Self</span>, error::Unspecified> { |
| <span class="prelude-val">Ok</span>(Elem { |
| limbs: BoxedLimbs::from_be_bytes_padded_less_than(input, m)<span class="question-mark">?</span>, |
| encoding: PhantomData, |
| }) |
| } |
| |
| <span class="attribute">#[inline] |
| </span><span class="kw">pub fn </span>fill_be_bytes(<span class="kw-2">&</span><span class="self">self</span>, out: <span class="kw-2">&mut </span>[u8]) { |
| <span class="comment">// See Falko Strenzke, "Manger's Attack revisited", ICICS 2010. |
| </span>limb::big_endian_from_limbs(<span class="kw-2">&</span><span class="self">self</span>.limbs, out) |
| } |
| |
| <span class="kw">pub fn </span>into_modulus<MM>(<span class="self">self</span>) -> <span class="prelude-ty">Result</span><Modulus<MM>, error::KeyRejected> { |
| <span class="kw">let </span>(m, _bits) = |
| Modulus::from_boxed_limbs(BoxedLimbs::minimal_width_from_unpadded(<span class="kw-2">&</span><span class="self">self</span>.limbs))<span class="question-mark">?</span>; |
| <span class="prelude-val">Ok</span>(m) |
| } |
| |
| <span class="kw">fn </span>is_one(<span class="kw-2">&</span><span class="self">self</span>) -> bool { |
| limb::limbs_equal_limb_constant_time(<span class="kw-2">&</span><span class="self">self</span>.limbs, <span class="number">1</span>) == LimbMask::True |
| } |
| } |
| |
| <span class="kw">pub fn </span>elem_mul<M, AF, BF>( |
| a: <span class="kw-2">&</span>Elem<M, AF>, |
| b: Elem<M, BF>, |
| m: <span class="kw-2">&</span>Modulus<M>, |
| ) -> Elem<M, <(AF, BF) <span class="kw">as </span>ProductEncoding>::Output> |
| <span class="kw">where |
| </span>(AF, BF): ProductEncoding, |
| { |
| elem_mul_(a, b, <span class="kw-2">&</span>m.as_partial()) |
| } |
| |
| <span class="kw">fn </span>elem_mul_<M, AF, BF>( |
| a: <span class="kw-2">&</span>Elem<M, AF>, |
| <span class="kw-2">mut </span>b: Elem<M, BF>, |
| m: <span class="kw-2">&</span>PartialModulus<M>, |
| ) -> Elem<M, <(AF, BF) <span class="kw">as </span>ProductEncoding>::Output> |
| <span class="kw">where |
| </span>(AF, BF): ProductEncoding, |
| { |
| limbs_mont_mul(<span class="kw-2">&mut </span>b.limbs, <span class="kw-2">&</span>a.limbs, <span class="kw-2">&</span>m.limbs, <span class="kw-2">&</span>m.n0); |
| Elem { |
| limbs: b.limbs, |
| encoding: PhantomData, |
| } |
| } |
| |
| <span class="kw">fn </span>elem_mul_by_2<M, AF>(a: <span class="kw-2">&mut </span>Elem<M, AF>, m: <span class="kw-2">&</span>PartialModulus<M>) { |
| <span class="kw">extern </span><span class="string">"C" </span>{ |
| <span class="kw">fn </span>LIMBS_shl_mod(r: <span class="kw-2">*mut </span>Limb, a: <span class="kw-2">*const </span>Limb, m: <span class="kw-2">*const </span>Limb, num_limbs: c::size_t); |
| } |
| <span class="kw">unsafe </span>{ |
| LIMBS_shl_mod( |
| a.limbs.as_mut_ptr(), |
| a.limbs.as_ptr(), |
| m.limbs.as_ptr(), |
| m.limbs.len(), |
| ); |
| } |
| } |
| |
| <span class="kw">pub fn </span>elem_reduced_once<Larger, Smaller: SlightlySmallerModulus<Larger>>( |
| a: <span class="kw-2">&</span>Elem<Larger, Unencoded>, |
| m: <span class="kw-2">&</span>Modulus<Smaller>, |
| ) -> Elem<Smaller, Unencoded> { |
| <span class="kw">let </span><span class="kw-2">mut </span>r = a.limbs.clone(); |
| <span class="macro">assert!</span>(r.len() <= m.limbs.len()); |
| limb::limbs_reduce_once_constant_time(<span class="kw-2">&mut </span>r, <span class="kw-2">&</span>m.limbs); |
| Elem { |
| limbs: BoxedLimbs { |
| limbs: r.limbs, |
| m: PhantomData, |
| }, |
| encoding: PhantomData, |
| } |
| } |
| |
| <span class="attribute">#[inline] |
| </span><span class="kw">pub fn </span>elem_reduced<Larger, Smaller: NotMuchSmallerModulus<Larger>>( |
| a: <span class="kw-2">&</span>Elem<Larger, Unencoded>, |
| m: <span class="kw-2">&</span>Modulus<Smaller>, |
| ) -> Elem<Smaller, RInverse> { |
| <span class="kw">let </span><span class="kw-2">mut </span>tmp = [<span class="number">0</span>; MODULUS_MAX_LIMBS]; |
| <span class="kw">let </span>tmp = <span class="kw-2">&mut </span>tmp[..a.limbs.len()]; |
| tmp.copy_from_slice(<span class="kw-2">&</span>a.limbs); |
| |
| <span class="kw">let </span><span class="kw-2">mut </span>r = m.zero(); |
| limbs_from_mont_in_place(<span class="kw-2">&mut </span>r.limbs, tmp, <span class="kw-2">&</span>m.limbs, <span class="kw-2">&</span>m.n0); |
| r |
| } |
| |
| <span class="kw">fn </span>elem_squared<M, E>( |
| <span class="kw-2">mut </span>a: Elem<M, E>, |
| m: <span class="kw-2">&</span>PartialModulus<M>, |
| ) -> Elem<M, <(E, E) <span class="kw">as </span>ProductEncoding>::Output> |
| <span class="kw">where |
| </span>(E, E): ProductEncoding, |
| { |
| limbs_mont_square(<span class="kw-2">&mut </span>a.limbs, <span class="kw-2">&</span>m.limbs, <span class="kw-2">&</span>m.n0); |
| Elem { |
| limbs: a.limbs, |
| encoding: PhantomData, |
| } |
| } |
| |
| <span class="kw">pub fn </span>elem_widen<Larger, Smaller: SmallerModulus<Larger>>( |
| a: Elem<Smaller, Unencoded>, |
| m: <span class="kw-2">&</span>Modulus<Larger>, |
| ) -> Elem<Larger, Unencoded> { |
| <span class="kw">let </span><span class="kw-2">mut </span>r = m.zero(); |
| r.limbs[..a.limbs.len()].copy_from_slice(<span class="kw-2">&</span>a.limbs); |
| r |
| } |
| |
| <span class="comment">// TODO: Document why this works for all Montgomery factors. |
| </span><span class="kw">pub fn </span>elem_add<M, E>(<span class="kw-2">mut </span>a: Elem<M, E>, b: Elem<M, E>, m: <span class="kw-2">&</span>Modulus<M>) -> Elem<M, E> { |
| <span class="kw">extern </span><span class="string">"C" </span>{ |
| <span class="comment">// `r` and `a` may alias. |
| </span><span class="kw">fn </span>LIMBS_add_mod( |
| r: <span class="kw-2">*mut </span>Limb, |
| a: <span class="kw-2">*const </span>Limb, |
| b: <span class="kw-2">*const </span>Limb, |
| m: <span class="kw-2">*const </span>Limb, |
| num_limbs: c::size_t, |
| ); |
| } |
| <span class="kw">unsafe </span>{ |
| LIMBS_add_mod( |
| a.limbs.as_mut_ptr(), |
| a.limbs.as_ptr(), |
| b.limbs.as_ptr(), |
| m.limbs.as_ptr(), |
| m.limbs.len(), |
| ) |
| } |
| a |
| } |
| |
| <span class="comment">// TODO: Document why this works for all Montgomery factors. |
| </span><span class="kw">pub fn </span>elem_sub<M, E>(<span class="kw-2">mut </span>a: Elem<M, E>, b: <span class="kw-2">&</span>Elem<M, E>, m: <span class="kw-2">&</span>Modulus<M>) -> Elem<M, E> { |
| <span class="kw">extern </span><span class="string">"C" </span>{ |
| <span class="comment">// `r` and `a` may alias. |
| </span><span class="kw">fn </span>LIMBS_sub_mod( |
| r: <span class="kw-2">*mut </span>Limb, |
| a: <span class="kw-2">*const </span>Limb, |
| b: <span class="kw-2">*const </span>Limb, |
| m: <span class="kw-2">*const </span>Limb, |
| num_limbs: c::size_t, |
| ); |
| } |
| <span class="kw">unsafe </span>{ |
| LIMBS_sub_mod( |
| a.limbs.as_mut_ptr(), |
| a.limbs.as_ptr(), |
| b.limbs.as_ptr(), |
| m.limbs.as_ptr(), |
| m.limbs.len(), |
| ); |
| } |
| a |
| } |
| |
| <span class="comment">// The value 1, Montgomery-encoded some number of times. |
| </span><span class="kw">pub struct </span>One<M, E>(Elem<M, E>); |
| |
| <span class="kw">impl</span><M> One<M, RR> { |
| <span class="comment">// Returns RR = = R**2 (mod n) where R = 2**r is the smallest power of |
| // 2**LIMB_BITS such that R > m. |
| // |
| // Even though the assembly on some 32-bit platforms works with 64-bit |
| // values, using `LIMB_BITS` here, rather than `N0_LIMBS_USED * LIMB_BITS`, |
| // is correct because R**2 will still be a multiple of the latter as |
| // `N0_LIMBS_USED` is either one or two. |
| </span><span class="kw">fn </span>newRR(m: <span class="kw-2">&</span>PartialModulus<M>, m_bits: bits::BitLength) -> <span class="self">Self </span>{ |
| <span class="kw">let </span>m_bits = m_bits.as_usize_bits(); |
| <span class="kw">let </span>r = (m_bits + (LIMB_BITS - <span class="number">1</span>)) / LIMB_BITS * LIMB_BITS; |
| |
| <span class="comment">// base = 2**(lg m - 1). |
| </span><span class="kw">let </span>bit = m_bits - <span class="number">1</span>; |
| <span class="kw">let </span><span class="kw-2">mut </span>base = m.zero(); |
| base.limbs[bit / LIMB_BITS] = <span class="number">1 </span><< (bit % LIMB_BITS); |
| |
| <span class="comment">// Double `base` so that base == R == 2**r (mod m). For normal moduli |
| // that have the high bit of the highest limb set, this requires one |
| // doubling. Unusual moduli require more doublings but we are less |
| // concerned about the performance of those. |
| // |
| // Then double `base` again so that base == 2*R (mod n), i.e. `2` in |
| // Montgomery form (`elem_exp_vartime_()` requires the base to be in |
| // Montgomery form). Then compute |
| // RR = R**2 == base**r == R**r == (2**r)**r (mod n). |
| // |
| // Take advantage of the fact that `elem_mul_by_2` is faster than |
| // `elem_squared` by replacing some of the early squarings with shifts. |
| // TODO: Benchmark shift vs. squaring performance to determine the |
| // optimal value of `lg_base`. |
| </span><span class="kw">let </span>lg_base = <span class="number">2usize</span>; <span class="comment">// Shifts vs. squaring trade-off. |
| </span><span class="macro">debug_assert_eq!</span>(lg_base.count_ones(), <span class="number">1</span>); <span class="comment">// Must 2**n for n >= 0. |
| </span><span class="kw">let </span>shifts = r - bit + lg_base; |
| <span class="kw">let </span>exponent = (r / lg_base) <span class="kw">as </span>u64; |
| <span class="kw">for _ in </span><span class="number">0</span>..shifts { |
| elem_mul_by_2(<span class="kw-2">&mut </span>base, m) |
| } |
| <span class="kw">let </span>RR = elem_exp_vartime_(base, exponent, m); |
| |
| <span class="self">Self</span>(Elem { |
| limbs: RR.limbs, |
| encoding: PhantomData, <span class="comment">// PhantomData<RR> |
| </span>}) |
| } |
| } |
| |
| <span class="kw">impl</span><M, E> AsRef<Elem<M, E>> <span class="kw">for </span>One<M, E> { |
| <span class="kw">fn </span>as_ref(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>Elem<M, E> { |
| <span class="kw-2">&</span><span class="self">self</span>.<span class="number">0 |
| </span>} |
| } |
| |
| <span class="doccomment">/// A non-secret odd positive value in the range |
| /// [3, PUBLIC_EXPONENT_MAX_VALUE]. |
| </span><span class="attribute">#[derive(Clone, Copy, Debug)] |
| </span><span class="kw">pub struct </span>PublicExponent(u64); |
| |
| <span class="kw">impl </span>PublicExponent { |
| <span class="kw">pub fn </span>from_be_bytes( |
| input: untrusted::Input, |
| min_value: u64, |
| ) -> <span class="prelude-ty">Result</span><<span class="self">Self</span>, error::KeyRejected> { |
| <span class="kw">if </span>input.len() > <span class="number">5 </span>{ |
| <span class="kw">return </span><span class="prelude-val">Err</span>(error::KeyRejected::too_large()); |
| } |
| <span class="kw">let </span>value = input.read_all(error::KeyRejected::invalid_encoding(), |input| { |
| <span class="comment">// The exponent can't be zero and it can't be prefixed with |
| // zero-valued bytes. |
| </span><span class="kw">if </span>input.peek(<span class="number">0</span>) { |
| <span class="kw">return </span><span class="prelude-val">Err</span>(error::KeyRejected::invalid_encoding()); |
| } |
| <span class="kw">let </span><span class="kw-2">mut </span>value = <span class="number">0u64</span>; |
| <span class="kw">loop </span>{ |
| <span class="kw">let </span>byte = input |
| .read_byte() |
| .map_err(|untrusted::EndOfInput| error::KeyRejected::invalid_encoding())<span class="question-mark">?</span>; |
| value = (value << <span class="number">8</span>) | u64::from(byte); |
| <span class="kw">if </span>input.at_end() { |
| <span class="kw">return </span><span class="prelude-val">Ok</span>(value); |
| } |
| } |
| })<span class="question-mark">?</span>; |
| |
| <span class="comment">// Step 2 / Step b. NIST SP800-89 defers to FIPS 186-3, which requires |
| // `e >= 65537`. We enforce this when signing, but are more flexible in |
| // verification, for compatibility. Only small public exponents are |
| // supported. |
| </span><span class="kw">if </span>value & <span class="number">1 </span>!= <span class="number">1 </span>{ |
| <span class="kw">return </span><span class="prelude-val">Err</span>(error::KeyRejected::invalid_component()); |
| } |
| <span class="macro">debug_assert!</span>(min_value & <span class="number">1 </span>== <span class="number">1</span>); |
| <span class="macro">debug_assert!</span>(min_value <= PUBLIC_EXPONENT_MAX_VALUE); |
| <span class="kw">if </span>min_value < <span class="number">3 </span>{ |
| <span class="kw">return </span><span class="prelude-val">Err</span>(error::KeyRejected::invalid_component()); |
| } |
| <span class="kw">if </span>value < min_value { |
| <span class="kw">return </span><span class="prelude-val">Err</span>(error::KeyRejected::too_small()); |
| } |
| <span class="kw">if </span>value > PUBLIC_EXPONENT_MAX_VALUE { |
| <span class="kw">return </span><span class="prelude-val">Err</span>(error::KeyRejected::too_large()); |
| } |
| |
| <span class="prelude-val">Ok</span>(<span class="self">Self</span>(value)) |
| } |
| } |
| |
| <span class="comment">// This limit was chosen to bound the performance of the simple |
| // exponentiation-by-squaring implementation in `elem_exp_vartime`. In |
| // particular, it helps mitigate theoretical resource exhaustion attacks. 33 |
| // bits was chosen as the limit based on the recommendations in [1] and |
| // [2]. Windows CryptoAPI (at least older versions) doesn't support values |
| // larger than 32 bits [3], so it is unlikely that exponents larger than 32 |
| // bits are being used for anything Windows commonly does. |
| // |
| // [1] https://www.imperialviolet.org/2012/03/16/rsae.html |
| // [2] https://www.imperialviolet.org/2012/03/17/rsados.html |
| // [3] https://msdn.microsoft.com/en-us/library/aa387685(VS.85).aspx |
| </span><span class="kw">const </span>PUBLIC_EXPONENT_MAX_VALUE: u64 = (<span class="number">1u64 </span><< <span class="number">33</span>) - <span class="number">1</span>; |
| |
| <span class="doccomment">/// Calculates base**exponent (mod m). |
| </span><span class="comment">// TODO: The test coverage needs to be expanded, e.g. test with the largest |
| // accepted exponent and with the most common values of 65537 and 3. |
| </span><span class="kw">pub fn </span>elem_exp_vartime<M>( |
| base: Elem<M, Unencoded>, |
| PublicExponent(exponent): PublicExponent, |
| m: <span class="kw-2">&</span>Modulus<M>, |
| ) -> Elem<M, R> { |
| <span class="kw">let </span>base = elem_mul(m.oneRR().as_ref(), base, <span class="kw-2">&</span>m); |
| elem_exp_vartime_(base, exponent, <span class="kw-2">&</span>m.as_partial()) |
| } |
| |
| <span class="doccomment">/// Calculates base**exponent (mod m). |
| </span><span class="kw">fn </span>elem_exp_vartime_<M>(base: Elem<M, R>, exponent: u64, m: <span class="kw-2">&</span>PartialModulus<M>) -> Elem<M, R> { |
| <span class="comment">// Use what [Knuth] calls the "S-and-X binary method", i.e. variable-time |
| // square-and-multiply that scans the exponent from the most significant |
| // bit to the least significant bit (left-to-right). Left-to-right requires |
| // less storage compared to right-to-left scanning, at the cost of needing |
| // to compute `exponent.leading_zeros()`, which we assume to be cheap. |
| // |
| // During RSA public key operations the exponent is almost always either 65537 |
| // (0b10000000000000001) or 3 (0b11), both of which have a Hamming weight |
| // of 2. During Montgomery setup the exponent is almost always a power of two, |
| // with Hamming weight 1. As explained in [Knuth], exponentiation by squaring |
| // is the most efficient algorithm when the Hamming weight is 2 or less. It |
| // isn't the most efficient for all other, uncommon, exponent values but any |
| // suboptimality is bounded by `PUBLIC_EXPONENT_MAX_VALUE`. |
| // |
| // This implementation is slightly simplified by taking advantage of the |
| // fact that we require the exponent to be a positive integer. |
| // |
| // [Knuth]: The Art of Computer Programming, Volume 2: Seminumerical |
| // Algorithms (3rd Edition), Section 4.6.3. |
| </span><span class="macro">assert!</span>(exponent >= <span class="number">1</span>); |
| <span class="macro">assert!</span>(exponent <= PUBLIC_EXPONENT_MAX_VALUE); |
| <span class="kw">let </span><span class="kw-2">mut </span>acc = base.clone(); |
| <span class="kw">let </span><span class="kw-2">mut </span>bit = <span class="number">1 </span><< (<span class="number">64 </span>- <span class="number">1 </span>- exponent.leading_zeros()); |
| <span class="macro">debug_assert!</span>((exponent & bit) != <span class="number">0</span>); |
| <span class="kw">while </span>bit > <span class="number">1 </span>{ |
| bit >>= <span class="number">1</span>; |
| acc = elem_squared(acc, m); |
| <span class="kw">if </span>(exponent & bit) != <span class="number">0 </span>{ |
| acc = elem_mul_(<span class="kw-2">&</span>base, acc, m); |
| } |
| } |
| acc |
| } |
| |
| <span class="comment">// `M` represents the prime modulus for which the exponent is in the interval |
| // [1, `m` - 1). |
| </span><span class="kw">pub struct </span>PrivateExponent<M> { |
| limbs: BoxedLimbs<M>, |
| } |
| |
| <span class="kw">impl</span><M> PrivateExponent<M> { |
| <span class="kw">pub fn </span>from_be_bytes_padded( |
| input: untrusted::Input, |
| p: <span class="kw-2">&</span>Modulus<M>, |
| ) -> <span class="prelude-ty">Result</span><<span class="self">Self</span>, error::Unspecified> { |
| <span class="kw">let </span>dP = BoxedLimbs::from_be_bytes_padded_less_than(input, p)<span class="question-mark">?</span>; |
| |
| <span class="comment">// Proof that `dP < p - 1`: |
| // |
| // If `dP < p` then either `dP == p - 1` or `dP < p - 1`. Since `p` is |
| // odd, `p - 1` is even. `d` is odd, and an odd number modulo an even |
| // number is odd. Therefore `dP` must be odd. But then it cannot be |
| // `p - 1` and so we know `dP < p - 1`. |
| // |
| // Further we know `dP != 0` because `dP` is not even. |
| </span><span class="kw">if </span>limb::limbs_are_even_constant_time(<span class="kw-2">&</span>dP) != LimbMask::False { |
| <span class="kw">return </span><span class="prelude-val">Err</span>(error::Unspecified); |
| } |
| |
| <span class="prelude-val">Ok</span>(<span class="self">Self </span>{ limbs: dP }) |
| } |
| } |
| |
| <span class="kw">impl</span><M: Prime> PrivateExponent<M> { |
| <span class="comment">// Returns `p - 2`. |
| </span><span class="kw">fn </span>for_flt(p: <span class="kw-2">&</span>Modulus<M>) -> <span class="self">Self </span>{ |
| <span class="kw">let </span>two = elem_add(p.one(), p.one(), p); |
| <span class="kw">let </span>p_minus_2 = elem_sub(p.zero(), <span class="kw-2">&</span>two, p); |
| <span class="self">Self </span>{ |
| limbs: p_minus_2.limbs, |
| } |
| } |
| } |
| |
| <span class="attribute">#[cfg(not(target_arch = <span class="string">"x86_64"</span>))] |
| </span><span class="kw">pub fn </span>elem_exp_consttime<M>( |
| base: Elem<M, R>, |
| exponent: <span class="kw-2">&</span>PrivateExponent<M>, |
| m: <span class="kw-2">&</span>Modulus<M>, |
| ) -> <span class="prelude-ty">Result</span><Elem<M, Unencoded>, error::Unspecified> { |
| <span class="kw">use </span><span class="kw">crate</span>::limb::Window; |
| |
| <span class="kw">const </span>WINDOW_BITS: usize = <span class="number">5</span>; |
| <span class="kw">const </span>TABLE_ENTRIES: usize = <span class="number">1 </span><< WINDOW_BITS; |
| |
| <span class="kw">let </span>num_limbs = m.limbs.len(); |
| |
| <span class="kw">let </span><span class="kw-2">mut </span>table = <span class="macro">vec!</span>[<span class="number">0</span>; TABLE_ENTRIES * num_limbs]; |
| |
| <span class="kw">fn </span>gather<M>(table: <span class="kw-2">&</span>[Limb], i: Window, r: <span class="kw-2">&mut </span>Elem<M, R>) { |
| <span class="kw">extern </span><span class="string">"C" </span>{ |
| <span class="kw">fn </span>LIMBS_select_512_32( |
| r: <span class="kw-2">*mut </span>Limb, |
| table: <span class="kw-2">*const </span>Limb, |
| num_limbs: c::size_t, |
| i: Window, |
| ) -> bssl::Result; |
| } |
| Result::from(<span class="kw">unsafe </span>{ |
| LIMBS_select_512_32(r.limbs.as_mut_ptr(), table.as_ptr(), r.limbs.len(), i) |
| }) |
| .unwrap(); |
| } |
| |
| <span class="kw">fn </span>power<M>( |
| table: <span class="kw-2">&</span>[Limb], |
| i: Window, |
| <span class="kw-2">mut </span>acc: Elem<M, R>, |
| <span class="kw-2">mut </span>tmp: Elem<M, R>, |
| m: <span class="kw-2">&</span>Modulus<M>, |
| ) -> (Elem<M, R>, Elem<M, R>) { |
| <span class="kw">for _ in </span><span class="number">0</span>..WINDOW_BITS { |
| acc = elem_squared(acc, <span class="kw-2">&</span>m.as_partial()); |
| } |
| gather(table, i, <span class="kw-2">&mut </span>tmp); |
| <span class="kw">let </span>acc = elem_mul(<span class="kw-2">&</span>tmp, acc, m); |
| (acc, tmp) |
| } |
| |
| <span class="kw">let </span>tmp = m.one(); |
| <span class="kw">let </span>tmp = elem_mul(m.oneRR().as_ref(), tmp, m); |
| |
| <span class="kw">fn </span>entry(table: <span class="kw-2">&</span>[Limb], i: usize, num_limbs: usize) -> <span class="kw-2">&</span>[Limb] { |
| <span class="kw-2">&</span>table[(i * num_limbs)..][..num_limbs] |
| } |
| <span class="kw">fn </span>entry_mut(table: <span class="kw-2">&mut </span>[Limb], i: usize, num_limbs: usize) -> <span class="kw-2">&mut </span>[Limb] { |
| <span class="kw-2">&mut </span>table[(i * num_limbs)..][..num_limbs] |
| } |
| <span class="kw">let </span>num_limbs = m.limbs.len(); |
| entry_mut(<span class="kw-2">&mut </span>table, <span class="number">0</span>, num_limbs).copy_from_slice(<span class="kw-2">&</span>tmp.limbs); |
| entry_mut(<span class="kw-2">&mut </span>table, <span class="number">1</span>, num_limbs).copy_from_slice(<span class="kw-2">&</span>base.limbs); |
| <span class="kw">for </span>i <span class="kw">in </span><span class="number">2</span>..TABLE_ENTRIES { |
| <span class="kw">let </span>(src1, src2) = <span class="kw">if </span>i % <span class="number">2 </span>== <span class="number">0 </span>{ |
| (i / <span class="number">2</span>, i / <span class="number">2</span>) |
| } <span class="kw">else </span>{ |
| (i - <span class="number">1</span>, <span class="number">1</span>) |
| }; |
| <span class="kw">let </span>(previous, rest) = table.split_at_mut(num_limbs * i); |
| <span class="kw">let </span>src1 = entry(previous, src1, num_limbs); |
| <span class="kw">let </span>src2 = entry(previous, src2, num_limbs); |
| <span class="kw">let </span>dst = entry_mut(rest, <span class="number">0</span>, num_limbs); |
| limbs_mont_product(dst, src1, src2, <span class="kw-2">&</span>m.limbs, <span class="kw-2">&</span>m.n0); |
| } |
| |
| <span class="kw">let </span>(r, <span class="kw">_</span>) = limb::fold_5_bit_windows( |
| <span class="kw-2">&</span>exponent.limbs, |
| |initial_window| { |
| <span class="kw">let </span><span class="kw-2">mut </span>r = Elem { |
| limbs: base.limbs, |
| encoding: PhantomData, |
| }; |
| gather(<span class="kw-2">&</span>table, initial_window, <span class="kw-2">&mut </span>r); |
| (r, tmp) |
| }, |
| |(acc, tmp), window| power(<span class="kw-2">&</span>table, window, acc, tmp, m), |
| ); |
| |
| <span class="kw">let </span>r = r.into_unencoded(m); |
| |
| <span class="prelude-val">Ok</span>(r) |
| } |
| |
| <span class="doccomment">/// Uses Fermat's Little Theorem to calculate modular inverse in constant time. |
| </span><span class="kw">pub fn </span>elem_inverse_consttime<M: Prime>( |
| a: Elem<M, R>, |
| m: <span class="kw-2">&</span>Modulus<M>, |
| ) -> <span class="prelude-ty">Result</span><Elem<M, Unencoded>, error::Unspecified> { |
| elem_exp_consttime(a, <span class="kw-2">&</span>PrivateExponent::for_flt(<span class="kw-2">&</span>m), m) |
| } |
| |
| <span class="attribute">#[cfg(target_arch = <span class="string">"x86_64"</span>)] |
| </span><span class="kw">pub fn </span>elem_exp_consttime<M>( |
| base: Elem<M, R>, |
| exponent: <span class="kw-2">&</span>PrivateExponent<M>, |
| m: <span class="kw-2">&</span>Modulus<M>, |
| ) -> <span class="prelude-ty">Result</span><Elem<M, Unencoded>, error::Unspecified> { |
| <span class="comment">// The x86_64 assembly was written under the assumption that the input data |
| // is aligned to `MOD_EXP_CTIME_MIN_CACHE_LINE_WIDTH` bytes, which was/is |
| // 64 in OpenSSL. Similarly, OpenSSL uses the x86_64 assembly functions by |
| // giving it only inputs `tmp`, `am`, and `np` that immediately follow the |
| // table. The code seems to "work" even when the inputs aren't exactly |
| // like that but the side channel defenses might not be as effective. All |
| // the awkwardness here stems from trying to use the assembly code like |
| // OpenSSL does. |
| |
| </span><span class="kw">use </span><span class="kw">crate</span>::limb::Window; |
| |
| <span class="kw">const </span>WINDOW_BITS: usize = <span class="number">5</span>; |
| <span class="kw">const </span>TABLE_ENTRIES: usize = <span class="number">1 </span><< WINDOW_BITS; |
| |
| <span class="kw">let </span>num_limbs = m.limbs.len(); |
| |
| <span class="kw">const </span>ALIGNMENT: usize = <span class="number">64</span>; |
| <span class="macro">assert_eq!</span>(ALIGNMENT % LIMB_BYTES, <span class="number">0</span>); |
| <span class="kw">let </span><span class="kw-2">mut </span>table = <span class="macro">vec!</span>[<span class="number">0</span>; ((TABLE_ENTRIES + <span class="number">3</span>) * num_limbs) + ALIGNMENT]; |
| <span class="kw">let </span>(table, state) = { |
| <span class="kw">let </span>misalignment = (table.as_ptr() <span class="kw">as </span>usize) % ALIGNMENT; |
| <span class="kw">let </span>table = <span class="kw-2">&mut </span>table[((ALIGNMENT - misalignment) / LIMB_BYTES)..]; |
| <span class="macro">assert_eq!</span>((table.as_ptr() <span class="kw">as </span>usize) % ALIGNMENT, <span class="number">0</span>); |
| table.split_at_mut(TABLE_ENTRIES * num_limbs) |
| }; |
| |
| <span class="kw">fn </span>entry(table: <span class="kw-2">&</span>[Limb], i: usize, num_limbs: usize) -> <span class="kw-2">&</span>[Limb] { |
| <span class="kw-2">&</span>table[(i * num_limbs)..][..num_limbs] |
| } |
| <span class="kw">fn </span>entry_mut(table: <span class="kw-2">&mut </span>[Limb], i: usize, num_limbs: usize) -> <span class="kw-2">&mut </span>[Limb] { |
| <span class="kw-2">&mut </span>table[(i * num_limbs)..][..num_limbs] |
| } |
| |
| <span class="kw">const </span>ACC: usize = <span class="number">0</span>; <span class="comment">// `tmp` in OpenSSL |
| </span><span class="kw">const </span>BASE: usize = ACC + <span class="number">1</span>; <span class="comment">// `am` in OpenSSL |
| </span><span class="kw">const </span>M: usize = BASE + <span class="number">1</span>; <span class="comment">// `np` in OpenSSL |
| |
| </span>entry_mut(state, BASE, num_limbs).copy_from_slice(<span class="kw-2">&</span>base.limbs); |
| entry_mut(state, M, num_limbs).copy_from_slice(<span class="kw-2">&</span>m.limbs); |
| |
| <span class="kw">fn </span>scatter(table: <span class="kw-2">&mut </span>[Limb], state: <span class="kw-2">&</span>[Limb], i: Window, num_limbs: usize) { |
| <span class="kw">extern </span><span class="string">"C" </span>{ |
| <span class="kw">fn </span>GFp_bn_scatter5(a: <span class="kw-2">*const </span>Limb, a_len: c::size_t, table: <span class="kw-2">*mut </span>Limb, i: Window); |
| } |
| <span class="kw">unsafe </span>{ |
| GFp_bn_scatter5( |
| entry(state, ACC, num_limbs).as_ptr(), |
| num_limbs, |
| table.as_mut_ptr(), |
| i, |
| ) |
| } |
| } |
| |
| <span class="kw">fn </span>gather(table: <span class="kw-2">&</span>[Limb], state: <span class="kw-2">&mut </span>[Limb], i: Window, num_limbs: usize) { |
| <span class="kw">extern </span><span class="string">"C" </span>{ |
| <span class="kw">fn </span>GFp_bn_gather5(r: <span class="kw-2">*mut </span>Limb, a_len: c::size_t, table: <span class="kw-2">*const </span>Limb, i: Window); |
| } |
| <span class="kw">unsafe </span>{ |
| GFp_bn_gather5( |
| entry_mut(state, ACC, num_limbs).as_mut_ptr(), |
| num_limbs, |
| table.as_ptr(), |
| i, |
| ) |
| } |
| } |
| |
| <span class="kw">fn </span>gather_square(table: <span class="kw-2">&</span>[Limb], state: <span class="kw-2">&mut </span>[Limb], n0: <span class="kw-2">&</span>N0, i: Window, num_limbs: usize) { |
| gather(table, state, i, num_limbs); |
| <span class="macro">assert_eq!</span>(ACC, <span class="number">0</span>); |
| <span class="kw">let </span>(acc, rest) = state.split_at_mut(num_limbs); |
| <span class="kw">let </span>m = entry(rest, M - <span class="number">1</span>, num_limbs); |
| limbs_mont_square(acc, m, n0); |
| } |
| |
| <span class="kw">fn </span>gather_mul_base(table: <span class="kw-2">&</span>[Limb], state: <span class="kw-2">&mut </span>[Limb], n0: <span class="kw-2">&</span>N0, i: Window, num_limbs: usize) { |
| <span class="kw">extern </span><span class="string">"C" </span>{ |
| <span class="kw">fn </span>GFp_bn_mul_mont_gather5( |
| rp: <span class="kw-2">*mut </span>Limb, |
| ap: <span class="kw-2">*const </span>Limb, |
| table: <span class="kw-2">*const </span>Limb, |
| np: <span class="kw-2">*const </span>Limb, |
| n0: <span class="kw-2">&</span>N0, |
| num: c::size_t, |
| power: Window, |
| ); |
| } |
| <span class="kw">unsafe </span>{ |
| GFp_bn_mul_mont_gather5( |
| entry_mut(state, ACC, num_limbs).as_mut_ptr(), |
| entry(state, BASE, num_limbs).as_ptr(), |
| table.as_ptr(), |
| entry(state, M, num_limbs).as_ptr(), |
| n0, |
| num_limbs, |
| i, |
| ); |
| } |
| } |
| |
| <span class="kw">fn </span>power(table: <span class="kw-2">&</span>[Limb], state: <span class="kw-2">&mut </span>[Limb], n0: <span class="kw-2">&</span>N0, i: Window, num_limbs: usize) { |
| <span class="kw">extern </span><span class="string">"C" </span>{ |
| <span class="kw">fn </span>GFp_bn_power5( |
| r: <span class="kw-2">*mut </span>Limb, |
| a: <span class="kw-2">*const </span>Limb, |
| table: <span class="kw-2">*const </span>Limb, |
| n: <span class="kw-2">*const </span>Limb, |
| n0: <span class="kw-2">&</span>N0, |
| num: c::size_t, |
| i: Window, |
| ); |
| } |
| <span class="kw">unsafe </span>{ |
| GFp_bn_power5( |
| entry_mut(state, ACC, num_limbs).as_mut_ptr(), |
| entry_mut(state, ACC, num_limbs).as_mut_ptr(), |
| table.as_ptr(), |
| entry(state, M, num_limbs).as_ptr(), |
| n0, |
| num_limbs, |
| i, |
| ); |
| } |
| } |
| |
| <span class="comment">// table[0] = base**0. |
| </span>{ |
| <span class="kw">let </span>acc = entry_mut(state, ACC, num_limbs); |
| acc[<span class="number">0</span>] = <span class="number">1</span>; |
| limbs_mont_mul(acc, <span class="kw-2">&</span>m.oneRR.<span class="number">0</span>.limbs, <span class="kw-2">&</span>m.limbs, <span class="kw-2">&</span>m.n0); |
| } |
| scatter(table, state, <span class="number">0</span>, num_limbs); |
| |
| <span class="comment">// table[1] = base**1. |
| </span>entry_mut(state, ACC, num_limbs).copy_from_slice(<span class="kw-2">&</span>base.limbs); |
| scatter(table, state, <span class="number">1</span>, num_limbs); |
| |
| <span class="kw">for </span>i <span class="kw">in </span><span class="number">2</span>..(TABLE_ENTRIES <span class="kw">as </span>Window) { |
| <span class="kw">if </span>i % <span class="number">2 </span>== <span class="number">0 </span>{ |
| <span class="comment">// TODO: Optimize this to avoid gathering |
| </span>gather_square(table, state, <span class="kw-2">&</span>m.n0, i / <span class="number">2</span>, num_limbs); |
| } <span class="kw">else </span>{ |
| gather_mul_base(table, state, <span class="kw-2">&</span>m.n0, i - <span class="number">1</span>, num_limbs) |
| }; |
| scatter(table, state, i, num_limbs); |
| } |
| |
| <span class="kw">let </span>state = limb::fold_5_bit_windows( |
| <span class="kw-2">&</span>exponent.limbs, |
| |initial_window| { |
| gather(table, state, initial_window, num_limbs); |
| state |
| }, |
| |state, window| { |
| power(table, state, <span class="kw-2">&</span>m.n0, window, num_limbs); |
| state |
| }, |
| ); |
| |
| <span class="kw">extern </span><span class="string">"C" </span>{ |
| <span class="kw">fn </span>GFp_bn_from_montgomery( |
| r: <span class="kw-2">*mut </span>Limb, |
| a: <span class="kw-2">*const </span>Limb, |
| not_used: <span class="kw-2">*const </span>Limb, |
| n: <span class="kw-2">*const </span>Limb, |
| n0: <span class="kw-2">&</span>N0, |
| num: c::size_t, |
| ) -> bssl::Result; |
| } |
| Result::from(<span class="kw">unsafe </span>{ |
| GFp_bn_from_montgomery( |
| entry_mut(state, ACC, num_limbs).as_mut_ptr(), |
| entry(state, ACC, num_limbs).as_ptr(), |
| core::ptr::null(), |
| entry(state, M, num_limbs).as_ptr(), |
| <span class="kw-2">&</span>m.n0, |
| num_limbs, |
| ) |
| })<span class="question-mark">?</span>; |
| <span class="kw">let </span><span class="kw-2">mut </span>r = Elem { |
| limbs: base.limbs, |
| encoding: PhantomData, |
| }; |
| r.limbs.copy_from_slice(entry(state, ACC, num_limbs)); |
| <span class="prelude-val">Ok</span>(r) |
| } |
| |
| <span class="doccomment">/// Verified a == b**-1 (mod m), i.e. a**-1 == b (mod m). |
| </span><span class="kw">pub fn </span>verify_inverses_consttime<M>( |
| a: <span class="kw-2">&</span>Elem<M, R>, |
| b: Elem<M, Unencoded>, |
| m: <span class="kw-2">&</span>Modulus<M>, |
| ) -> <span class="prelude-ty">Result</span><(), error::Unspecified> { |
| <span class="kw">if </span>elem_mul(a, b, m).is_one() { |
| <span class="prelude-val">Ok</span>(()) |
| } <span class="kw">else </span>{ |
| <span class="prelude-val">Err</span>(error::Unspecified) |
| } |
| } |
| |
| <span class="attribute">#[inline] |
| </span><span class="kw">pub fn </span>elem_verify_equal_consttime<M, E>( |
| a: <span class="kw-2">&</span>Elem<M, E>, |
| b: <span class="kw-2">&</span>Elem<M, E>, |
| ) -> <span class="prelude-ty">Result</span><(), error::Unspecified> { |
| <span class="kw">if </span>limb::limbs_equal_limbs_consttime(<span class="kw-2">&</span>a.limbs, <span class="kw-2">&</span>b.limbs) == LimbMask::True { |
| <span class="prelude-val">Ok</span>(()) |
| } <span class="kw">else </span>{ |
| <span class="prelude-val">Err</span>(error::Unspecified) |
| } |
| } |
| |
| <span class="doccomment">/// Nonnegative integers. |
| </span><span class="kw">pub struct </span>Nonnegative { |
| limbs: Vec<Limb>, |
| } |
| |
| <span class="kw">impl </span>Nonnegative { |
| <span class="kw">pub fn </span>from_be_bytes_with_bit_length( |
| input: untrusted::Input, |
| ) -> <span class="prelude-ty">Result</span><(<span class="self">Self</span>, bits::BitLength), error::Unspecified> { |
| <span class="kw">let </span><span class="kw-2">mut </span>limbs = <span class="macro">vec!</span>[<span class="number">0</span>; (input.len() + LIMB_BYTES - <span class="number">1</span>) / LIMB_BYTES]; |
| <span class="comment">// Rejects empty inputs. |
| </span>limb::parse_big_endian_and_pad_consttime(input, <span class="kw-2">&mut </span>limbs)<span class="question-mark">?</span>; |
| <span class="kw">while </span>limbs.last() == <span class="prelude-val">Some</span>(<span class="kw-2">&</span><span class="number">0</span>) { |
| <span class="kw">let _ </span>= limbs.pop(); |
| } |
| <span class="kw">let </span>r_bits = limb::limbs_minimal_bits(<span class="kw-2">&</span>limbs); |
| <span class="prelude-val">Ok</span>((<span class="self">Self </span>{ limbs }, r_bits)) |
| } |
| |
| <span class="attribute">#[inline] |
| </span><span class="kw">pub fn </span>is_odd(<span class="kw-2">&</span><span class="self">self</span>) -> bool { |
| limb::limbs_are_even_constant_time(<span class="kw-2">&</span><span class="self">self</span>.limbs) != LimbMask::True |
| } |
| |
| <span class="kw">pub fn </span>verify_less_than(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span><span class="self">Self</span>) -> <span class="prelude-ty">Result</span><(), error::Unspecified> { |
| <span class="kw">if </span>!greater_than(other, <span class="self">self</span>) { |
| <span class="kw">return </span><span class="prelude-val">Err</span>(error::Unspecified); |
| } |
| <span class="prelude-val">Ok</span>(()) |
| } |
| |
| <span class="kw">pub fn </span>to_elem<M>(<span class="kw-2">&</span><span class="self">self</span>, m: <span class="kw-2">&</span>Modulus<M>) -> <span class="prelude-ty">Result</span><Elem<M, Unencoded>, error::Unspecified> { |
| <span class="self">self</span>.verify_less_than_modulus(<span class="kw-2">&</span>m)<span class="question-mark">?</span>; |
| <span class="kw">let </span><span class="kw-2">mut </span>r = m.zero(); |
| r.limbs[<span class="number">0</span>..<span class="self">self</span>.limbs.len()].copy_from_slice(<span class="kw-2">&</span><span class="self">self</span>.limbs); |
| <span class="prelude-val">Ok</span>(r) |
| } |
| |
| <span class="kw">pub fn </span>verify_less_than_modulus<M>(<span class="kw-2">&</span><span class="self">self</span>, m: <span class="kw-2">&</span>Modulus<M>) -> <span class="prelude-ty">Result</span><(), error::Unspecified> { |
| <span class="kw">if </span><span class="self">self</span>.limbs.len() > m.limbs.len() { |
| <span class="kw">return </span><span class="prelude-val">Err</span>(error::Unspecified); |
| } |
| <span class="kw">if </span><span class="self">self</span>.limbs.len() == m.limbs.len() { |
| <span class="kw">if </span>limb::limbs_less_than_limbs_consttime(<span class="kw-2">&</span><span class="self">self</span>.limbs, <span class="kw-2">&</span>m.limbs) != LimbMask::True { |
| <span class="kw">return </span><span class="prelude-val">Err</span>(error::Unspecified); |
| } |
| } |
| <span class="prelude-val">Ok</span>(()) |
| } |
| } |
| |
| <span class="comment">// Returns a > b. |
| </span><span class="kw">fn </span>greater_than(a: <span class="kw-2">&</span>Nonnegative, b: <span class="kw-2">&</span>Nonnegative) -> bool { |
| <span class="kw">if </span>a.limbs.len() == b.limbs.len() { |
| limb::limbs_less_than_limbs_vartime(<span class="kw-2">&</span>b.limbs, <span class="kw-2">&</span>a.limbs) |
| } <span class="kw">else </span>{ |
| a.limbs.len() > b.limbs.len() |
| } |
| } |
| |
| <span class="attribute">#[derive(Clone)] |
| #[repr(transparent)] |
| </span><span class="kw">struct </span>N0([Limb; <span class="number">2</span>]); |
| |
| <span class="kw">const </span>N0_LIMBS_USED: usize = <span class="number">64 </span>/ LIMB_BITS; |
| |
| <span class="kw">impl </span>From<u64> <span class="kw">for </span>N0 { |
| <span class="attribute">#[inline] |
| </span><span class="kw">fn </span>from(n0: u64) -> <span class="self">Self </span>{ |
| <span class="attribute">#[cfg(target_pointer_width = <span class="string">"64"</span>)] |
| </span>{ |
| <span class="self">Self</span>([n0, <span class="number">0</span>]) |
| } |
| |
| <span class="attribute">#[cfg(target_pointer_width = <span class="string">"32"</span>)] |
| </span>{ |
| <span class="self">Self</span>([n0 <span class="kw">as </span>Limb, (n0 >> LIMB_BITS) <span class="kw">as </span>Limb]) |
| } |
| } |
| } |
| |
| <span class="doccomment">/// r *= a |
| </span><span class="kw">fn </span>limbs_mont_mul(r: <span class="kw-2">&mut </span>[Limb], a: <span class="kw-2">&</span>[Limb], m: <span class="kw-2">&</span>[Limb], n0: <span class="kw-2">&</span>N0) { |
| <span class="macro">debug_assert_eq!</span>(r.len(), m.len()); |
| <span class="macro">debug_assert_eq!</span>(a.len(), m.len()); |
| |
| <span class="attribute">#[cfg(any( |
| target_arch = <span class="string">"aarch64"</span>, |
| target_arch = <span class="string">"arm"</span>, |
| target_arch = <span class="string">"x86_64"</span>, |
| target_arch = <span class="string">"x86" |
| </span>))] |
| </span><span class="kw">unsafe </span>{ |
| GFp_bn_mul_mont( |
| r.as_mut_ptr(), |
| r.as_ptr(), |
| a.as_ptr(), |
| m.as_ptr(), |
| n0, |
| r.len(), |
| ) |
| } |
| |
| <span class="attribute">#[cfg(not(any( |
| target_arch = <span class="string">"aarch64"</span>, |
| target_arch = <span class="string">"arm"</span>, |
| target_arch = <span class="string">"x86_64"</span>, |
| target_arch = <span class="string">"x86" |
| </span>)))] |
| </span>{ |
| <span class="kw">let </span><span class="kw-2">mut </span>tmp = [<span class="number">0</span>; <span class="number">2 </span>* MODULUS_MAX_LIMBS]; |
| <span class="kw">let </span>tmp = <span class="kw-2">&mut </span>tmp[..(<span class="number">2 </span>* a.len())]; |
| limbs_mul(tmp, r, a); |
| limbs_from_mont_in_place(r, tmp, m, n0); |
| } |
| } |
| |
| <span class="kw">fn </span>limbs_from_mont_in_place(r: <span class="kw-2">&mut </span>[Limb], tmp: <span class="kw-2">&mut </span>[Limb], m: <span class="kw-2">&</span>[Limb], n0: <span class="kw-2">&</span>N0) { |
| <span class="kw">extern </span><span class="string">"C" </span>{ |
| <span class="kw">fn </span>GFp_bn_from_montgomery_in_place( |
| r: <span class="kw-2">*mut </span>Limb, |
| num_r: c::size_t, |
| a: <span class="kw-2">*mut </span>Limb, |
| num_a: c::size_t, |
| n: <span class="kw-2">*const </span>Limb, |
| num_n: c::size_t, |
| n0: <span class="kw-2">&</span>N0, |
| ) -> bssl::Result; |
| } |
| Result::from(<span class="kw">unsafe </span>{ |
| GFp_bn_from_montgomery_in_place( |
| r.as_mut_ptr(), |
| r.len(), |
| tmp.as_mut_ptr(), |
| tmp.len(), |
| m.as_ptr(), |
| m.len(), |
| <span class="kw-2">&</span>n0, |
| ) |
| }) |
| .unwrap() |
| } |
| |
| <span class="attribute">#[cfg(not(any( |
| target_arch = <span class="string">"aarch64"</span>, |
| target_arch = <span class="string">"arm"</span>, |
| target_arch = <span class="string">"x86_64"</span>, |
| target_arch = <span class="string">"x86" |
| </span>)))] |
| </span><span class="kw">fn </span>limbs_mul(r: <span class="kw-2">&mut </span>[Limb], a: <span class="kw-2">&</span>[Limb], b: <span class="kw-2">&</span>[Limb]) { |
| <span class="macro">debug_assert_eq!</span>(r.len(), <span class="number">2 </span>* a.len()); |
| <span class="macro">debug_assert_eq!</span>(a.len(), b.len()); |
| <span class="kw">let </span>ab_len = a.len(); |
| |
| <span class="kw">crate</span>::polyfill::slice::fill(<span class="kw-2">&mut </span>r[..ab_len], <span class="number">0</span>); |
| <span class="kw">for </span>(i, <span class="kw-2">&</span>b_limb) <span class="kw">in </span>b.iter().enumerate() { |
| r[ab_len + i] = <span class="kw">unsafe </span>{ |
| GFp_limbs_mul_add_limb( |
| (<span class="kw-2">&mut </span>r[i..][..ab_len]).as_mut_ptr(), |
| a.as_ptr(), |
| b_limb, |
| ab_len, |
| ) |
| }; |
| } |
| } |
| |
| <span class="doccomment">/// r = a * b |
| </span><span class="attribute">#[cfg(not(target_arch = <span class="string">"x86_64"</span>))] |
| </span><span class="kw">fn </span>limbs_mont_product(r: <span class="kw-2">&mut </span>[Limb], a: <span class="kw-2">&</span>[Limb], b: <span class="kw-2">&</span>[Limb], m: <span class="kw-2">&</span>[Limb], n0: <span class="kw-2">&</span>N0) { |
| <span class="macro">debug_assert_eq!</span>(r.len(), m.len()); |
| <span class="macro">debug_assert_eq!</span>(a.len(), m.len()); |
| <span class="macro">debug_assert_eq!</span>(b.len(), m.len()); |
| |
| <span class="attribute">#[cfg(any( |
| target_arch = <span class="string">"aarch64"</span>, |
| target_arch = <span class="string">"arm"</span>, |
| target_arch = <span class="string">"x86_64"</span>, |
| target_arch = <span class="string">"x86" |
| </span>))] |
| </span><span class="kw">unsafe </span>{ |
| GFp_bn_mul_mont( |
| r.as_mut_ptr(), |
| a.as_ptr(), |
| b.as_ptr(), |
| m.as_ptr(), |
| n0, |
| r.len(), |
| ) |
| } |
| |
| <span class="attribute">#[cfg(not(any( |
| target_arch = <span class="string">"aarch64"</span>, |
| target_arch = <span class="string">"arm"</span>, |
| target_arch = <span class="string">"x86_64"</span>, |
| target_arch = <span class="string">"x86" |
| </span>)))] |
| </span>{ |
| <span class="kw">let </span><span class="kw-2">mut </span>tmp = [<span class="number">0</span>; <span class="number">2 </span>* MODULUS_MAX_LIMBS]; |
| <span class="kw">let </span>tmp = <span class="kw-2">&mut </span>tmp[..(<span class="number">2 </span>* a.len())]; |
| limbs_mul(tmp, a, b); |
| limbs_from_mont_in_place(r, tmp, m, n0) |
| } |
| } |
| |
| <span class="doccomment">/// r = r**2 |
| </span><span class="kw">fn </span>limbs_mont_square(r: <span class="kw-2">&mut </span>[Limb], m: <span class="kw-2">&</span>[Limb], n0: <span class="kw-2">&</span>N0) { |
| <span class="macro">debug_assert_eq!</span>(r.len(), m.len()); |
| <span class="attribute">#[cfg(any( |
| target_arch = <span class="string">"aarch64"</span>, |
| target_arch = <span class="string">"arm"</span>, |
| target_arch = <span class="string">"x86_64"</span>, |
| target_arch = <span class="string">"x86" |
| </span>))] |
| </span><span class="kw">unsafe </span>{ |
| GFp_bn_mul_mont( |
| r.as_mut_ptr(), |
| r.as_ptr(), |
| r.as_ptr(), |
| m.as_ptr(), |
| n0, |
| r.len(), |
| ) |
| } |
| |
| <span class="attribute">#[cfg(not(any( |
| target_arch = <span class="string">"aarch64"</span>, |
| target_arch = <span class="string">"arm"</span>, |
| target_arch = <span class="string">"x86_64"</span>, |
| target_arch = <span class="string">"x86" |
| </span>)))] |
| </span>{ |
| <span class="kw">let </span><span class="kw-2">mut </span>tmp = [<span class="number">0</span>; <span class="number">2 </span>* MODULUS_MAX_LIMBS]; |
| <span class="kw">let </span>tmp = <span class="kw-2">&mut </span>tmp[..(<span class="number">2 </span>* r.len())]; |
| limbs_mul(tmp, r, r); |
| limbs_from_mont_in_place(r, tmp, m, n0) |
| } |
| } |
| |
| <span class="kw">extern </span><span class="string">"C" </span>{ |
| <span class="attribute">#[cfg(any( |
| target_arch = <span class="string">"aarch64"</span>, |
| target_arch = <span class="string">"arm"</span>, |
| target_arch = <span class="string">"x86_64"</span>, |
| target_arch = <span class="string">"x86" |
| </span>))] |
| </span><span class="comment">// `r` and/or 'a' and/or 'b' may alias. |
| </span><span class="kw">fn </span>GFp_bn_mul_mont( |
| r: <span class="kw-2">*mut </span>Limb, |
| a: <span class="kw-2">*const </span>Limb, |
| b: <span class="kw-2">*const </span>Limb, |
| n: <span class="kw-2">*const </span>Limb, |
| n0: <span class="kw-2">&</span>N0, |
| num_limbs: c::size_t, |
| ); |
| |
| <span class="comment">// `r` must not alias `a` |
| </span><span class="attribute">#[cfg(any( |
| test, |
| not(any( |
| target_arch = <span class="string">"aarch64"</span>, |
| target_arch = <span class="string">"arm"</span>, |
| target_arch = <span class="string">"x86_64"</span>, |
| target_arch = <span class="string">"x86" |
| </span>)) |
| ))] |
| #[must_use] |
| </span><span class="kw">fn </span>GFp_limbs_mul_add_limb(r: <span class="kw-2">*mut </span>Limb, a: <span class="kw-2">*const </span>Limb, b: Limb, num_limbs: c::size_t) -> Limb; |
| } |
| |
| <span class="attribute">#[cfg(test)] |
| </span><span class="kw">mod </span>tests { |
| <span class="kw">use super</span>::<span class="kw-2">*</span>; |
| <span class="kw">use </span><span class="kw">crate</span>::test; |
| <span class="kw">use </span>alloc::format; |
| |
| <span class="comment">// Type-level representation of an arbitrary modulus. |
| </span><span class="kw">struct </span>M {} |
| |
| <span class="kw">unsafe impl </span>PublicModulus <span class="kw">for </span>M {} |
| |
| <span class="attribute">#[test] |
| </span><span class="kw">fn </span>test_elem_exp_consttime() { |
| test::run( |
| <span class="macro">test_file!</span>(<span class="string">"bigint_elem_exp_consttime_tests.txt"</span>), |
| |section, test_case| { |
| <span class="macro">assert_eq!</span>(section, <span class="string">""</span>); |
| |
| <span class="kw">let </span>m = consume_modulus::<M>(test_case, <span class="string">"M"</span>); |
| <span class="kw">let </span>expected_result = consume_elem(test_case, <span class="string">"ModExp"</span>, <span class="kw-2">&</span>m); |
| <span class="kw">let </span>base = consume_elem(test_case, <span class="string">"A"</span>, <span class="kw-2">&</span>m); |
| <span class="kw">let </span>e = { |
| <span class="kw">let </span>bytes = test_case.consume_bytes(<span class="string">"E"</span>); |
| PrivateExponent::from_be_bytes_padded(untrusted::Input::from(<span class="kw-2">&</span>bytes), <span class="kw-2">&</span>m) |
| .expect(<span class="string">"valid exponent"</span>) |
| }; |
| <span class="kw">let </span>base = into_encoded(base, <span class="kw-2">&</span>m); |
| <span class="kw">let </span>actual_result = elem_exp_consttime(base, <span class="kw-2">&</span>e, <span class="kw-2">&</span>m).unwrap(); |
| assert_elem_eq(<span class="kw-2">&</span>actual_result, <span class="kw-2">&</span>expected_result); |
| |
| <span class="prelude-val">Ok</span>(()) |
| }, |
| ) |
| } |
| |
| <span class="comment">// TODO: fn test_elem_exp_vartime() using |
| // "src/rsa/bigint_elem_exp_vartime_tests.txt". See that file for details. |
| // In the meantime, the function is tested indirectly via the RSA |
| // verification and signing tests. |
| </span><span class="attribute">#[test] |
| </span><span class="kw">fn </span>test_elem_mul() { |
| test::run( |
| <span class="macro">test_file!</span>(<span class="string">"bigint_elem_mul_tests.txt"</span>), |
| |section, test_case| { |
| <span class="macro">assert_eq!</span>(section, <span class="string">""</span>); |
| |
| <span class="kw">let </span>m = consume_modulus::<M>(test_case, <span class="string">"M"</span>); |
| <span class="kw">let </span>expected_result = consume_elem(test_case, <span class="string">"ModMul"</span>, <span class="kw-2">&</span>m); |
| <span class="kw">let </span>a = consume_elem(test_case, <span class="string">"A"</span>, <span class="kw-2">&</span>m); |
| <span class="kw">let </span>b = consume_elem(test_case, <span class="string">"B"</span>, <span class="kw-2">&</span>m); |
| |
| <span class="kw">let </span>b = into_encoded(b, <span class="kw-2">&</span>m); |
| <span class="kw">let </span>a = into_encoded(a, <span class="kw-2">&</span>m); |
| <span class="kw">let </span>actual_result = elem_mul(<span class="kw-2">&</span>a, b, <span class="kw-2">&</span>m); |
| <span class="kw">let </span>actual_result = actual_result.into_unencoded(<span class="kw-2">&</span>m); |
| assert_elem_eq(<span class="kw-2">&</span>actual_result, <span class="kw-2">&</span>expected_result); |
| |
| <span class="prelude-val">Ok</span>(()) |
| }, |
| ) |
| } |
| |
| <span class="attribute">#[test] |
| </span><span class="kw">fn </span>test_elem_squared() { |
| test::run( |
| <span class="macro">test_file!</span>(<span class="string">"bigint_elem_squared_tests.txt"</span>), |
| |section, test_case| { |
| <span class="macro">assert_eq!</span>(section, <span class="string">""</span>); |
| |
| <span class="kw">let </span>m = consume_modulus::<M>(test_case, <span class="string">"M"</span>); |
| <span class="kw">let </span>expected_result = consume_elem(test_case, <span class="string">"ModSquare"</span>, <span class="kw-2">&</span>m); |
| <span class="kw">let </span>a = consume_elem(test_case, <span class="string">"A"</span>, <span class="kw-2">&</span>m); |
| |
| <span class="kw">let </span>a = into_encoded(a, <span class="kw-2">&</span>m); |
| <span class="kw">let </span>actual_result = elem_squared(a, <span class="kw-2">&</span>m.as_partial()); |
| <span class="kw">let </span>actual_result = actual_result.into_unencoded(<span class="kw-2">&</span>m); |
| assert_elem_eq(<span class="kw-2">&</span>actual_result, <span class="kw-2">&</span>expected_result); |
| |
| <span class="prelude-val">Ok</span>(()) |
| }, |
| ) |
| } |
| |
| <span class="attribute">#[test] |
| </span><span class="kw">fn </span>test_elem_reduced() { |
| test::run( |
| <span class="macro">test_file!</span>(<span class="string">"bigint_elem_reduced_tests.txt"</span>), |
| |section, test_case| { |
| <span class="macro">assert_eq!</span>(section, <span class="string">""</span>); |
| |
| <span class="kw">struct </span>MM {} |
| <span class="kw">unsafe impl </span>SmallerModulus<MM> <span class="kw">for </span>M {} |
| <span class="kw">unsafe impl </span>NotMuchSmallerModulus<MM> <span class="kw">for </span>M {} |
| |
| <span class="kw">let </span>m = consume_modulus::<M>(test_case, <span class="string">"M"</span>); |
| <span class="kw">let </span>expected_result = consume_elem(test_case, <span class="string">"R"</span>, <span class="kw-2">&</span>m); |
| <span class="kw">let </span>a = |
| consume_elem_unchecked::<MM>(test_case, <span class="string">"A"</span>, expected_result.limbs.len() * <span class="number">2</span>); |
| |
| <span class="kw">let </span>actual_result = elem_reduced(<span class="kw-2">&</span>a, <span class="kw-2">&</span>m); |
| <span class="kw">let </span>oneRR = m.oneRR(); |
| <span class="kw">let </span>actual_result = elem_mul(oneRR.as_ref(), actual_result, <span class="kw-2">&</span>m); |
| assert_elem_eq(<span class="kw-2">&</span>actual_result, <span class="kw-2">&</span>expected_result); |
| |
| <span class="prelude-val">Ok</span>(()) |
| }, |
| ) |
| } |
| |
| <span class="attribute">#[test] |
| </span><span class="kw">fn </span>test_elem_reduced_once() { |
| test::run( |
| <span class="macro">test_file!</span>(<span class="string">"bigint_elem_reduced_once_tests.txt"</span>), |
| |section, test_case| { |
| <span class="macro">assert_eq!</span>(section, <span class="string">""</span>); |
| |
| <span class="kw">struct </span>N {} |
| <span class="kw">struct </span>QQ {} |
| <span class="kw">unsafe impl </span>SmallerModulus<N> <span class="kw">for </span>QQ {} |
| <span class="kw">unsafe impl </span>SlightlySmallerModulus<N> <span class="kw">for </span>QQ {} |
| |
| <span class="kw">let </span>qq = consume_modulus::<QQ>(test_case, <span class="string">"QQ"</span>); |
| <span class="kw">let </span>expected_result = consume_elem::<QQ>(test_case, <span class="string">"R"</span>, <span class="kw-2">&</span>qq); |
| <span class="kw">let </span>n = consume_modulus::<N>(test_case, <span class="string">"N"</span>); |
| <span class="kw">let </span>a = consume_elem::<N>(test_case, <span class="string">"A"</span>, <span class="kw-2">&</span>n); |
| |
| <span class="kw">let </span>actual_result = elem_reduced_once(<span class="kw-2">&</span>a, <span class="kw-2">&</span>qq); |
| assert_elem_eq(<span class="kw-2">&</span>actual_result, <span class="kw-2">&</span>expected_result); |
| |
| <span class="prelude-val">Ok</span>(()) |
| }, |
| ) |
| } |
| |
| <span class="attribute">#[test] |
| </span><span class="kw">fn </span>test_modulus_debug() { |
| <span class="kw">let </span>(modulus, <span class="kw">_</span>) = Modulus::<M>::from_be_bytes_with_bit_length(untrusted::Input::from( |
| <span class="kw-2">&</span>[<span class="number">0xff</span>; LIMB_BYTES * MODULUS_MIN_LIMBS], |
| )) |
| .unwrap(); |
| <span class="macro">assert_eq!</span>(<span class="string">"Modulus"</span>, <span class="macro">format!</span>(<span class="string">"{:?}"</span>, modulus)); |
| } |
| |
| <span class="attribute">#[test] |
| </span><span class="kw">fn </span>test_public_exponent_debug() { |
| <span class="kw">let </span>exponent = |
| PublicExponent::from_be_bytes(untrusted::Input::from(<span class="kw-2">&</span>[<span class="number">0x1</span>, <span class="number">0x00</span>, <span class="number">0x01</span>]), <span class="number">65537</span>) |
| .unwrap(); |
| <span class="macro">assert_eq!</span>(<span class="string">"PublicExponent(65537)"</span>, <span class="macro">format!</span>(<span class="string">"{:?}"</span>, exponent)); |
| } |
| |
| <span class="kw">fn </span>consume_elem<M>( |
| test_case: <span class="kw-2">&mut </span>test::TestCase, |
| name: <span class="kw-2">&</span>str, |
| m: <span class="kw-2">&</span>Modulus<M>, |
| ) -> Elem<M, Unencoded> { |
| <span class="kw">let </span>value = test_case.consume_bytes(name); |
| Elem::from_be_bytes_padded(untrusted::Input::from(<span class="kw-2">&</span>value), m).unwrap() |
| } |
| |
| <span class="kw">fn </span>consume_elem_unchecked<M>( |
| test_case: <span class="kw-2">&mut </span>test::TestCase, |
| name: <span class="kw-2">&</span>str, |
| num_limbs: usize, |
| ) -> Elem<M, Unencoded> { |
| <span class="kw">let </span>value = consume_nonnegative(test_case, name); |
| <span class="kw">let </span><span class="kw-2">mut </span>limbs = BoxedLimbs::zero(Width { |
| num_limbs, |
| m: PhantomData, |
| }); |
| limbs[<span class="number">0</span>..value.limbs.len()].copy_from_slice(<span class="kw-2">&</span>value.limbs); |
| Elem { |
| limbs, |
| encoding: PhantomData, |
| } |
| } |
| |
| <span class="kw">fn </span>consume_modulus<M>(test_case: <span class="kw-2">&mut </span>test::TestCase, name: <span class="kw-2">&</span>str) -> Modulus<M> { |
| <span class="kw">let </span>value = test_case.consume_bytes(name); |
| <span class="kw">let </span>(value, <span class="kw">_</span>) = |
| Modulus::from_be_bytes_with_bit_length(untrusted::Input::from(<span class="kw-2">&</span>value)).unwrap(); |
| value |
| } |
| |
| <span class="kw">fn </span>consume_nonnegative(test_case: <span class="kw-2">&mut </span>test::TestCase, name: <span class="kw-2">&</span>str) -> Nonnegative { |
| <span class="kw">let </span>bytes = test_case.consume_bytes(name); |
| <span class="kw">let </span>(r, _r_bits) = |
| Nonnegative::from_be_bytes_with_bit_length(untrusted::Input::from(<span class="kw-2">&</span>bytes)).unwrap(); |
| r |
| } |
| |
| <span class="kw">fn </span>assert_elem_eq<M, E>(a: <span class="kw-2">&</span>Elem<M, E>, b: <span class="kw-2">&</span>Elem<M, E>) { |
| <span class="kw">if </span>elem_verify_equal_consttime(<span class="kw-2">&</span>a, b).is_err() { |
| <span class="macro">panic!</span>(<span class="string">"{:x?} != {:x?}"</span>, <span class="kw-2">&*</span>a.limbs, <span class="kw-2">&*</span>b.limbs); |
| } |
| } |
| |
| <span class="kw">fn </span>into_encoded<M>(a: Elem<M, Unencoded>, m: <span class="kw-2">&</span>Modulus<M>) -> Elem<M, R> { |
| elem_mul(m.oneRR().as_ref(), a, m) |
| } |
| |
| <span class="attribute">#[test] |
| </span><span class="comment">// TODO: wasm |
| </span><span class="kw">fn </span>test_mul_add_words() { |
| <span class="kw">const </span>ZERO: Limb = <span class="number">0</span>; |
| <span class="kw">const </span>MAX: Limb = ZERO.wrapping_sub(<span class="number">1</span>); |
| <span class="kw">static </span>TEST_CASES: <span class="kw-2">&</span>[(<span class="kw-2">&</span>[Limb], <span class="kw-2">&</span>[Limb], Limb, Limb, <span class="kw-2">&</span>[Limb])] = <span class="kw-2">&</span>[ |
| (<span class="kw-2">&</span>[<span class="number">0</span>], <span class="kw-2">&</span>[<span class="number">0</span>], <span class="number">0</span>, <span class="number">0</span>, <span class="kw-2">&</span>[<span class="number">0</span>]), |
| (<span class="kw-2">&</span>[MAX], <span class="kw-2">&</span>[<span class="number">0</span>], MAX, <span class="number">0</span>, <span class="kw-2">&</span>[MAX]), |
| (<span class="kw-2">&</span>[<span class="number">0</span>], <span class="kw-2">&</span>[MAX], MAX, MAX - <span class="number">1</span>, <span class="kw-2">&</span>[<span class="number">1</span>]), |
| (<span class="kw-2">&</span>[MAX], <span class="kw-2">&</span>[MAX], MAX, MAX, <span class="kw-2">&</span>[<span class="number">0</span>]), |
| (<span class="kw-2">&</span>[<span class="number">0</span>, <span class="number">0</span>], <span class="kw-2">&</span>[MAX, MAX], MAX, MAX - <span class="number">1</span>, <span class="kw-2">&</span>[<span class="number">1</span>, MAX]), |
| (<span class="kw-2">&</span>[<span class="number">1</span>, <span class="number">0</span>], <span class="kw-2">&</span>[MAX, MAX], MAX, MAX - <span class="number">1</span>, <span class="kw-2">&</span>[<span class="number">2</span>, MAX]), |
| (<span class="kw-2">&</span>[MAX, <span class="number">0</span>], <span class="kw-2">&</span>[MAX, MAX], MAX, MAX, <span class="kw-2">&</span>[<span class="number">0</span>, <span class="number">0</span>]), |
| (<span class="kw-2">&</span>[<span class="number">0</span>, <span class="number">1</span>], <span class="kw-2">&</span>[MAX, MAX], MAX, MAX, <span class="kw-2">&</span>[<span class="number">1</span>, <span class="number">0</span>]), |
| (<span class="kw-2">&</span>[MAX, MAX], <span class="kw-2">&</span>[MAX, MAX], MAX, MAX, <span class="kw-2">&</span>[<span class="number">0</span>, MAX]), |
| ]; |
| |
| <span class="kw">for </span>(i, (r_input, a, w, expected_retval, expected_r)) <span class="kw">in </span>TEST_CASES.iter().enumerate() { |
| <span class="kw">extern crate </span>std; |
| <span class="kw">let </span><span class="kw-2">mut </span>r = std::vec::Vec::from(<span class="kw-2">*</span>r_input); |
| <span class="macro">assert_eq!</span>(r.len(), a.len()); <span class="comment">// Sanity check |
| </span><span class="kw">let </span>actual_retval = |
| <span class="kw">unsafe </span>{ GFp_limbs_mul_add_limb(r.as_mut_ptr(), a.as_ptr(), <span class="kw-2">*</span>w, a.len()) }; |
| <span class="macro">assert_eq!</span>(<span class="kw-2">&</span>r, expected_r, <span class="string">"{}: {:x?} != {:x?}"</span>, i, <span class="kw-2">&</span>r[..], expected_r); |
| <span class="macro">assert_eq!</span>( |
| actual_retval, <span class="kw-2">*</span>expected_retval, |
| <span class="string">"{}: {:x?} != {:x?}"</span>, |
| i, actual_retval, <span class="kw-2">*</span>expected_retval |
| ); |
| } |
| } |
| } |
| </code></pre></div> |
| </section></div></main><div id="rustdoc-vars" data-root-path="../../../" data-current-crate="ring" data-themes="ayu,dark,light" data-resource-suffix="" data-rustdoc-version="1.66.0-nightly (5c8bff74b 2022-10-21)" ></div></body></html> |
