1 citations · 1 across the 5 of their papers we have counts for
5 papers
Equivalent computational problems for superspecial abelian surfaces
Mickaël Montessinos
We show reductions and equivalences between various problems related to the computation of the endomorphism ring of principally polarised superspecial abelian surfaces. Problems co…
Algebraic algorithms for vector bundles over curves
Mickaël Montessinos
We represent vector bundles over a regular algebraic curve as pairs of lattices over the maximal orders of its function field and we give polynomial time algorithms for several tas…
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…