diff options
author | Lorry <lorry@roadtrain.codethink.co.uk> | 2012-07-18 20:31:20 +0100 |
---|---|---|
committer | Lorry <lorry@roadtrain.codethink.co.uk> | 2012-07-18 20:31:20 +0100 |
commit | e43ad1f4ce7f1504e6f01fc8a90d5c0398013383 (patch) | |
tree | 03504d9d81336081b899c9f34cc0f66801caf67c /mozilla/security/nss/lib/freebl/mpi/doc/lap.pod | |
download | nss-e43ad1f4ce7f1504e6f01fc8a90d5c0398013383.tar.gz |
Tarball conversion
Diffstat (limited to 'mozilla/security/nss/lib/freebl/mpi/doc/lap.pod')
-rw-r--r-- | mozilla/security/nss/lib/freebl/mpi/doc/lap.pod | 35 |
1 files changed, 35 insertions, 0 deletions
diff --git a/mozilla/security/nss/lib/freebl/mpi/doc/lap.pod b/mozilla/security/nss/lib/freebl/mpi/doc/lap.pod new file mode 100644 index 0000000..9ade65f --- /dev/null +++ b/mozilla/security/nss/lib/freebl/mpi/doc/lap.pod @@ -0,0 +1,35 @@ +=head1 NAME + + lap - compute least annihilating power of a number + +=head1 SYNOPSIS + + lap <a> <m> + +=head1 DESCRIPTION + +The B<lap> program computes the order of I<a> modulo I<m>, for +arbitrary precision integers I<a> and I<m>. The B<order> of I<a> +modulo I<m> is defined as the smallest positive value I<n> for which +I<a> raised to the I<n>th power, modulo I<m>, is equal to 1. The +order may not exist, if I<m> is composite. + +=head1 RESTRICTIONS + +This program is very slow, especially for large moduli. It is +intended as a way to help find primitive elements in a modular field, +but it does not do so in a particularly inefficient manner. It was +written simply to help verify that a particular candidate does not +have an obviously short cycle mod I<m>. + +=head1 SEE ALSO + +gcd(1), invmod(1), isprime(1) + +=head1 AUTHOR + + Michael J. Fromberger <sting@linguist.dartmouth.edu> + Thayer School of Engineering, Hanover, New Hampshire, USA + + $Date: 2000/07/14 00:44:34 $ + |