1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/security/nss/lib/freebl/mpi/doc/lap.pod Wed Dec 31 06:09:35 2014 +0100
1.3 @@ -0,0 +1,36 @@
1.4 +# This Source Code Form is subject to the terms of the Mozilla Public
1.5 +# License, v. 2.0. If a copy of the MPL was not distributed with this
1.6 +# file, You can obtain one at http://mozilla.org/MPL/2.0/.
1.7 +
1.8 +=head1 NAME
1.9 +
1.10 + lap - compute least annihilating power of a number
1.11 +
1.12 +=head1 SYNOPSIS
1.13 +
1.14 + lap <a> <m>
1.15 +
1.16 +=head1 DESCRIPTION
1.17 +
1.18 +The B<lap> program computes the order of I<a> modulo I<m>, for
1.19 +arbitrary precision integers I<a> and I<m>. The B<order> of I<a>
1.20 +modulo I<m> is defined as the smallest positive value I<n> for which
1.21 +I<a> raised to the I<n>th power, modulo I<m>, is equal to 1. The
1.22 +order may not exist, if I<m> is composite.
1.23 +
1.24 +=head1 RESTRICTIONS
1.25 +
1.26 +This program is very slow, especially for large moduli. It is
1.27 +intended as a way to help find primitive elements in a modular field,
1.28 +but it does not do so in a particularly inefficient manner. It was
1.29 +written simply to help verify that a particular candidate does not
1.30 +have an obviously short cycle mod I<m>.
1.31 +
1.32 +=head1 SEE ALSO
1.33 +
1.34 +gcd(1), invmod(1), isprime(1)
1.35 +
1.36 +=head1 AUTHOR
1.37 +
1.38 + Michael J. Fromberger <sting@linguist.dartmouth.edu>
1.39 + Thayer School of Engineering, Hanover, New Hampshire, USA
