Well, it depends on what you call "slow". Most cryptographical functions
are not fast - they do a lot of complicated things. I'm not sure on
comparative analysis of hash-functions, but I'm almost sure the above book
should have some pointers on that. That's The Book in applied
cryptography :)
I´ve ordered that book and md5() isn´t what I´d call "slow" (I´ve benchmarked now), perhaps I´d rather say "not fast".
To ensure that I´ve understood...
after executing this for a arbitrary $l with a strlen *below* 128 Bits...
for ($i=1;$i<=$tot;$i++) $n[md5($i)]=TRUE;
...sizeof($n) equals $tot
In other words it generates unique identifiers up to length of 128Bits
I´ve tried with $tot=1000000 where every key was unique.
regards
--
o----------0-¬---------O-·---¬----o---®-----o o O ° .
| http://www.kiffen.de | pRoteçt y0ur bRaín |0 O ° ¤ °
·
0°·³°²'²³-¹'³´³°^°³~³²³°'³²²¨³²^³¹³²°²³`³º³°Þ °
o © ° . ·
| psychedelic experience | gott@kiffen.de | O ° o °
o-¬--o--0-----©-·--O-----o-----0-¤----------o 0 ° · ° . ¤ ·