New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
Let K be a totally real algebraic number field and O an order in a quaternion algebra A over K. Assume that the group O1 of units in O with reduced norm equal to 1 is embedded into...
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...
Simon Colton, Andreas Meier, Volker Sorge, Roy L. ...
We give an overview on twisting commutative algebraic groups and applications to discrete log based cryptography. We explain how discrete log based cryptography over extension fie...