2 citations · 2 across the 6 of their papers we have counts for
7 papers
Efficient computations in central simple algebras using Amitsur cohomology
Péter Kutas, Mickaël Montessinos
We present an efficient computational representation of central simple algebras using Brauer factor sets. Using this representation and polynomial quantum algorithms for number the…
Finding nontrivial zeros of quadratic forms over rational function fields of characteristic 2
Tímea Csahók, Péter Kutas, Mickaël Montessinos +1
We propose polynomial-time algorithms for finding nontrivial zeros of quadratic forms with four variables over rational function fields of characteristic 2. We apply these results…
Explicit isomorphisms of quaternion algebras over quadratic global fields
Tímea Csahók, Péter Kutas, Mickaël Montessinos +1
Let be a separable quadratic extension of either or . We propose efficient algorithms for finding isomorphisms between quaternion algebras over $L…
Algebraic conditions for additive functions over the reals and over finite fields
Péter Kutas
Let be an affine plane curve. We consider additive functions for which , whenever . We show that if and is the hy…
Explicit equivalence of quadratic forms over
Gábor Ivanyos, Péter Kutas, Lajos Rónyai
We propose a randomized polynomial time algorithm for computing nontrivial zeros of quadratic forms in 4 or more variables over , where is a finite…
Splitting quaternion algebras over quadratic number fields
Péter Kutas
We propose an algorithm for finding zero divisors in quaternion algebras over quadratic number fields, or equivalently, solving homogeneous quadratic equations in three variables o…
Computing explicit isomorphisms with full matrix algebras over
Gábor Ivanyos, Péter Kutas, Lajos Rónyai
We propose a polynomial time -algorithm (a deterministic algorithm which uses an oracle for factoring univariate polynomials over ) for computing an isomorphism (i…