Sciweavers

97 search results - page 19 / 20
» Finding roots of polynomials over finite fields
Sort
View
CORR
2008
Springer
162views Education» more  CORR 2008»
13 years 5 months ago
Compressed Modular Matrix Multiplication
Matrices of integers modulo a small prime can be compressed by storing several entries into a single machine word. Modular addition is performed by addition and possibly subtracti...
Jean-Guillaume Dumas, Laurent Fousse, Bruno Salvy
SGP
2007
13 years 8 months ago
Data-dependent MLS for faithful surface approximation
In this paper we present a high-fidelity surface approximation technique that aims at a faithful reconstruction of piecewise-smooth surfaces from a scattered point set. The presen...
Yaron Lipman, Daniel Cohen-Or, David Levin
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
14 years 6 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai
SIAMMAX
2010
104views more  SIAMMAX 2010»
13 years 7 days ago
The Legendre-Fenchel Conjugate of the Product of Two Positive Definite Quadratic Forms
It is well-known that the Legendre-Fenchel conjugate of a positive definite quadratic form can be explicitly expressed as another positive definite quadratic form, and that the con...
Yun-Bin Zhao
CORR
2010
Springer
192views Education» more  CORR 2010»
13 years 2 months ago
Constructing elliptic curve isogenies in quantum subexponential time
Given two elliptic curves over a finite field having the same cardinality and endomorphism ring, it is known that the curves admit an isogeny between them, but finding such an isog...
Andrew M. Childs, David Jao, Vladimir Soukharev