/security/nss/lib/freebl/mpi/doc/invmod.pod

http://github.com/zpao/v8monkey · Unknown · 33 lines · 19 code · 14 blank · 0 comment · 0 complexity · c644fd7021f3723e05e57261c9a42bab MD5 · raw file 

    

  1. =head1 NAME
    2. 

  2. 

  3.  invmod - compute modular inverse of an integer
    4. 

  4. 

  5. =head1 SYNOPSIS
    6. 

  6. 

  7.  invmod <a> <m>
    8. 

  8. 

  9. =head1 DESCRIPTION
    10. 

  10. 

  11. The B<invmod> program computes the inverse of I<a>, modulo I<m>, if
    12. 

  12. that inverse exists.  Both I<a> and I<m> are arbitrary-precision
    13. 

  13. integers in decimal notation.  The result is written in standard
    14. 

  14. decimal notation to the standard output.
    15. 

  15. 

  16. If there is no inverse, the message:
    17. 

  17. 

  18.  No inverse
    19. 

  19. 

  20. ...will be printed to the standard output (an inverse exists if and
    21. 

  21. only if the greatest common divisor of I<a> and I<m> is 1).
    22. 

  22. 

  23. =head1 SEE ALSO
    24. 

  24. 

  25. gcd(1), isprime(1), lap(1)
    26. 

  26. 

  27. =head1 AUTHOR
    28. 

  28. 

  29.  Michael J. Fromberger <sting@linguist.dartmouth.edu>
    30. 

  30.  Thayer School of Engineering, Hanover, New Hampshire, USA
    31. 

  31.  
    32. 

  32.  $Date: 2000/07/14 00:44:33 $
    33.