From: Christophe Rhodes <csr21@ca...>  20031118 00:03:20

Alexey Dejneka <adejneka@...> writes: > +<note><para> As of &SBCL; 0.8.5 "good" functions > +are <function>+</>, <function></>; <function>logand</>, <function>logior</>, > +<function>logxor</>, <function>lognot</> and their combinations; > +and <function>ash</> with the positive second argument. ... which reminds me... * is probably also a good function that would warrant a modular implementation at some point, no? Is there an algorithm out there that uses * mod 2^32, or are all the cryptoid algorithms doing arithmetic mod prime? Cheers, Christophe  http://wwwjcsu.jesus.cam.ac.uk/~csr21/ +44 1223 510 299/+44 7729 383 757 (setpprintdispatch 'number (lambda (s o) (declare (special b)) (format s b))) (defvar b "~&Just another Lisp hacker~%") (pprint #36rJesusCollegeCambridge) 