Computing supersingular endomorphism rings using inseparable endomorphisms
J Fuselier, A Iezzi, M Kozek, T Morrison… - arXiv preprint arXiv …, 2023 - arxiv.org
We give an algorithm for computing inseparable endomorphisms of a supersingular elliptic
curve $ E $ defined over $\mathbb F_ {p^ 2} $, which, conditional on GRH, runs in expected …
curve $ E $ defined over $\mathbb F_ {p^ 2} $, which, conditional on GRH, runs in expected …
Efficient computations in central simple algebras using Amitsur cohomology
P Kutas, M Montessinos - Journal of Algebra, 2025 - Elsevier
We introduce a presentation for central simple algebras over a field k using Amitsur
cohomology. We provide efficient algorithms for computing a cocycle corresponding to any …
cohomology. We provide efficient algorithms for computing a cocycle corresponding to any …
A polynomial quantum algorithm for the explicit isomorphism problem
P Kutas, M Montessinos - arXiv preprint arXiv:2307.00261, 2023 - arxiv.org
We present an efficient computational representation of central simple algebras using
Brauer factor sets. Using this representation and polynomial quantum algorithms for number …
Brauer factor sets. Using this representation and polynomial quantum algorithms for number …
Finding Nontrivial Zeros of Quadratic Forms over Rational Function Fields of Characteristic 2
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 to find …
four variables over rational function fields of characteristic 2. We apply these results to find …