Ladhe Signatures: Compact Hash-Based Signatures from Additive Prime Decompositions
Fuente:
Zenodo
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Recurso digital |
| Sprache: | Englisch |
| Veröffentlicht: |
Zenodo
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866901530048724992 |
|---|---|
| author | Shubham Ladhe Pankaj Ladhe |
| author_facet | Shubham Ladhe Pankaj Ladhe |
| contents | <p class="p1">We introduce Ladhe, a hash-based signature scheme whose private key is an ascending</p> <p class="p1">tuple of distinct primes summing to a public prime P. The public key is the hash of an</p> <p class="p1">indexed-pair compression of these primes. We present a one-time variant and describe its</p> <p class="p1">extension to a many-time scheme via standard Merkle aggregation. Security reduces to</p> <p class="p1">preimage resistance of the underlying hash function (SHA-256 in our reference), the same</p> <p class="p1">foundation as SPHINCS+. The arithmetic structure of the private key enables compact</p> <p class="p1">signatures (the primes themselves, no Merkle path in the one-time case) and structural</p> <p class="p1">verification (a fixed number of primality tests plus one hash evaluation). We give the full</p> <p class="p1">construction, formal security analysis in the random oracle model, an IANA-registered al-</p> <p class="p1">gorithm identifier (Private Enterprise Number 65644, registered April 2026), a reference</p> <p class="p1">Python implementation, and a public cryptanalysis challenge. Efficient KeyGen at crypto-</p> <p class="p1">graphic parameter sizes remains open.</p> |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_19795884 |
| institution | Zenodo |
| language | eng |
| publishDate | 2026 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | Ladhe Signatures: Compact Hash-Based Signatures from Additive Prime Decompositions Shubham Ladhe Pankaj Ladhe post-quantum, hash-based-signatures, cryptography, one-time-signatures, sha-256, ladhe, prime-decomposition, ldp, public-key-infrastructure <p class="p1">We introduce Ladhe, a hash-based signature scheme whose private key is an ascending</p> <p class="p1">tuple of distinct primes summing to a public prime P. The public key is the hash of an</p> <p class="p1">indexed-pair compression of these primes. We present a one-time variant and describe its</p> <p class="p1">extension to a many-time scheme via standard Merkle aggregation. Security reduces to</p> <p class="p1">preimage resistance of the underlying hash function (SHA-256 in our reference), the same</p> <p class="p1">foundation as SPHINCS+. The arithmetic structure of the private key enables compact</p> <p class="p1">signatures (the primes themselves, no Merkle path in the one-time case) and structural</p> <p class="p1">verification (a fixed number of primality tests plus one hash evaluation). We give the full</p> <p class="p1">construction, formal security analysis in the random oracle model, an IANA-registered al-</p> <p class="p1">gorithm identifier (Private Enterprise Number 65644, registered April 2026), a reference</p> <p class="p1">Python implementation, and a public cryptanalysis challenge. Efficient KeyGen at crypto-</p> <p class="p1">graphic parameter sizes remains open.</p> |
| title | Ladhe Signatures: Compact Hash-Based Signatures from Additive Prime Decompositions |
| topic | post-quantum, hash-based-signatures, cryptography, one-time-signatures, sha-256, ladhe, prime-decomposition, ldp, public-key-infrastructure |
| url | https://doi.org/10.5281/zenodo.19795884 |