Sciweavers

80 search results - page 5 / 16
» Efficient Multivariate Factorization over Finite Fields
Sort
View
ASIACRYPT
2006
Springer
13 years 11 months ago
The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography
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...
JAIR
1998
198views more  JAIR 1998»
13 years 7 months ago
Probabilistic Inference from Arbitrary Uncertainty using Mixtures of Factorized Generalized Gaussians
This paper presents a general and efficient framework for probabilistic inference and learning from arbitrary uncertain information. It exploits the calculation properties of fini...
Alberto Ruiz, Pedro E. López-de-Teruel, M. ...
ISSAC
2004
Springer
102views Mathematics» more  ISSAC 2004»
14 years 26 days ago
FFPACK: finite field linear algebra package
The FFLAS project has established that exact matrix multiplication over finite fields can be performed at the speed of the highly optimized numerical BLAS routines. Since many a...
Jean-Guillaume Dumas, Pascal Giorgi, Clémen...
EUROCRYPT
2012
Springer
11 years 10 months ago
Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
Abstract. The goal of this paper is to further study the index calculus method that was first introduced by Semaev for solving the ECDLP and later developed by Gaudry and Diem. In...
Jean-Charles Faugère, Ludovic Perret, Chris...
SODA
1992
ACM
90views Algorithms» more  SODA 1992»
13 years 8 months ago
Self-Testing Polynomial Functions Efficiently and Over Rational Domains
In this paper we give the first self-testers and checkers for polynomials over rational and integer domains. We also show significantly stronger bounds on the efficiency of a simp...
Ronitt Rubinfeld, Madhu Sudan