Alternatives
Products that do what Arxid – keyed, non-enumerable ID obfuscation does
I kept reaching for Hashids/Sqids to keep sequential IDs out of URLs, but they don't use a real key — the alphabet is shuffled by a salt, and the Sqids FAQ says outright "there is no encryption of any kind." arxid is a keyed reversible permutation instead: a balanced Feistel network with an ARX (add-rotate-xor) round function over a 40-bit domain, mapping to a 7-char base62 code. Feed it an integer, get an unpredictable code back; same key reverses it. Runs ~16x faster than a structurally identical Feistel using HMAC-SHA256, because the round function is integer ops instead of a hash…
- 1
- 2XD
XID generates 20-character globally unique IDs (48-bit timestamp + 64-bit entropy + 8-bit counter + 5-bit checksum) in a single C file with zero dependencies. Features built-in timestamp extraction, collision resistance, and portable design for any platform - ideal for databases, IoT, and distributed systems. char id = xid_generate(); // => "01H5Z7K4W9A3B6C8D0F2G" Gists: https://gist.github.com/Ferki-git-creator/17450d52d143f746f0... (Feedback wanted: entropy improvements, embedded use cases, optimizations)*
2025 · gist.github.com
- 3SI
2016 · github.com
- 4
- 5BA
2020 · github.com
- 6EI
2016 · github.com
- 7DK
2014 · github.com
- 8TT
2017 · npmjs.com
- 9BH
2020 · github.com
- 10GE
2018 · github.com
- 11SE
Hello. I made this project as an experiment in using key cryptography for user identity in a client server model, and for some future peer to peer projects that I am working on. I am looking for feedback, please let me know what you think. Also, Merry Christmas to HN! :-)
2022 · github.com
- 12TH
2020 · github.com
- 13UA
The discussion about what to use for database keys has come up a few times on HN. Integers or UUID, or maybe ULID/UUIDv7 with a time component. One that also comes up is prefixes (as used by Stripe, most famously). The biggest downside (imo) of the Stripe approach is that you either have to store them as strings, which isn't great, or strip/prepend in your API layer. So I made a new thing called UPID. It's most similar to ULID, as it includes a time-component (but with lower precision) and also encodes to a base32 alphabet. But it also includes a 20-bit prefix (allowing four…
2024 · github.com
- 14AS
2018 · github.com
- 15AE
2016 · github.com
- 16FA
I was working on optimising Subversion. One of its bottleneck is computing file hashes. First thing I tried was to use OpenSSL for that. It significantly improved its performance. It made it 8x faster in some cases. However, it was not optimal to use it: - OpenSSL is heavy and bloated. It's like a whole operating system on its own. - Since OpenSSL 3.0, low-level digest APIs are deprecated, and instead they recommend to use EVP which might be slow in some cases. So I decided to create a new library for computing cryptographic digests. It basically takes OpenSSL's implementations, but with an…
Feb 2026 · github.com
- 17BI
2022 · badkeys.info
- 18AN
2020 · github.com
- 19DA
Github Link: https://github.com/prahladyeri/distroverify Folks, I'm a distro hopper who mainly hops between ubuntu distros such as ubuntu, xubuntu, ubuntu-mate, etc. One thing I've found is the frequent need to verify the SHA1 hashes of the local and original version found on cdimage.ubuntu.com. Sometimes, you forget to verify the hash immediately and later, you have to again scavenge for that download URL in your browser history and then find the hash files URL, isn't it? For this, I've created a tool called distroverify that automatically pulls the corresponding…
2019
- 20BS
2020 · daniellowengrub.com
- 21DO
I’ve developed a new public-key encryption scheme (DIAC) that uses multidimensional, high-precision complex keyspaces and a modular trapdoor function for ultra-high entropy and quantum resistance. The code, benchmarks, and research paper (PDF) are all open-source: https://osf.io/mvkcq/ Would love feedback, questions, or cryptanalysis!
2025 · osf.io
- 22PP
2022 · github.com
- 23LL
Homomorphic encryption enables computations to be performed directly on encrypted data without requiring access to the private key. This allows data to be securely stored in the cloud while still being processed using the cloud’s computational power. Meanwhile, the cloud remains unaware of the actual data it is handling. Although fully homomorphic encryption has become available in recent years, when considering performance trade-offs, partially homomorphic encryption proves to be a more efficient and practical choice. It is significantly faster, requires fewer computational resources, and…
2025 · github.com
- 24TA
Hey HN, I'm Willem from Confident Security, we've built CONFSEC, a provably private AI inference engine. Today, we're excited to open-source twoway: https://github.com/confidentsecurity/twoway twoway is a Go package that makes it easy to implement secure, encrypted request-response flows. It powers CONFSEC's blind prompt handling, ensuring no one, not even us, can see client requests. We built twoway on Cloudflare's circl/hpke, it uses Hybrid Public key Encryption to implement two flows: - A one-to-one flow where a sender communicates with a single receiver. This…
Oct 2025 · github.com
Ranked by how close each launch is in meaning, then by votes. Refine with a description →