I'm thinking of adding OMAC to LibTomCrypt however I have a question not resolved in the paper [or at least I didn't see it]. What is the standard for computing u^-1 [L * x^-1 specifically] for arbitrary block sizes?
I would have simply used a shift code .e.g. L2 = L1 xor (L1 << 1) Or something like that since it can be computed for any size block cipher relatively easily. Tom __________________________________ Do you Yahoo!? Yahoo! Calendar - Free online calendar with sync to Outlook(TM). http://calendar.yahoo.com --------------------------------------------------------------------- The Cryptography Mailing List Unsubscribe by sending "unsubscribe cryptography" to [EMAIL PROTECTED]
