Look at one way hashing algorithms. Which can map a password to some byte keys.
I think MD5 will solve your purpose. But collisions are possible in MD5. http://en.wikipedia.org/wiki/MD5
regards
Arunachalam.
On 11/2/06, howa <[EMAIL PROTECTED]> wrote:
Hi geek, consider the following suitation...
1. a server, response to incoming users with a random generated string
(less than 255 bytes)
2. a user, might request to a server at the same time, i.e. within the
same second of time
3. within a second, the requests might be as high as 1000
4. the server has a unique identifcation of user, e.g. IP
5. the string can be re-used, say after 1 hour
how to generate the string with the min. chance of collision?
any idea?
--
===================================
want to know more about me
http"//ww.livejournal.com/users/arunachalam
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups-beta.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
