I was wondering if someone tell me how I go about calculating
collision rates for a "key" that is 2 characters (lowercase alpha
only) long?

I realise it's 26x26 but if I generate two random numbers between 1-26
is that all that's involved? So each time I generate this key, I have
a 1/676 chance of a collision?

Thanks for the help

hamada gmail.com> wrote:

"Thou shalt love thy neighbour like thyself."

I win, you lose. On spelling as well as on principle.

Richard

I was wondering what the group here thinks is the set of
characteristics a good file compressor should have before one does an
ecnryption pass. I feel not only should it compress well but that it
shoulf be bijective and that it should not suffer from Uniciciy
distance problem like arithmetic or ppm.
What are your views?

David A. Scott
--
My Crypto code
http://bijective.dogma.net/crypto/scott19u.zip
http://www.jim.com/jamesd/Kong/scott19u.zip old version
My Compression code http://bijective.dogma.net/
**TO EMAIL ME drop the roman "five" **
Disclaimer:I am in no way responsible for any of the statements
made in the above text. For all I know I might be drugged.
As a famous person once said "any cryptograhic
system is only as strong as its weakest link"

Hi,

I am facing an issue for the authentication with RSA.
Scenario :

I have 2 application
1] Internet banking application
2] Armor (used for authentication and authorization)

The Armor is the agent host communicating with RSA.

Flow of the user request :

Internet banking application user ---> Armor ---> RSA

Internet banking application is in SUN cluster and Armor is in a
seperate server without any cluster.

We have generated the sdconf.rec file for the agent host "Armor"
Now when the user tries to login from the Internet banking application
the error at the RSA server comes as " Access denied ,Invalid
passcode".
The securid file does not get created.