Abstract
Let be a separable quadratic extension of either or . We propose efficient algorithms for finding isomorphisms between quaternion algebras over . Our techniques are based on computing maximal one-sided ideals of the corestriction of a central simple -algebra.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.