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 ...
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
The generation of multimodal virtual environments for surgical training is complicated by the necessity to develop heterogeneous simulation scenarios such as surgical incision, ca...
Suvranu De, Yi-Je Lim, Manivannan Muniyandi, Manda...
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...
Pierrick Gaudry, T. Houtmann, D. Kohel, Christophe...
Let Fq be the finite field of q elements, where q = ph. Let f(x) be a polynomial over Fq in n variables with m non-zero terms. Let N(f) denote the number of solutions of f(x) = 0 ...