Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
ciphernomad-org
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
6 ms
·
1.
▲
by
ciphernomad-org
1y ago
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, our `ariadne-etm` crate offers no major advantage. The co
2.
▲
by
ciphernomad-org
1y ago
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: Our focus is on the technical merits of the work itse
3.
▲
by
ciphernomad-org
1y ago
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 single one. The unchanged right half from a Hash round is
4.
▲
by
ciphernomad-org
1y ago
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 current state. This state is a cryptographic digest
5.
▲
by
ciphernomad-org
1y ago
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 state, making the probability of a collision negligibl
6.
▲
by
ciphernomad-org
1y ago
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 transmitted publicly with the ciphertext as part of a s
7.
▲
by
ciphernomad-org
1y ago
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 path through the Labyrinth, the sequence of cryptograph
8.
▲
by
ciphernomad-org
1y ago
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 public. It is determined by `hash(key, state, chunk)`. An attacke
9.
▲
by
ciphernomad-org
1y ago
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 on a secret program. A standard hash or ZK-SNARK c
10.
▲
by
ciphernomad-org
1y ago
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 and has hardware support. Ariadne explores a different tr
11.
▲
by
ciphernomad-org
1y ago
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 Ed25519 in the transport layer examples for clarity, as they
12.
▲
Show HN: Ariadne – A Rust implementation of aperiodic cryptography
(codeberg.org)
40 points
by
ciphernomad-org
1y ago
|
31 comments