|
From: Bill H. <goo...@go...> - 2008-08-15 12:13:20
|
Yep that's it. Thanks Peter. Note that you can't divide by zero mod p. Bill. On 15/08/2008, Peter Shrimpton <ps...@gm...> wrote: > if you are using unsigned longs then you can use z_invert(i,p) to get you > i^-1 mod p and then do c*(i^-1) mod p to get k. I think that should work > > Peter > > 2008/8/15 Richard Howell-Peak <ric...@gm...> > >> Is there anyway in FLINT to divide by a number mod p. For instance if I >> have i*k = c mod p and I know i and c, how can I compute k? >> >> -- >> Richard >> >> ------------------------------------------------------------------------- >> This SF.Net email is sponsored by the Moblin Your Move Developer's >> challenge >> Build the coolest Linux based applications with Moblin SDK & win great >> prizes >> Grand prize is a trip for two to an Open Source event anywhere in the >> world >> http://moblin-contest.org/redirect.php?banner_id=100&url=/ >> _______________________________________________ >> flint-devel mailing list >> fli...@li... >> https://lists.sourceforge.net/lists/listinfo/flint-devel >> >> > |