Check out: http://en.wikipedia.org/wiki/UUID
Arunachalam wrote: > 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 > > ------=_Part_6796_13181770.1162486239368 > Content-Type: text/html; charset=ISO-8859-1 > X-Google-AttachSize: 1337 > > <div>Look at one way hashing algorithms. Which can map a password to some > byte keys.</div> > <div> </div> > <div>I think MD5 will solve your purpose. But collisions are possible in MD5. > <a > href="http://en.wikipedia.org/wiki/MD5";>http://en.wikipedia.org/wiki/MD5</a></div> > <div> </div> > <div>regards</div> > <div>Arunachalam.<br><br> </div> > <div><span class="gmail_quote">On 11/2/06, <b > class="gmail_sendername">howa</b> <<a href="mailto:[EMAIL > PROTECTED]">[EMAIL PROTECTED]</a>> wrote:</span> > <blockquote class="gmail_quote" style="PADDING-LEFT: 1ex; MARGIN: 0px 0px 0px > 0.8ex; BORDER-LEFT: #ccc 1px solid"><br>Hi geek, consider the following > suitation...<br><br>1. a server, response to incoming users with a random > generated string > <br>(less than 255 bytes)<br><br>2. a user, might request to a server at the > same time, i.e. within the<br>same second of time<br><br>3. within a second, > the requests might be as high as 1000<br><br>4. the server has a unique > identifcation of user, > e.g. IP<br><br>5. the string can be re-used, say after 1 hour<br><br>how to > generate the string with the min. chance of collision?<br><br>any > idea?<br><br><br><br><br></blockquote></div><br><br clear="all"><br>-- > <br>===================================<br>want to know more about > me<br>http"//ww.livejournal.com/users/arunachalam > > ------=_Part_6796_13181770.1162486239368-- --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups-beta.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
