Computing square roots in quaternion algebras
arXiv:2301.007431.21 citationsh-index: 6
Originality Incremental advance
AI Analysis
It solves a fundamental computational problem in quaternion algebras, which is relevant for number theorists and cryptographers working with these structures.
The paper presents an explicit algorithm for computing square roots in quaternion algebras over global fields of characteristic not 2, providing a constructive solution to a previously open problem.
We present an explicit algorithmic method for computing square roots in quaternion algebras over global fields of characteristic different from 2.