/usr/share/doc/libgcrypt11-doc/html/Generation.html is in libgcrypt11-doc 1.5.0-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 | <html lang="en">
<head>
<title>Generation - The Libgcrypt Reference Manual</title>
<meta http-equiv="Content-Type" content="text/html">
<meta name="description" content="The Libgcrypt Reference Manual">
<meta name="generator" content="makeinfo 4.13">
<link title="Top" rel="start" href="index.html#Top">
<link rel="up" href="Prime-numbers.html#Prime-numbers" title="Prime numbers">
<link rel="next" href="Checking.html#Checking" title="Checking">
<link href="http://www.gnu.org/software/texinfo/" rel="generator-home" title="Texinfo Homepage">
<!--
This manual is for Libgcrypt
(version 1.5.0, 29 June 2011),
which is GNU's library of cryptographic building blocks.
Copyright (C) 2000, 2002, 2003, 2004, 2006, 2007, 2008, 2009, 2011 Free Software Foundation, Inc.
Permission is granted to copy, distribute and/or modify this
document under the terms of the GNU General Public License as
published by the Free Software Foundation; either version 2 of the
License, or (at your option) any later version. The text of the
license can be found in the section entitled ``GNU General Public
License''.
-->
<meta http-equiv="Content-Style-Type" content="text/css">
<style type="text/css"><!--
pre.display { font-family:inherit }
pre.format { font-family:inherit }
pre.smalldisplay { font-family:inherit; font-size:smaller }
pre.smallformat { font-family:inherit; font-size:smaller }
pre.smallexample { font-size:smaller }
pre.smalllisp { font-size:smaller }
span.sc { font-variant:small-caps }
span.roman { font-family:serif; font-weight:normal; }
span.sansserif { font-family:sans-serif; font-weight:normal; }
--></style>
</head>
<body>
<div class="node">
<a name="Generation"></a>
<p>
Next: <a rel="next" accesskey="n" href="Checking.html#Checking">Checking</a>,
Up: <a rel="up" accesskey="u" href="Prime-numbers.html#Prime-numbers">Prime numbers</a>
<hr>
</div>
<h3 class="section">12.1 Generation</h3>
<div class="defun">
— Function: gcry_error_t <b>gcry_prime_generate</b> (<var>gcry_mpi_t *prime,unsigned int prime_bits, unsigned int factor_bits, gcry_mpi_t **factors, gcry_prime_check_func_t cb_func, void *cb_arg, gcry_random_level_t random_level, unsigned int flags</var>)<var><a name="index-gcry_005fprime_005fgenerate-270"></a></var><br>
<blockquote>
<p>Generate a new prime number of <var>prime_bits</var> bits and store it in
<var>prime</var>. If <var>factor_bits</var> is non-zero, one of the prime factors
of (<var>prime</var> - 1) / 2 must be <var>factor_bits</var> bits long. If
<var>factors</var> is non-zero, allocate a new, <code>NULL</code>-terminated array
holding the prime factors and store it in <var>factors</var>. <var>flags</var>
might be used to influence the prime number generation process.
</p></blockquote></div>
<div class="defun">
— Function: gcry_error_t <b>gcry_prime_group_generator</b> (<var>gcry_mpi_t *r_g, gcry_mpi_t prime, gcry_mpi_t *factors, gcry_mpi_t start_g</var>)<var><a name="index-gcry_005fprime_005fgroup_005fgenerator-271"></a></var><br>
<blockquote>
<p>Find a generator for <var>prime</var> where the factorization of
(<var>prime</var>-1) is in the <code>NULL</code> terminated array <var>factors</var>.
Return the generator as a newly allocated MPI in <var>r_g</var>. If
<var>start_g</var> is not NULL, use this as the start for the search.
</p></blockquote></div>
<div class="defun">
— Function: void <b>gcry_prime_release_factors</b> (<var>gcry_mpi_t *factors</var>)<var><a name="index-gcry_005fprime_005frelease_005ffactors-272"></a></var><br>
<blockquote>
<p>Convenience function to release the <var>factors</var> array.
</p></blockquote></div>
</body></html>
|