What is the hash method producing 128-bit output (32 hex chars) with lowest collision likelyhood? [migrated]

I need to utilize the UUID datatype (128bit) for storing my hashes. The goal is to be able quickly calculate/identify different records by comparing it rather than millions of 1-10k char long strings. So the goal here is not the security (… Continue reading What is the hash method producing 128-bit output (32 hex chars) with lowest collision likelyhood? [migrated]

What kind of security is it? Base64/MD5. Key with 22 characters and 32 characters

What kind of security do you suggest for this case?
What do you think is the security flow?
It is happening in a web which download a PDF document, inside the document has a QR code. This QR code has a URL to the same web page, but display… Continue reading What kind of security is it? Base64/MD5. Key with 22 characters and 32 characters

Hashing a MD5 digest with a private key, then XOR[ing] the digest and private key [migrated]

TL;DR
Does hashing a MD5 digest with a private key, then XOR[ing] the digest (twice recursively, with offset) have any glaring issues? Would this mean MD5 is predictable?
Is partial MD5 recognition possible?
General Overview
I convinced my… Continue reading Hashing a MD5 digest with a private key, then XOR[ing] the digest and private key [migrated]