5 citations · 12 across the 6 of their papers we have counts for
6 papers
The Complexity of Algebraic Algorithms for LWE
Matthias Johann Steiner
Arora & Ge introduced a noise-free polynomial system to compute the secret of a Learning With Errors (LWE) instance via linearization. Albrecht et al. later utilized the Arora-Ge p…
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…
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 …
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…
Generalized Triangular Dynamical System: An Algebraic System for Constructing Cryptographic Permutations over Finite Fields
Arnab Roy, Matthias Johann Steiner
In recent years a new class of symmetric-key primitives over that are essential to Multi-Party Computation and Zero-Knowledge Proofs based protocols have emerged. To…
Schemes of Finite Expansion and Universally Closed Curves
Matthias Johann Steiner
In algebraic geometry there is a well-known categorical equivalence between the category of normal proper integral curves over a field and the category of finitely generated fi…