Metraipolis › archive › dc_dbb0602bc6fc

BenX: Resource-Sharing Permutations for Computational Integrity — arXiv:2609.31087

Source: arXiv (en)
Original: https://arxiv.org/abs/2609.31087
License (as archived): CC0-1.0
Archived: 2026-10-08T02:09:23.469Z
SHA-256 of the archived text: c1a9c0b7894f612d67ca130a35a14936b0057c2a5d1132b2bca742bb6e11d156
Stable URL of this page: https://metraipolis.com/documento/dc_dbb0602bc6fc

How to cite

BenX: Resource-Sharing Permutations for Computational Integrity — arXiv:2609.31087 — arXiv (en), https://arxiv.org/abs/2609.31087 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dbb0602bc6fc (Metraipolis archive dc_dbb0602bc6fc, sha256 c1a9c0b7894f612d67ca130a35a14936b0057c2a5d1132b2bca742bb6e11d156)

BibTeX

@misc{dcdbb0602bc6fc,
  title = {BenX: Resource-Sharing Permutations for Computational Integrity — arXiv:2609.31087},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.31087},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dbb0602bc6fc; sha256 c1a9c0b7894f612d67ca130a35a14936b0057c2a5d1132b2bca742bb6e11d156},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.31087. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Cryptographic hash functions over integers modulo a prime play a decisive role in the efficiency and security of proof systems for computational integrity. Early designs focused on compact arithmetic circuits and efficient software execution, primarily targeting general-purpose CPUs rather than hardware accelerators. This work focuses on enabling efficient resource sharing and hardware acceleration alongside efficient software execution. We propose BenX, a permutation-based hash function designed for hardware acceleration, fast CPU execution, and low circuit complexity in proof systems. To construct the underlying permutation, we turn the Benes network into an invertible function over $\mathbb{F}_p^2$ using a Dickson polynomial. Its structure yields a permutation particularly suited to hardware resource sharing and acceleration. Fully pipelined on FPGA, BenX matches the throughput of Poseidon2, with 1.36x and 2.15x lower latency for Goldilocks and BabyBear, respectively. Although larger as a standalone core, it makes more effective use of shared hardware: in our dual-mode architecture, where the NTT and hash share field multipliers, BenX keeps 100% of them busy, compared with 6.25-20.3% for the partial rounds of Poseidon and Poseidon2. In software, BenX outperforms Poseidon in all tested 31- and 64-bit configurations, but is slower than Poseidon2, except for the 16-element BabyBear instance. In zero-knowledge proofs, BenX proves Goldilocks permutations 6-10x faster than Monolith. Its compact arithmetization uses about 36% fewer trace cells than Poseidon and Poseidon2 over BabyBear, while its fast variant requires 1.3-2.6x the prover time of Poseidon2.

Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-09-28 in cs.CR).
Categorie arXiv: Cryptography and Security (cs.CR).
Pagina del lavoro: https://arxiv.org/abs/2609.31087 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T01:42:25.548Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-09-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).