RecHash builds segmented hash-entangled chains for sequential authentication
Original title: RecHash: Segmented Hash-Entangled Chains for Stateful Sequential Authentication
A 256-bit digest, 32 pairs, and length 65535 yield 254 records plus a renewal certificate.
RecHash is a stateful sequential authentication scheme that assigns each record to a predetermined hash-chain segment with complementary positions encoding digest blocks. Digests fit every scheduled slot independently of earlier messages. The paper gives a full state transition, allocation formulas, and a renewal-free composition theorem that assumes authenticated history and an adaptive one-step guarantee. A concrete post-quantum reduction and security across renewal remain open.
Unconfirmed: A concrete post-quantum reduction and security across renewal remain open.
- Balanced allocation gives floor of L over 2 to the ceil of ell/k, plus one, slots.
- Each record needs 2048 bytes of openings for 256-bit chain outputs.
- The composition theorem depends on authenticated history and a one-step guarantee.
- Post-quantum reduction and security across renewal are left open.
From the original article
1 min read at arxiv.orgRecHash is a stateful sequential authentication construction based on paired hash-chain openings and an authenticated record history. It develops the decreasing position relation of the 2019 hash-entangled construction, whose exact integer normalization yields a two-coordinate constant-sum antichain. Direct proportional reuse is constrained by integer capacity and multiplicative contraction.
By Luis Adrián Lizama-Pérez · arxiv.org
A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.