Viewing profile — ciphernomad-org
ciphernomad-org
HN member- Joined
- Sun, Jun 22, 2025, 11:02 PM UTC
- HN karma
- 21
- Public activity
- 14 items
- HN profile
- View on Hacker News ↗
About ciphernomad-org
Recent public activity
-
comment
Comment #44360300
You are correct, it is not the same project. That's a name collision with a 2002 paper. To your original question on the benefits over a standard AEAD: For stateless encryption, ou…
-
comment
Comment #44354175
1. Formal Spec: You're right. A formal specification is the top priority. We released the code first as a concrete artifact to invite this exact kind of direct scrutiny. 0. Process…
-
comment
Comment #44353997
This is a classic Feistel network round: L_new = L_old ^ F(key, R_old). It's a deliberate design. The security of the Labyrinth relies on the composition of many rounds, not any si…
-
comment
Comment #44353758
The security does not depend on the path's structure. It depends on the CVM's state ratchet. The key and IV for every single round are derived from a keyed hash of the CVM's curren…
-
comment
Comment #44353656
You are correct from a formal perspective. Any finite state machine is periodic. In cryptography, "aperiodic" means the period is computationally unreachable. We use a 256-bit stat…
-
comment
Comment #44353620
Let's clarify. 1. CVM State: It's an internal 32-byte register, not pre-shared. For each operation, it's initialized from a unique nonce (e.g., enc_nonce). This nonce is transmitte…
-
comment
Comment #44353574
The core difference is what is being ratcheted. Signal's Double Ratchet evolves the keys for a static algorithm like AES. In Ariadne, the ratchet evolves the algorithm itself. The …
-
comment
Comment #44353495
A formal spec is the next priority. We released the implementation first as the protocol is novel and we invite direct scrutiny of the work. The path selection is secret, not publi…
-
comment
Comment #44353476
That's the key distinction. This isn't just a complex function, but a programmable machine that enables new capabilities. For example: verifiable, time-locked proof of computation …
-
comment
Comment #44353309
You are correct. The probability of a state collision is cryptographically negligible, on the order of breaking a 256-bit hash function. You're also right that AES-GCM is faster an…
-
comment
Comment #44353277
Yes. The core architecture is crypto-agile. Its foundation is quantum-resistant because it's built on symmetric primitives like hashing and stream ciphers. We used X25519 and Ed255…
- comment
-
story
Show HN: Ariadne – A Rust implementation of aperiodic cryptography
Hello HN, we're CipherNomad, the research initiative behind this project. The Ariadne Protocol is our exploration of a different cryptographic model. The work began with an observa…
- story