Leveraging smaller finite fields for more efficient ZK-friendly hash functions
From MaRDI portal
Cites work
- Cryptographically significant MDS matrices over finite fields: a brief survey and some generalized results
- FOAM: searching for hardware-optimal SPN structures and components with a fair comparison
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 607286 (Why is no real title available?)
- Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\)
- Introduction to Coding Theory
- Keccak
- Lightweight MDS generalized circulant matrices
- Lightweight MDS involution matrices
- Logic minimization techniques with applications to cryptology
- MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
- Nonlinear diffusion layers
- Novel polynomial basis and its application to Reed-Solomon erasure codes
- On generator matrices of MDS codes (Corresp.)
- On MDS codes via Cauchy matrices
- On the Shortest Linear Straight-Line Program for Computing Linear Forms
- Polynomial Codes Over Certain Finite Fields
- Small low-depth circuits for cryptographic applications
- The design of Rijndael. The Advanced Encryption Standard (AES)
- Whirlwind: a new cryptographic hash function
This page was built for publication: Leveraging smaller finite fields for more efficient ZK-friendly hash functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7319803)
