Alex Pankratov wrote: >> I want to make this distinction because I'd like to talk >> about secret keys, which have to be rather larger than 4 >> kbits to have 4kbits of entropy for modular arithmetic stuff. > > Are you referring to RSA-like secrets that involve prime > numbers, which are therefore selected from a smaller subset > of Z(n) ?
Yes. -- http://www.apache-ssl.org/ben.html http://www.links.org/ "There is no limit to what a man can do or how far he can go if he doesn't mind who gets the credit." - Robert Woodruff --------------------------------------------------------------------- The Cryptography Mailing List Unsubscribe by sending "unsubscribe cryptography" to [EMAIL PROTECTED]