[Resource Topic] 2024/633: Vision Mark-32: ZK-Friendly Hash Function Over Binary Tower Fields

Welcome to the resource topic for 2024/633

Title:
Vision Mark-32: ZK-Friendly Hash Function Over Binary Tower Fields

Authors: Tomer Ashur, Mohammad Mahzoun, Jim Posen, Danilo Šijačić

Abstract:

Zero-knowledge proof systems are widely used in different applications on the Internet.
Among zero-knowledge proof systems, SNARKs are a popular choice because of their fast verification time and small proof size.
The efficiency of zero-knowledge systems is crucial for usability, resulting in the development of so-called arithmetization-oriented ciphers.
In this work, we introduce Vision Mark-32, a modified instance of Vision defined over binary tower fields, with an optimized number of rounds and an efficient MDS matrix.
We implement a fully-pipelined Vision Mark-32 permutation on Alveo U55C FPGA accelerator card and argue an order of magnitude better hardware efficiency compared to the popular Poseidon hash.
Our fully-pipelined Vision Mark-32 implementation runs at 250 MHz and uses 398 kLUT and 104 kFF.
Lastly, we delineate how to implement each step efficiently in hardware.

ePrint: https://eprint.iacr.org/2024/633

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .