1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/security/nss/lib/freebl/mpi/doc/invmod.pod Wed Dec 31 06:09:35 2014 +0100
1.3 @@ -0,0 +1,34 @@
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 + invmod - compute modular inverse of an integer
1.11 +
1.12 +=head1 SYNOPSIS
1.13 +
1.14 + invmod <a> <m>
1.15 +
1.16 +=head1 DESCRIPTION
1.17 +
1.18 +The B<invmod> program computes the inverse of I<a>, modulo I<m>, if
1.19 +that inverse exists. Both I<a> and I<m> are arbitrary-precision
1.20 +integers in decimal notation. The result is written in standard
1.21 +decimal notation to the standard output.
1.22 +
1.23 +If there is no inverse, the message:
1.24 +
1.25 + No inverse
1.26 +
1.27 +...will be printed to the standard output (an inverse exists if and
1.28 +only if the greatest common divisor of I<a> and I<m> is 1).
1.29 +
1.30 +=head1 SEE ALSO
1.31 +
1.32 +gcd(1), isprime(1), lap(1)
1.33 +
1.34 +=head1 AUTHOR
1.35 +
1.36 + Michael J. Fromberger <sting@linguist.dartmouth.edu>
1.37 + Thayer School of Engineering, Hanover, New Hampshire, USA
