Sign Up to like & get
recommendations!
1
Published in 2017 at "Foundations of Computational Mathematics"
DOI: 10.1007/s10208-016-9304-1
Abstract: We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order. Also, we show that the discrete…
read more here.
Keywords:
unity orders;
cryptology;
roots unity;