Description Usage Arguments Value Author(s) References Examples
Simple number theoretic functions
1 2 3 4 5 6 |
a,b,m,n |
Integer |
EulerPhi
Eulers totient function = number of divisors of n.
scm, gcd
Smallest common multiple, Greatest common divisor.
Euclid
Computes x, y from a, b such that the equation a*x + b*y = gcd(m,n) is satisfied.
Inv
Modular inverse in a finite ring, NA if not exists.
modexp
Exponentiation a^b mod n using repeated squaring via binary decomposition of exponent.
Christian W. Hoffmann <christian@echoffmann.ch>
modexp: http://mvngu.wordpress.com/2008/08/01/parigp-programming-for-basic-cryptography/
1 2 3 4 5 |
Loading required package: lattice
Loading required package: grid
[1] 665
[1] 7
[1] -1 4 7
[1] 16
[1] 4
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.