(a/b) mod p ?
What is the fastest way to calculate a rational number a/b with a, b element N and gcd (b,p)=1 mod p where the result is in N ? :geek: :uncwilly: :gah:

[QUOTE=bhelmes;563151]What is the fastest way to calculate a rational number a/b with a, b element N and gcd (b,p)=1 mod p where the result is in N ? :geek: :uncwilly: :gah:[/QUOTE]
Is the Euclidean algorithm not fast enough for you? 
All times are UTC. The time now is 10:14. 
Powered by vBulletin® Version 3.8.11
Copyright ©2000  2021, Jelsoft Enterprises Ltd.