This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
We provide algorithms to count and enumerate representatives of the (right) ideal classes of an Eichler order in a quaternion algebra defined over a number field. We analyze the ...
Abstract. The distribution of ideal class groups of Fq(T, M(T)) is examined for degree-four monic polynomials M Fq[T] when Fq is a finite field of characteristic greater than 3 wi...
We present a chosen-ciphertext attack against both NICE cryptosystems. These two cryptosystems are based on computations in the class group of non-maximal imaginary orders. More pr...
We introduce a new cryptosystem with trapdoor decryption based on the di culty of computing discrete logarithms in the class group of the non-maximal imaginary quadratic order O q ...
We present a technique to recover f ∈ Q(ζp) where ζp is a primitive pth root of unity for a prime p, given its norm g = f ∗ ¯f in the totally real field Q(ζp + ζ−1 p )....
Computing the unit group and class group of a number field are two of the main tasks in computational algebraic number theory. Factoring integers reduces to solving Pell's eq...