security/nss/lib/freebl/mpi/doc/invmod.pod@b8a032363ba2 (annotated)
security/nss/lib/freebl/mpi/doc/invmod.pod
Thu, 22 Jan 2015 13:21:57 +0100
- author
- Michael Schloh von Bennewitz <michael@schloh.com>
- date
- Thu, 22 Jan 2015 13:21:57 +0100
- branch
- TOR_BUG_9701
- changeset 15
- b8a032363ba2
- permissions
- -rw-r--r--
Incorporate requested changes from Mozilla in review:
https://bugzilla.mozilla.org/show_bug.cgi?id=1123480#c6
| michael@0 | 1 | # This Source Code Form is subject to the terms of the Mozilla Public |
| michael@0 | 2 | # License, v. 2.0. If a copy of the MPL was not distributed with this |
| michael@0 | 3 | # file, You can obtain one at http://mozilla.org/MPL/2.0/. |
| michael@0 | 4 | |
| michael@0 | 5 | =head1 NAME |
| michael@0 | 6 | |
| michael@0 | 7 | invmod - compute modular inverse of an integer |
| michael@0 | 8 | |
| michael@0 | 9 | =head1 SYNOPSIS |
| michael@0 | 10 | |
| michael@0 | 11 | invmod <a> <m> |
| michael@0 | 12 | |
| michael@0 | 13 | =head1 DESCRIPTION |
| michael@0 | 14 | |
| michael@0 | 15 | The B<invmod> program computes the inverse of I<a>, modulo I<m>, if |
| michael@0 | 16 | that inverse exists. Both I<a> and I<m> are arbitrary-precision |
| michael@0 | 17 | integers in decimal notation. The result is written in standard |
| michael@0 | 18 | decimal notation to the standard output. |
| michael@0 | 19 | |
| michael@0 | 20 | If there is no inverse, the message: |
| michael@0 | 21 | |
| michael@0 | 22 | No inverse |
| michael@0 | 23 | |
| michael@0 | 24 | ...will be printed to the standard output (an inverse exists if and |
| michael@0 | 25 | only if the greatest common divisor of I<a> and I<m> is 1). |
| michael@0 | 26 | |
| michael@0 | 27 | =head1 SEE ALSO |
| michael@0 | 28 | |
| michael@0 | 29 | gcd(1), isprime(1), lap(1) |
| michael@0 | 30 | |
| michael@0 | 31 | =head1 AUTHOR |
| michael@0 | 32 | |
| michael@0 | 33 | Michael J. Fromberger <sting@linguist.dartmouth.edu> |
| michael@0 | 34 | Thayer School of Engineering, Hanover, New Hampshire, USA |
