Re: 1024 bit RSA exportable?

Eric Rescorla wrote: > I'm trying to sort out what the situation is for RSA exportability > under the new regulations. Obviously, we can use DES, but > are we still restricted to 512 bit RSA keys. What's the story? Obviously? You can apply for an export license, and if you pass the one-time tec

1024 bit RSA exportable?

I'm trying to sort out what the situation is for RSA exportability under the new regulations. Obviously, we can use DES, but are we still restricted to 512 bit RSA keys. What's the story? Thanks, -Ekr [Eric Rescorla [EMAIL PROTECTED]]

Re: rng

Arnold G. Reinhold wrote: > > You can see that Perry is right by a simple counting argument. Say the word > size is m bits. There are 2**(3*m) cvombinations of seed, multiplier, and > modulus and there are (2**m)! possible arangements of the values. The > latter is much bigger for m > 2. > >

Re: rng

At 6:52 PM -0700 3/29/99, [EMAIL PROTECTED] wrote: >Is it possible to choose a seed, multiplier, and modulus for a linear >congruential generator such that it duplicates any finite list of >positive integers? > >[No, but I'll let others expand or do it in another message. --Perry] > >-- >Mike Stay

Biprime Cryptography to replace RSA?

At 5:27 PM -0800 3/29/99, John Gilmore wrote: > >Now that their patent is getting ready to expire (next fall), RSA is >trying to crack down on anyone who refers to the use of the >algorithm by calling it "RSA". ... > >Perhaps we should have a little contest for what to call the RSA >algorithm, giv

rng

Is it possible to choose a seed, multiplier, and modulus for a linear congruential generator such that it duplicates any finite list of positive integers? [No, but I'll let others expand or do it in another message. --Perry] -- Mike Stay Cryptographer / Programmer AccessData Corp. mailto:[EMAIL