Tomás Ó hÉilidhe <(E-Mail Removed)> wrote in message

news:(E-Mail Removed)...

>

> I've come across a few implementations of the algorithm but none of

> them have been fully-portable.

>

> Particularly, I'm looking for an algorithm that doesn't make

> assumptions on:

> 1) Byte order (e.g. big-endian Vs little-endian).

> 2) The size of any of the integer types.

> 3) The presence or lack of padding in any of the integer types.
No guarantees about the above, but have you seen the following

(I noticed this when I was answering another question here about

large-scale open source "C" projects:

http://lxr.linux.no/linux/lib/sha1.c

> If someone has a fully-portable implementation of the algorithm I'd be

> very appreciative if you could post it here, or give me a link, or

> perhaps mail it to me:

> tKoe AT lavKabit DOT cKom (remove the K's)

>

> Failing that, if someone could point me to a very-well written

> implementation of the algorithm that I can edit myself then I'd be

> appreciative.
Again, no guarantees about this...who know if it even works on

Torvalds' Timex Sinclair...

---

William Ernest Reid