On 12/4/06, Bradley Lucier lucier@math.purdue.edu wrote:
Still note great, but here we allocate only 1/3 as much memory, and most of that could be eliminated with a more careful circular shift (masking *before* shifting instead of after) and fixnum declarations. Left as an exercise for the reader ;-).
Brad
Or you could use Guillaume's Gambit interface to OpenSSL's sha1 routines:
http://66.102.7.104/search?q=cache:WUj3-7OmyWwJ:paste.lisp.org/display/9642
But maybe that's cheating... :)
(Google cache because paste.lisp.org appears to be b0rked.)
--Jeff