[–] nwrk 9y ago ↗ Nice, there is also HashIds [1] with implementation in many languages[1] http://hashids.org/ [–] marco1 9y ago ↗ Thanks!Please note that the presented solution is both more efficient and more "secure" (i.e. "obscure", which is all we want here). It turns sequential IDs into non-sequential IDs, in addition to converting the base for use of a larger alphabet.
[–] marco1 9y ago ↗ Thanks!Please note that the presented solution is both more efficient and more "secure" (i.e. "obscure", which is all we want here). It turns sequential IDs into non-sequential IDs, in addition to converting the base for use of a larger alphabet.
2 comments
[ 3.1 ms ] story [ 16.0 ms ] thread[1] http://hashids.org/
Please note that the presented solution is both more efficient and more "secure" (i.e. "obscure", which is all we want here). It turns sequential IDs into non-sequential IDs, in addition to converting the base for use of a larger alphabet.