class INT_EXT |
---|
extended_gcd(i,j:INT, out f1: INT, out f2:INT):INT |
---|
**** | gcd = i*f1 + j*f2 x:SAME:=one; y:SAME:=zero; u:SAME:=zero; v:SAME:=one; |
inv(p,g:INT):INT |
---|
**** | inverse of g as finite field Zp. i.e. p:prime. g*inv(p,g)=1 (mod p). |
is_prime(x:INT):BOOL |
---|
**** | Is __x__ prime? |
power_mod(n,j,p:INT):INT |
---|