2 ms·
While I didn't know the details of ones other than 4, the one really useful one missing would be using some SHA256 data with a counter, not unlike PBKDF2. It co
by motohagiography 2y ago
While I didn't know the details of ones other than 4, the one really useful one missing would be using some SHA256 data with a counter, not unlike PBKDF2. It could be a privacy preserving derived identifier, where you you could loosely prove a given UUID had been derived from a given seed.
- tacitusarc 2y agoLike V3 but with a specifiable hash algorithm.
- kyzer-davis 2y agoThe appendix details how one can do a sha256 style v8 algo that is basically v5 with the algorithm swapped. In theory one could do this for any hashing algorithm. https://www.rfc-editor.org/rfc/rfc9562.html#name-example-of-a-uuidv8-value-n https://www.rfc-editor.org/rfc/rfc9562.html#name-example-of-... Though I am working on a way to solve this problem with UUIDs beyond 128 bits so we don't have to truncate the hash.
- dchest 2y agoIf you really need it, consider UUIDv4 as encoding, and use your cryptographic algorithm to create a 122-bit output and encode it as a UUID. Otherwise, you'd want longer outputs.