.\" Automatically generated by Pod::Man 2.28 (Pod::Simple 3.28)
.\"
.\" Standard preamble:
.\" ========================================================================
.de Sp \" Vertical space (when we can't use .PP)
.if t .sp .5v
.if n .sp
..
.de Vb \" Begin verbatim text
.ft CW
.nf
.ne \\$1
..
.de Ve \" End verbatim text
.ft R
.fi
..
.\" Set up some character translations and predefined strings.  \*(-- will
.\" give an unbreakable dash, \*(PI will give pi, \*(L" will give a left
.\" double quote, and \*(R" will give a right double quote.  \*(C+ will
.\" give a nicer C++.  Capital omega is used to do unbreakable dashes and
.\" therefore won't be available.  \*(C` and \*(C' expand to `' in nroff,
.\" nothing in troff, for use with C<>.
.tr \(*W-
.ds C+ C\v'-.1v'\h'-1p'\s-2+\h'-1p'+\s0\v'.1v'\h'-1p'
.ie n \{\
.    ds -- \(*W-
.    ds PI pi
.    if (\n(.H=4u)&(1m=24u) .ds -- \(*W\h'-12u'\(*W\h'-12u'-\" diablo 10 pitch
.    if (\n(.H=4u)&(1m=20u) .ds -- \(*W\h'-12u'\(*W\h'-8u'-\"  diablo 12 pitch
.    ds L" ""
.    ds R" ""
.    ds C` ""
.    ds C' ""
'br\}
.el\{\
.    ds -- \|\(em\|
.    ds PI \(*p
.    ds L" ``
.    ds R" ''
.    ds C`
.    ds C'
'br\}
.\"
.\" Escape single quotes in literal strings from groff's Unicode transform.
.ie \n(.g .ds Aq \(aq
.el       .ds Aq '
.\"
.\" If the F register is turned on, we'll generate index entries on stderr for
.\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
.\" entries marked with X<> in POD.  Of course, you'll have to process the
.\" output yourself in some meaningful fashion.
.\"
.\" Avoid warning from groff about undefined register 'F'.
.de IX
..
.nr rF 0
.if \n(.g .if rF .nr rF 1
.if (\n(rF:(\n(.g==0)) \{
.    if \nF \{
.        de IX
.        tm Index:\\$1\t\\n%\t"\\$2"
..
.        if !\nF==2 \{
.            nr % 0
.            nr F 2
.        \}
.    \}
.\}
.rr rF
.\"
.\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
.\" Fear.  Run.  Save yourself.  No user-serviceable parts.
.    \" fudge factors for nroff and troff
.if n \{\
.    ds #H 0
.    ds #V .8m
.    ds #F .3m
.    ds #[ \f1
.    ds #] \fP
.\}
.if t \{\
.    ds #H ((1u-(\\\\n(.fu%2u))*.13m)
.    ds #V .6m
.    ds #F 0
.    ds #[ \&
.    ds #] \&
.\}
.    \" simple accents for nroff and troff
.if n \{\
.    ds ' \&
.    ds ` \&
.    ds ^ \&
.    ds , \&
.    ds ~ ~
.    ds /
.\}
.if t \{\
.    ds ' \\k:\h'-(\\n(.wu*8/10-\*(#H)'\'\h"|\\n:u"
.    ds ` \\k:\h'-(\\n(.wu*8/10-\*(#H)'\`\h'|\\n:u'
.    ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'^\h'|\\n:u'
.    ds , \\k:\h'-(\\n(.wu*8/10)',\h'|\\n:u'
.    ds ~ \\k:\h'-(\\n(.wu-\*(#H-.1m)'~\h'|\\n:u'
.    ds / \\k:\h'-(\\n(.wu*8/10-\*(#H)'\z\(sl\h'|\\n:u'
.\}
.    \" troff and (daisy-wheel) nroff accents
.ds : \\k:\h'-(\\n(.wu*8/10-\*(#H+.1m+\*(#F)'\v'-\*(#V'\z.\h'.2m+\*(#F'.\h'|\\n:u'\v'\*(#V'
.ds 8 \h'\*(#H'\(*b\h'-\*(#H'
.ds o \\k:\h'-(\\n(.wu+\w'\(de'u-\*(#H)/2u'\v'-.3n'\*(#[\z\(de\v'.3n'\h'|\\n:u'\*(#]
.ds d- \h'\*(#H'\(pd\h'-\w'~'u'\v'-.25m'\f2\(hy\fP\v'.25m'\h'-\*(#H'
.ds D- D\\k:\h'-\w'D'u'\v'-.11m'\z\(hy\v'.11m'\h'|\\n:u'
.ds th \*(#[\v'.3m'\s+1I\s-1\v'-.3m'\h'-(\w'I'u*2/3)'\s-1o\s+1\*(#]
.ds Th \*(#[\s+2I\s-2\h'-\w'I'u*3/5'\v'-.3m'o\v'.3m'\*(#]
.ds ae a\h'-(\w'a'u*4/10)'e
.ds Ae A\h'-(\w'A'u*4/10)'E
.    \" corrections for vroff
.if v .ds ~ \\k:\h'-(\\n(.wu*9/10-\*(#H)'\s-2\u~\d\s+2\h'|\\n:u'
.if v .ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'\v'-.4m'^\v'.4m'\h'|\\n:u'
.    \" for low resolution devices (crt and lpr)
.if \n(.H>23 .if \n(.V>19 \
\{\
.    ds : e
.    ds 8 ss
.    ds o a
.    ds d- d\h'-1'\(ga
.    ds D- D\h'-1'\(hy
.    ds th \o'bp'
.    ds Th \o'LP'
.    ds ae ae
.    ds Ae AE
.\}
.rm #[ #] #H #V #F C
.\" ========================================================================
.\"
.IX Title "Math::Prime::Util::RandomPrimes 3pm"
.TH Math::Prime::Util::RandomPrimes 3pm "2014-10-17" "perl v5.20.1" "User Contributed Perl Documentation"
.\" For nroff, turn off justification.  Always turn off hyphenation; it makes
.\" way too many mistakes in technical documents.
.if n .ad l
.nh
.SH "NAME"
Math::Prime::Util::RandomPrimes \- Generate random primes
.SH "VERSION"
.IX Header "VERSION"
Version 0.46
.SH "SYNOPSIS"
.IX Header "SYNOPSIS"
.SH "DESCRIPTION"
.IX Header "DESCRIPTION"
Routines to generate random primes, including constructing proven primes.
.SH "RANDOM UTILITY FUNCTIONS"
.IX Header "RANDOM UTILITY FUNCTIONS"
.SS "get_randf"
.IX Subsection "get_randf"
Gets a subroutine that will produce random integers between 0 and \f(CW\*(C`n\*(C'\fR,
inclusive.  The argument \f(CW\*(C`n\*(C'\fR can be a bigint.
.SS "get_randf_nbit"
.IX Subsection "get_randf_nbit"
Gets a subroutine that will produce random integers between 0 and \f(CW\*(C`2^n\-1\*(C'\fR,
inclusive.
.SH "RANDOM PRIME FUNCTIONS"
.IX Header "RANDOM PRIME FUNCTIONS"
.SS "random_prime"
.IX Subsection "random_prime"
Generate a random prime between \f(CW\*(C`low\*(C'\fR and \f(CW\*(C`high\*(C'\fR.  If given one argument,
\&\f(CW\*(C`low\*(C'\fR will be 2.
.SS "random_ndigit_prime"
.IX Subsection "random_ndigit_prime"
Generate a random prime with \f(CW\*(C`n\*(C'\fR digits.  \f(CW\*(C`n\*(C'\fR must be at least 1.
.SS "random_nbit_prime"
.IX Subsection "random_nbit_prime"
Generate a random prime with \f(CW\*(C`n\*(C'\fR bits.  \f(CW\*(C`n\*(C'\fR must be at least 2.
.SS "random_maurer_prime"
.IX Subsection "random_maurer_prime"
Construct a random provable prime of \f(CW\*(C`n\*(C'\fR bits using Maurer's FastPrime
algorithm.  \f(CW\*(C`n\*(C'\fR must be at least 2.
.SS "random_maurer_prime_with_cert"
.IX Subsection "random_maurer_prime_with_cert"
Construct a random provable prime of \f(CW\*(C`n\*(C'\fR bits using Maurer's FastPrime
algorithm.  \f(CW\*(C`n\*(C'\fR must be at least 2.  Returns a list of two items: the
prime and the certificate.
.SS "random_shawe_taylor_prime"
.IX Subsection "random_shawe_taylor_prime"
Construct a random provable prime of \f(CW\*(C`n\*(C'\fR bits using Shawe-Taylor's
algorithm.  \f(CW\*(C`n\*(C'\fR must be at least 2.  The implementation is from
\&\s-1FIPS 186\-4\s0 and uses \s-1SHA\-256\s0 with 512 bits of randomness.
.SS "random_shawe_taylor_prime_with_cert"
.IX Subsection "random_shawe_taylor_prime_with_cert"
Construct a random provable prime of \f(CW\*(C`n\*(C'\fR bits using Shawe-Taylor's
algorithm.  \f(CW\*(C`n\*(C'\fR must be at least 2.  Returns a list of two items: the
prime and the certificate.
.SS "random_strong_prime"
.IX Subsection "random_strong_prime"
Construct a random strong prime of \f(CW\*(C`n\*(C'\fR bits.  \f(CW\*(C`n\*(C'\fR must be at least 128.
.SS "random_proven_prime"
.IX Subsection "random_proven_prime"
Generate or construct a random provable prime of \f(CW\*(C`n\*(C'\fR bits.  \f(CW\*(C`n\*(C'\fR must
be at least 2.
.SS "random_proven_prime_with_cert"
.IX Subsection "random_proven_prime_with_cert"
Generate or construct a random provable prime of \f(CW\*(C`n\*(C'\fR bits.  \f(CW\*(C`n\*(C'\fR must
be at least 2.  Returns a list of two items: the prime and the certificate.
.SH "RANDOM PRIMALITY FUNCTIONS"
.IX Header "RANDOM PRIMALITY FUNCTIONS"
.SS "miller_rabin_random"
.IX Subsection "miller_rabin_random"
Given a number \f(CW\*(C`n\*(C'\fR and a number of tests to perform \f(CW\*(C`k\*(C'\fR, this does \f(CW\*(C`k\*(C'\fR
Miller-Rabin tests on \f(CW\*(C`n\*(C'\fR using randomly selected bases.  The return value
is 1 if all bases are a witness to to \f(CW\*(C`n\*(C'\fR, or 0 if any of them fail.
.SH "SEE ALSO"
.IX Header "SEE ALSO"
Math::Prime::Util
.SH "AUTHORS"
.IX Header "AUTHORS"
Dana Jacobsen <dana@acm.org>
.SH "COPYRIGHT"
.IX Header "COPYRIGHT"
Copyright 2012\-2013 by Dana Jacobsen <dana@acm.org>
.PP
This program is free software; you can redistribute it and/or modify it under the same terms as Perl itself.