⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 xtr_8h-source.html

📁 著名的密码库Crypto++的文档 C++语言的杰作。程序员必备。
💻 HTML
📖 第 1 页 / 共 4 页
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8"><title>Crypto++: xtr.h Source File</title><link href="doxygen.css" rel="stylesheet" type="text/css"><link href="tabs.css" rel="stylesheet" type="text/css"></head><body><!-- Generated by Doxygen 1.5.2 --><div class="tabs">  <ul>    <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>    <li><a href="namespaces.html"><span>Namespaces</span></a></li>    <li><a href="classes.html"><span>Classes</span></a></li>    <li class="current"><a href="files.html"><span>Files</span></a></li>  </ul></div><div class="tabs">  <ul>    <li><a href="files.html"><span>File&nbsp;List</span></a></li>    <li><a href="globals.html"><span>File&nbsp;Members</span></a></li>  </ul></div><h1>xtr.h</h1><a href="xtr_8h.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="preprocessor">#ifndef CRYPTOPP_XTR_H</span><a name="l00002"></a>00002 <span class="preprocessor"></span><span class="preprocessor">#define CRYPTOPP_XTR_H</span><a name="l00003"></a>00003 <span class="preprocessor"></span><span class="comment"></span><a name="l00004"></a>00004 <span class="comment">/** \file</span><a name="l00005"></a>00005 <span class="comment">        "The XTR public key system" by Arjen K. Lenstra and Eric R. Verheul</span><a name="l00006"></a>00006 <span class="comment">*/</span><a name="l00007"></a>00007 <a name="l00008"></a>00008 <span class="preprocessor">#include "modarith.h"</span><a name="l00009"></a>00009 <a name="l00010"></a>00010 NAMESPACE_BEGIN(CryptoPP)<a name="l00011"></a>00011 <a name="l00012"></a>00012 <span class="comment">//! an element of GF(p^2)</span><a name="l00013"></a><a class="code" href="class_g_f_p2_element.html">00013</a> <span class="comment"></span>class <a class="code" href="class_g_f_p2_element.html" title="an element of GF(p^2)">GFP2Element</a><a name="l00014"></a>00014 {<a name="l00015"></a>00015 <span class="keyword">public</span>:<a name="l00016"></a><a class="code" href="class_g_f_p2_element.html#39088f098ab4a4414db2d91e2076a0b1">00016</a>         GFP2Element() {}<a name="l00017"></a><a class="code" href="class_g_f_p2_element.html#84a4bc1c9a98320fb2ba422e726220be">00017</a>         GFP2Element(<span class="keyword">const</span> <a class="code" href="class_integer.html" title="multiple precision integer and basic arithmetics">Integer</a> &amp;c1, <span class="keyword">const</span> <a class="code" href="class_integer.html" title="multiple precision integer and basic arithmetics">Integer</a> &amp;c2) : c1(c1), c2(c2) {}<a name="l00018"></a><a class="code" href="class_g_f_p2_element.html#198afbefc4f5f22eb2c3a1c67dd103b3">00018</a>         GFP2Element(<span class="keyword">const</span> byte *encodedElement, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> size)<a name="l00019"></a>00019                 : c1(encodedElement, size/2), c2(encodedElement+size/2, size/2) {}<a name="l00020"></a>00020 <a name="l00021"></a><a class="code" href="class_g_f_p2_element.html#b5c1499bcfd8c52cbc145384aded0363">00021</a>         <span class="keywordtype">void</span> Encode(byte *encodedElement, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> size)<a name="l00022"></a>00022         {<a name="l00023"></a>00023                 c1.Encode(encodedElement, size/2);<a name="l00024"></a>00024                 c2.Encode(encodedElement+size/2, size/2);<a name="l00025"></a>00025         }<a name="l00026"></a>00026 <a name="l00027"></a><a class="code" href="class_g_f_p2_element.html#135a9031fc9da0c7f3c12fb02d9b65f8">00027</a>         <span class="keywordtype">bool</span> <a class="code" href="gf2n_8h.html#22c25c181c409600aa2e4bf1067ac47a">operator==</a>(<span class="keyword">const</span> GFP2Element &amp;rhs)<span class="keyword"> const </span>{<span class="keywordflow">return</span> c1 == rhs.<a class="code" href="class_g_f_p2_element.html#65778354421ad2da42fce4221e6da05c">c1</a> &amp;&amp; c2 == rhs.<a class="code" href="class_g_f_p2_element.html#1688b28610e1b080a9304daad7c73bbb">c2</a>;}<a name="l00028"></a><a class="code" href="class_g_f_p2_element.html#9c817544061af4fcbe5d96974f6d15db">00028</a>         <span class="keywordtype">bool</span> <a class="code" href="gf2n_8h.html#98d9036c415975aa2f0fc09fab285459">operator!=</a>(<span class="keyword">const</span> GFP2Element &amp;rhs)<span class="keyword"> const </span>{<span class="keywordflow">return</span> !<a class="code" href="gf2n_8h.html#22c25c181c409600aa2e4bf1067ac47a">operator==</a>(rhs);}<a name="l00029"></a>00029 <a name="l00030"></a><a class="code" href="class_g_f_p2_element.html#aea0eacbd2dd61465f95c09690a3f89e">00030</a>         <span class="keywordtype">void</span> <a class="code" href="gf2n_8h.html#cd9c045f0b5c2a7595a8a0872dc80f59">swap</a>(GFP2Element &amp;a)<a name="l00031"></a>00031         {<a name="l00032"></a>00032                 c1.swap(a.<a class="code" href="class_g_f_p2_element.html#65778354421ad2da42fce4221e6da05c">c1</a>);<a name="l00033"></a>00033                 c2.swap(a.<a class="code" href="class_g_f_p2_element.html#1688b28610e1b080a9304daad7c73bbb">c2</a>);<a name="l00034"></a>00034         }<a name="l00035"></a>00035 <a name="l00036"></a>00036         <span class="keyword">static</span> <span class="keyword">const</span> GFP2Element &amp; Zero();<a name="l00037"></a>00037 <a name="l00038"></a><a class="code" href="class_g_f_p2_element.html#1688b28610e1b080a9304daad7c73bbb">00038</a>         <a class="code" href="class_integer.html" title="multiple precision integer and basic arithmetics">Integer</a> c1, c2;<a name="l00039"></a>00039 };<a name="l00040"></a>00040 <span class="comment"></span>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -