48 citations · 73 across the 5 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.CR2019
Breaking the Hidden Irreducible Polynomials Scheme
Christian Eder
In 2019 Gómez described a new public key cryptography scheme based on ideas from multivariate public key cryptography using hidden irreducible polynomials. We show that the scheme'…
math.QA2019★ 6 cited
Existence of quantum symmetries for graphs on up to seven vertices: a computer based approach
Christian Eder, Viktor Levandovskyy, Julien Schanz +3
The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined b…
math.AC2019
Efficient Gröbner Bases Computation over Principal Ideal Rings
Christian Eder, Tommy Hofmann
In this paper we present a new efficient variant to compute strong Gröbner basis over quotients of principal ideal domains. We show an easy lifting process which allows us to reduc…