5 citations · 12 across the 6 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.CR2023★ 4 cited
Solving Degree Bounds For Iterated Polynomial Systems
Matthias Johann Steiner
For Arithmetization-Oriented ciphers and hash functions Gröbner basis attacks are generally considered as the most competitive attack vector. Unfortunately, the complexity of Gröbn…
math.NT2023
A Degree Bound For The c-Boomerang Uniformity Of Permutation Monomials
Matthias Johann Steiner
Let be a finite field of characteristic . In this paper we prove that the -Boomerang Uniformity, , for all permutation monomials , where …
cs.CR2023★ 3 cited
Arion: Arithmetization-Oriented Permutation and Hashing from Generalized Triangular Dynamical Systems
Arnab Roy, Matthias Johann Steiner, Stefano Trevisani
In this paper we propose the (keyed) permutation Arion and the hash function ArionHash over for odd and particularly large primes. The design of Arion is based on th…