Wed, 31 Dec 2014 06:09:35 +0100
Cloned upstream origin tor-browser at tor-browser-31.3.0esr-4.5-1-build1
revision ID fc1c9ff7c1b2defdbc039f12214767608f46423f for hacking purpose.
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 | lap - compute least annihilating power of a number |
michael@0 | 8 | |
michael@0 | 9 | =head1 SYNOPSIS |
michael@0 | 10 | |
michael@0 | 11 | lap <a> <m> |
michael@0 | 12 | |
michael@0 | 13 | =head1 DESCRIPTION |
michael@0 | 14 | |
michael@0 | 15 | The B<lap> program computes the order of I<a> modulo I<m>, for |
michael@0 | 16 | arbitrary precision integers I<a> and I<m>. The B<order> of I<a> |
michael@0 | 17 | modulo I<m> is defined as the smallest positive value I<n> for which |
michael@0 | 18 | I<a> raised to the I<n>th power, modulo I<m>, is equal to 1. The |
michael@0 | 19 | order may not exist, if I<m> is composite. |
michael@0 | 20 | |
michael@0 | 21 | =head1 RESTRICTIONS |
michael@0 | 22 | |
michael@0 | 23 | This program is very slow, especially for large moduli. It is |
michael@0 | 24 | intended as a way to help find primitive elements in a modular field, |
michael@0 | 25 | but it does not do so in a particularly inefficient manner. It was |
michael@0 | 26 | written simply to help verify that a particular candidate does not |
michael@0 | 27 | have an obviously short cycle mod I<m>. |
michael@0 | 28 | |
michael@0 | 29 | =head1 SEE ALSO |
michael@0 | 30 | |
michael@0 | 31 | gcd(1), invmod(1), isprime(1) |
michael@0 | 32 | |
michael@0 | 33 | =head1 AUTHOR |
michael@0 | 34 | |
michael@0 | 35 | Michael J. Fromberger <sting@linguist.dartmouth.edu> |
michael@0 | 36 | Thayer School of Engineering, Hanover, New Hampshire, USA |