[49286] in cryptography@c2.net mail archive
wanted: mod arith equivalences/tautologies
daemon@ATHENA.MIT.EDU (Travis H.)
Tue Oct 3 17:07:02 2006
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
Date: Tue, 3 Oct 2006 13:38:47 -0500
From: "Travis H." <solinym@gmail.com>
To: Cryptography <cryptography@metzdowd.com>
Hey does anyone have a good link for the various equivalencies
(or inequivalencies) for modular arithmetic?
I realize some will only apply to certain moduli, especially primes.
I'm basically wanting to find some good algorithms for certain
simple computations, like f(x) = ax + b (mod n), or the BPP
digit extractor for Pi, but for very large values. I'm hoping to do
them in ocaml or python.
--
Enhance your calm, fellow citizen; it's just ones and zeroes.
Unix "guru" for rent or hire -><- http://www.lightconsulting.com/~travis/
GPG fingerprint: 9D3F 395A DAC5 5CCC 9066 151D 0A6B 4098 0C55 1484
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
