pqc/ntru__ascii__poly_8c_source.html
travis-ci ca575303bf Lastest doxygen docs updated
travis build: 25
	commit: 05b02f5624f2054cdf2e802f63c834162c2fe05b
	auto-pushed to gh-pages
2014-06-08 21:44:14 +00:00

300 lines
22 KiB
HTML

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<title>post quantum cryptography: /home/travis/build/hasufell/pqc/src/ntru_ascii_poly.c Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
$(document).ready(function() { searchBox.OnSelectItem(0); });
</script>
</head>
<body>
<div id="top"><!-- do not remove this div! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">post quantum cryptography
</div>
<div id="projectbrief">Highly optimized implementation of the NTRUEncrypt algorithm</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- Generated by Doxygen 1.7.6.1 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main&#160;Page</span></a></li>
<li><a href="annotated.html"><span>Data&#160;Structures</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
<li>
<div id="MSearchBox" class="MSearchBoxInactive">
<span class="left">
<img id="MSearchSelect" src="search/mag_sel.png"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
alt=""/>
<input type="text" id="MSearchField" value="Search" accesskey="S"
onfocus="searchBox.OnSearchFieldFocus(true)"
onblur="searchBox.OnSearchFieldFocus(false)"
onkeyup="searchBox.OnSearchFieldChange(event)"/>
</span><span class="right">
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
</span>
</div>
</li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File&#160;List</span></a></li>
<li><a href="globals.html"><span>Globals</span></a></li>
</ul>
</div>
</div>
<div class="header">
<div class="headertitle">
<div class="title">/home/travis/build/hasufell/pqc/src/ntru_ascii_poly.c</div> </div>
</div><!--header-->
<div class="contents">
<a href="ntru__ascii__poly_8c.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
<a name="l00002"></a>00002 <span class="comment"> * Copyright (C) 2014 FH Bielefeld</span>
<a name="l00003"></a>00003 <span class="comment"> *</span>
<a name="l00004"></a>00004 <span class="comment"> * This file is part of a FH Bielefeld project.</span>
<a name="l00005"></a>00005 <span class="comment"> *</span>
<a name="l00006"></a>00006 <span class="comment"> * This library is free software; you can redistribute it and/or</span>
<a name="l00007"></a>00007 <span class="comment"> * modify it under the terms of the GNU Lesser General Public</span>
<a name="l00008"></a>00008 <span class="comment"> * License as published by the Free Software Foundation; either</span>
<a name="l00009"></a>00009 <span class="comment"> * version 2.1 of the License, or (at your option) any later version.</span>
<a name="l00010"></a>00010 <span class="comment"> *</span>
<a name="l00011"></a>00011 <span class="comment"> * This library is distributed in the hope that it will be useful,</span>
<a name="l00012"></a>00012 <span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00013"></a>00013 <span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU</span>
<a name="l00014"></a>00014 <span class="comment"> * Lesser General Public License for more details.</span>
<a name="l00015"></a>00015 <span class="comment"> *</span>
<a name="l00016"></a>00016 <span class="comment"> * You should have received a copy of the GNU Lesser General Public</span>
<a name="l00017"></a>00017 <span class="comment"> * License along with this library; if not, write to the Free Software</span>
<a name="l00018"></a>00018 <span class="comment"> * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,</span>
<a name="l00019"></a>00019 <span class="comment"> * MA 02110-1301 USA</span>
<a name="l00020"></a>00020 <span class="comment"> */</span>
<a name="l00021"></a>00021
<a name="l00029"></a>00029 <span class="preprocessor">#include &quot;<a class="code" href="ntru__ascii__poly_8h.html" title="header for ntru_ascii_poly.c">ntru_ascii_poly.h</a>&quot;</span>
<a name="l00030"></a>00030 <span class="preprocessor">#include &quot;<a class="code" href="ntru__common_8h.html" title="common macros/functions">ntru_common.h</a>&quot;</span>
<a name="l00031"></a>00031 <span class="preprocessor">#include &quot;<a class="code" href="ntru__mem_8h.html" title="header for ntru_mem.c">ntru_mem.h</a>&quot;</span>
<a name="l00032"></a>00032 <span class="preprocessor">#include &quot;<a class="code" href="ntru__params_8h.html" title="NTRU parameters.">ntru_params.h</a>&quot;</span>
<a name="l00033"></a>00033 <span class="preprocessor">#include &quot;<a class="code" href="ntru__poly_8h.html" title="header for ntru_poly.c">ntru_poly.h</a>&quot;</span>
<a name="l00034"></a>00034 <span class="preprocessor">#include &quot;<a class="code" href="ntru__string_8h.html" title="header for ntru_string.c">ntru_string.h</a>&quot;</span>
<a name="l00035"></a>00035
<a name="l00036"></a>00036 <span class="preprocessor">#include &lt;glib.h&gt;</span>
<a name="l00037"></a>00037
<a name="l00038"></a>00038 <span class="preprocessor">#include &lt;stdint.h&gt;</span>
<a name="l00039"></a>00039 <span class="preprocessor">#include &lt;stdlib.h&gt;</span>
<a name="l00040"></a>00040 <span class="preprocessor">#include &lt;string.h&gt;</span>
<a name="l00041"></a>00041
<a name="l00042"></a>00042 <span class="preprocessor">#include &lt;fmpz_poly.h&gt;</span>
<a name="l00043"></a>00043 <span class="preprocessor">#include &lt;fmpz.h&gt;</span>
<a name="l00044"></a>00044
<a name="l00045"></a>00045
<a name="l00055"></a>00055 <span class="keyword">static</span> <span class="keywordtype">char</span> *
<a name="l00056"></a>00056 <a class="code" href="ntru__ascii__poly_8c.html#a2d2f760b6a98bd87248c1d3e120a665b">get_int_to_bin_str</a>(uint8_t value);
<a name="l00057"></a>00057
<a name="l00058"></a>00058
<a name="l00059"></a>00059 <span class="comment">/*------------------------------------------------------------------------*/</span>
<a name="l00060"></a>00060
<a name="l00061"></a>00061 <span class="keyword">static</span> <span class="keywordtype">char</span> *
<a name="l00062"></a><a class="code" href="ntru__ascii__poly_8c.html#a2d2f760b6a98bd87248c1d3e120a665b">00062</a> <a class="code" href="ntru__ascii__poly_8c.html#a2d2f760b6a98bd87248c1d3e120a665b">get_int_to_bin_str</a>(uint8_t value)
<a name="l00063"></a>00063 {
<a name="l00064"></a>00064 <span class="keywordtype">int</span> i;
<a name="l00065"></a>00065 <span class="keyword">const</span> <span class="keywordtype">size_t</span> bin_string_size = <a class="code" href="ntru__common_8h.html#a8d370c21bcf662e586397e764aba95e1">ASCII_BITS</a> + 1;
<a name="l00066"></a>00066 <span class="keywordtype">char</span> *bin_string = <a class="code" href="ntru__mem_8c.html#a020790bf8b201fde92395cf975c0c691">ntru_malloc</a>(<span class="keyword">sizeof</span>(*bin_string) *
<a name="l00067"></a>00067 (bin_string_size)); <span class="comment">/* account for trailing null-byte */</span>
<a name="l00068"></a>00068
<a name="l00069"></a>00069 <span class="comment">/* terminate properly */</span>
<a name="l00070"></a>00070 bin_string[bin_string_size - 1] = <span class="charliteral">&#39;\0&#39;</span>;
<a name="l00071"></a>00071
<a name="l00072"></a>00072 <span class="keywordflow">for</span> (i = <a class="code" href="ntru__common_8h.html#a8d370c21bcf662e586397e764aba95e1">ASCII_BITS</a> - 1; i &gt;= 0; --i, value &gt;&gt;= 1)
<a name="l00073"></a>00073 bin_string[i] = (value &amp; 1) + <span class="charliteral">&#39;0&#39;</span>;
<a name="l00074"></a>00074
<a name="l00075"></a>00075 <span class="keywordflow">return</span> bin_string;
<a name="l00076"></a>00076 }
<a name="l00077"></a>00077
<a name="l00078"></a>00078 <span class="comment">/*------------------------------------------------------------------------*/</span>
<a name="l00079"></a>00079
<a name="l00080"></a>00080 fmpz_poly_t *
<a name="l00081"></a><a class="code" href="ntru__ascii__poly_8h.html#aa5d0d4abdb2ce837a0a3b6e478c8f1a9">00081</a> <a class="code" href="ntru__ascii__poly_8c.html#aa5d0d4abdb2ce837a0a3b6e478c8f1a9">ascii_bin_to_bin_poly</a>(<span class="keyword">const</span> <span class="keywordtype">char</span> *to_poly, <span class="keyword">const</span> <a class="code" href="structntru__params.html">ntru_params</a> *params)
<a name="l00082"></a>00082 {
<a name="l00083"></a>00083 uint32_t i = 0;
<a name="l00084"></a>00084 fmpz_poly_t *new_poly = <a class="code" href="ntru__mem_8c.html#a020790bf8b201fde92395cf975c0c691">ntru_malloc</a>(<span class="keyword">sizeof</span>(*new_poly));
<a name="l00085"></a>00085
<a name="l00086"></a>00086 fmpz_poly_init(*new_poly);
<a name="l00087"></a>00087
<a name="l00088"></a>00088 <span class="keywordflow">while</span> (to_poly[i] &amp;&amp; i &lt; params-&gt;N) {
<a name="l00089"></a>00089 fmpz_poly_set_coeff_si(*new_poly,
<a name="l00090"></a>00090 i,
<a name="l00091"></a>00091 (to_poly[i] == <span class="charliteral">&#39;0&#39;</span>) ? -1 : 1);
<a name="l00092"></a>00092 i++;
<a name="l00093"></a>00093 }
<a name="l00094"></a>00094
<a name="l00095"></a>00095 <span class="keywordflow">return</span> new_poly;
<a name="l00096"></a>00096 }
<a name="l00097"></a>00097
<a name="l00098"></a>00098 <span class="comment">/*------------------------------------------------------------------------*/</span>
<a name="l00099"></a>00099
<a name="l00100"></a>00100 fmpz_poly_t **
<a name="l00101"></a><a class="code" href="ntru__ascii__poly_8h.html#a3237071bca2489c3b2efd46e674e0805">00101</a> <a class="code" href="ntru__ascii__poly_8c.html#a3237071bca2489c3b2efd46e674e0805">ascii_to_bin_poly_arr</a>(<span class="keyword">const</span> <span class="keywordtype">string</span> *to_poly, <span class="keyword">const</span> <a class="code" href="structntru__params.html">ntru_params</a> *params)
<a name="l00102"></a>00102 {
<a name="l00103"></a>00103 <span class="keywordtype">char</span> *cur = to_poly-&gt;<a class="code" href="structstring.html#afd608f62303958cea6f1f7afdec1e282">ptr</a>;
<a name="l00104"></a>00104 <span class="keywordtype">char</span> *out = <a class="code" href="ntru__mem_8c.html#a020790bf8b201fde92395cf975c0c691">ntru_malloc</a>(<a class="code" href="ntru__common_8h.html#a22c7f61c2f0fa6b1943548e838055cec">CHAR_SIZE</a> * (to_poly-&gt;<a class="code" href="structstring.html#aa6bcf0353fd5cf2f374a9b1dd0e4a73a">len</a> * <a class="code" href="ntru__common_8h.html#a8d370c21bcf662e586397e764aba95e1">ASCII_BITS</a> + 1));
<a name="l00105"></a>00105 uint32_t polyc = 0;
<a name="l00106"></a>00106 <span class="keywordtype">size_t</span> out_len = 0;
<a name="l00107"></a>00107 fmpz_poly_t **poly_array;
<a name="l00108"></a>00108
<a name="l00109"></a>00109 <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; to_poly-&gt;<a class="code" href="structstring.html#aa6bcf0353fd5cf2f374a9b1dd0e4a73a">len</a>; i++) {
<a name="l00110"></a>00110 <span class="keywordtype">char</span> *tmp_string = <a class="code" href="ntru__ascii__poly_8c.html#a2d2f760b6a98bd87248c1d3e120a665b">get_int_to_bin_str</a>((<span class="keywordtype">int</span>)(*cur));
<a name="l00111"></a>00111 memcpy(out + out_len, tmp_string, <a class="code" href="ntru__common_8h.html#a8d370c21bcf662e586397e764aba95e1">ASCII_BITS</a>);
<a name="l00112"></a>00112 out_len += <a class="code" href="ntru__common_8h.html#a8d370c21bcf662e586397e764aba95e1">ASCII_BITS</a>;
<a name="l00113"></a>00113 cur++;
<a name="l00114"></a>00114 free(tmp_string);
<a name="l00115"></a>00115 }
<a name="l00116"></a>00116 out[out_len] = <span class="charliteral">&#39;\0&#39;</span>;
<a name="l00117"></a>00117
<a name="l00118"></a>00118 poly_array = <a class="code" href="ntru__mem_8c.html#a020790bf8b201fde92395cf975c0c691">ntru_malloc</a>(<span class="keyword">sizeof</span>(**poly_array) *
<a name="l00119"></a>00119 (strlen(out) / params-&gt;<a class="code" href="structntru__params.html#afb8425ee3db2b917b3c4e8d9b75bd3ff">N</a> + 1));
<a name="l00120"></a>00120
<a name="l00121"></a>00121 <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; out_len; i += params-&gt;<a class="code" href="structntru__params.html#afb8425ee3db2b917b3c4e8d9b75bd3ff">N</a>) {
<a name="l00122"></a>00122 <span class="keywordtype">char</span> chunk[params-&gt;<a class="code" href="structntru__params.html#afb8425ee3db2b917b3c4e8d9b75bd3ff">N</a> + 1];
<a name="l00123"></a>00123 <span class="keywordtype">size_t</span> real_chunk_size;
<a name="l00124"></a>00124
<a name="l00125"></a>00125 real_chunk_size =
<a name="l00126"></a>00126 (out_len - i &gt; params-&gt;<a class="code" href="structntru__params.html#afb8425ee3db2b917b3c4e8d9b75bd3ff">N</a>) ? params-&gt;<a class="code" href="structntru__params.html#afb8425ee3db2b917b3c4e8d9b75bd3ff">N</a> : out_len - i;
<a name="l00127"></a>00127
<a name="l00128"></a>00128 memcpy(chunk, out + i, real_chunk_size);
<a name="l00129"></a>00129 chunk[real_chunk_size] = <span class="charliteral">&#39;\0&#39;</span>;
<a name="l00130"></a>00130
<a name="l00131"></a>00131 poly_array[polyc] = <a class="code" href="ntru__ascii__poly_8c.html#aa5d0d4abdb2ce837a0a3b6e478c8f1a9">ascii_bin_to_bin_poly</a>(chunk, params);
<a name="l00132"></a>00132
<a name="l00133"></a>00133 polyc++;
<a name="l00134"></a>00134 }
<a name="l00135"></a>00135
<a name="l00136"></a>00136 free(out);
<a name="l00137"></a>00137
<a name="l00138"></a>00138 poly_array[polyc] = NULL;
<a name="l00139"></a>00139
<a name="l00140"></a>00140 <span class="keywordflow">return</span> poly_array;
<a name="l00141"></a>00141 }
<a name="l00142"></a>00142
<a name="l00143"></a>00143 <span class="comment">/*------------------------------------------------------------------------*/</span>
<a name="l00144"></a>00144
<a name="l00145"></a>00145 fmpz_poly_t **
<a name="l00146"></a><a class="code" href="ntru__ascii__poly_8h.html#a8460cd27ad4562f560bb304609a3e06d">00146</a> <a class="code" href="ntru__ascii__poly_8c.html#a8460cd27ad4562f560bb304609a3e06d">base64_to_poly_arr</a>(<span class="keyword">const</span> <span class="keywordtype">string</span> *to_poly, <span class="keyword">const</span> <a class="code" href="structntru__params.html">ntru_params</a> *params)
<a name="l00147"></a>00147 {
<a name="l00148"></a>00148 uint32_t i = 0,
<a name="l00149"></a>00149 polyc = 0;
<a name="l00150"></a>00150 gsize out_len;
<a name="l00151"></a>00151 guchar *base64_decoded = NULL,
<a name="l00152"></a>00152 *base_tmp = NULL;
<a name="l00153"></a>00153 <span class="keywordtype">string</span> *new_string = <a class="code" href="ntru__mem_8c.html#a020790bf8b201fde92395cf975c0c691">ntru_malloc</a>(<span class="keyword">sizeof</span>(*new_string));
<a name="l00154"></a>00154 fmpz_poly_t **poly_array;
<a name="l00155"></a>00155 <span class="keywordtype">char</span> *tmp = <a class="code" href="ntru__mem_8c.html#a020790bf8b201fde92395cf975c0c691">ntru_malloc</a>(<span class="keyword">sizeof</span>(<span class="keywordtype">char</span>) * (to_poly-&gt;<a class="code" href="structstring.html#aa6bcf0353fd5cf2f374a9b1dd0e4a73a">len</a> + 1));
<a name="l00156"></a>00156
<a name="l00157"></a>00157 <span class="comment">/* g_base64_decode() needs it null-terminated */</span>
<a name="l00158"></a>00158 memcpy(tmp, to_poly-&gt;<a class="code" href="structstring.html#afd608f62303958cea6f1f7afdec1e282">ptr</a>, to_poly-&gt;<a class="code" href="structstring.html#aa6bcf0353fd5cf2f374a9b1dd0e4a73a">len</a>);
<a name="l00159"></a>00159 tmp[to_poly-&gt;<a class="code" href="structstring.html#aa6bcf0353fd5cf2f374a9b1dd0e4a73a">len</a>] = <span class="charliteral">&#39;\0&#39;</span>;
<a name="l00160"></a>00160
<a name="l00161"></a>00161 base_tmp = g_base64_decode((<span class="keyword">const</span> gchar *)tmp, &amp;out_len);
<a name="l00162"></a>00162
<a name="l00163"></a>00163 <span class="comment">/* g_base64_decode() needs it null-terminated */</span>
<a name="l00164"></a>00164 <a class="code" href="ntru__mem_8h.html#a718b6446905826d711cb7ef00808bb4e">REALLOC</a>(tmp, <span class="keyword">sizeof</span>(<span class="keywordtype">char</span>) * (out_len + 1));
<a name="l00165"></a>00165 memcpy(tmp, base_tmp, out_len);
<a name="l00166"></a>00166 tmp[out_len] = <span class="charliteral">&#39;\0&#39;</span>;
<a name="l00167"></a>00167
<a name="l00168"></a>00168 base64_decoded = g_base64_decode((<span class="keyword">const</span> gchar *)tmp, &amp;out_len);
<a name="l00169"></a>00169
<a name="l00170"></a>00170 new_string-&gt;<a class="code" href="structstring.html#afd608f62303958cea6f1f7afdec1e282">ptr</a> = (<span class="keywordtype">char</span> *)base64_decoded;
<a name="l00171"></a>00171 new_string-&gt;<a class="code" href="structstring.html#aa6bcf0353fd5cf2f374a9b1dd0e4a73a">len</a> = (<span class="keywordtype">unsigned</span> long)(out_len);
<a name="l00172"></a>00172
<a name="l00173"></a>00173 poly_array = <a class="code" href="ntru__mem_8c.html#a020790bf8b201fde92395cf975c0c691">ntru_malloc</a>(<span class="keyword">sizeof</span>(**poly_array) *
<a name="l00174"></a>00174 (new_string-&gt;<a class="code" href="structstring.html#aa6bcf0353fd5cf2f374a9b1dd0e4a73a">len</a> / params-&gt;<a class="code" href="structntru__params.html#afb8425ee3db2b917b3c4e8d9b75bd3ff">N</a>));
<a name="l00175"></a>00175
<a name="l00176"></a>00176 <span class="keywordflow">while</span> (i &lt; new_string-&gt;len) {
<a name="l00177"></a>00177 uint32_t j = 0;
<a name="l00178"></a>00178 fmpz_poly_t *new_poly = <a class="code" href="ntru__mem_8c.html#a020790bf8b201fde92395cf975c0c691">ntru_malloc</a>(<span class="keyword">sizeof</span>(*new_poly));
<a name="l00179"></a>00179
<a name="l00180"></a>00180 fmpz_poly_init(*new_poly);
<a name="l00181"></a>00181
<a name="l00182"></a>00182 <span class="keywordflow">while</span> (j &lt; params-&gt;N) {
<a name="l00183"></a>00183 fmpz_poly_set_coeff_si(*new_poly,
<a name="l00184"></a>00184 j,
<a name="l00185"></a>00185 (uint8_t)(base64_decoded[i]));
<a name="l00186"></a>00186 j++;
<a name="l00187"></a>00187 i++;
<a name="l00188"></a>00188 }
<a name="l00189"></a>00189
<a name="l00190"></a>00190 <span class="comment">/* fill the last poly with q (which is a non-standard</span>
<a name="l00191"></a>00191 <span class="comment"> * coefficient) */</span>
<a name="l00192"></a>00192 <span class="keywordflow">for</span> (uint32_t k = j; k &lt; params-&gt;<a class="code" href="structntru__params.html#afb8425ee3db2b917b3c4e8d9b75bd3ff">N</a>; k++) {
<a name="l00193"></a>00193 fmpz_poly_set_coeff_si(*new_poly,
<a name="l00194"></a>00194 k,
<a name="l00195"></a>00195 params-&gt;<a class="code" href="structntru__params.html#a29680750bda49dc93e61a752b2f2a0f7">q</a>);
<a name="l00196"></a>00196 }
<a name="l00197"></a>00197
<a name="l00198"></a>00198 poly_array[polyc] = new_poly;
<a name="l00199"></a>00199 polyc++;
<a name="l00200"></a>00200 }
<a name="l00201"></a>00201
<a name="l00202"></a>00202 poly_array[polyc] = NULL;
<a name="l00203"></a>00203
<a name="l00204"></a>00204 <a class="code" href="ntru__string_8c.html#ac1b5f66fbbbdfc7901357ddcfec52e5a">string_delete</a>(new_string);
<a name="l00205"></a>00205 free(base_tmp);
<a name="l00206"></a>00206 free(tmp);
<a name="l00207"></a>00207
<a name="l00208"></a>00208 <span class="keywordflow">return</span> poly_array;
<a name="l00209"></a>00209 }
</pre></div></div><!-- contents -->
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Data Structures</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>Defines</a></div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<hr class="footer"/><address class="footer"><small>
Generated on Sun Jun 8 2014 21:44:12 for post quantum cryptography by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.7.6.1
</small></address>
</body>
</html>