3 papers
cs.CR2024
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…
cs.CR2023
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 …