1 .\" $NetBSD: qsieve.1,v 1.1 2006/01/24 18:59:23 elad Exp $
3 .\" Copyright 1997, 2003 William Allen Simpson <wsimpson@greendragon.com>
4 .\" All rights reserved.
6 .\" Redistribution and use in source and binary forms, with or without
7 .\" modification, are permitted provided that the following conditions
9 .\" 1. Redistributions of source code must retain the above copyright
10 .\" notice, this list of conditions and the following disclaimer.
11 .\" 2. Redistributions in binary form must reproduce the above copyright
12 .\" notice, this list of conditions and the following disclaimer in the
13 .\" documentation and/or other materials provided with the distribution.
14 .\" 3. All advertising materials mentioning features or use of this software
15 .\" must display the following acknowledgement:
16 .\" This product includes software designed by William Allen Simpson.
17 .\" 4. The name of the author may not be used to endorse or promote products
18 .\" derived from this software without specific prior written permission.
20 .\" THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
21 .\" IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
22 .\" OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
23 .\" IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
24 .\" INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
25 .\" NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
26 .\" DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
27 .\" THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
28 .\" (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
29 .\" THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 .\" Manual page, using -mandoc macros
39 .Nd generate system moduli file
42 .Op Ar megabytes Ar bits Op Ar initial
44 .Op Ar trials Op Ar generator
48 utility will list candidates for Sophie-Germaine primes
51 The list is checked against small known primes
53 This step is both processor and memory intensive.
58 sets a limit for the internal sieve buffer.
59 This should be small enough to remain entirely in memory.
60 Swap thrashing can increase the run time
61 from hours to days or weeks!
66 will select a default suitable for the
72 sets the length of the generated possible primes
73 (typically 768, 1024, 1536, 2048, 3072, or 4096,
74 although others can be used for variety).
79 specifies the beginning of the search.
82 generates a randomly selected number.
86 utility will perform a Miller-Rabin primality test
87 on the list of candidates
88 (checking both q and p)
90 The result is a list of so-call "safe" primes
92 suitable for use as Diffie-Hellman moduli.
93 This step is merely processor intensive.
98 sets the number of Miller-Rabin interations
99 (typically 16 to 128).
104 limits testing to candidates with a specific generator
108 will test each candidate
109 and suggest a generator.
113 These programs were originally developed for
114 the Photuris project,