Sciweavers

EUROCRYPT
2012
Springer
12 years 2 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...
ICCV
2011
IEEE
12 years 12 months ago
Optimal Estimation of Vanishing Points in a Manhattan World
In this paper, we present an analytical method for computing the globally optimal estimates of orthogonal vanishing points in a “Manhattan world” with a calibrated camera. We ...
Faraz Mirzaei, Stergios Roumeliotis
INFORMATICALT
2010
99views more  INFORMATICALT 2010»
13 years 10 months ago
Security Analysis of Asymmetric Cipher Protocol Based on Matrix Decomposition Problem
The asymmetric cipher protocol, based on decomposition problem in matrix semiring M over semiring of natural numbers N is presented. The security of presented cipher protocol is ba...
Andrius Raulynaitis, Eligijus Sakalauskas, Saulius...
JC
2000
138views more  JC 2000»
13 years 11 months ago
Multivariate Polynomials, Duality, and Structured Matrices
We rst review thebasic properties of the well knownclasses of Toeplitz, Hankel, Vandermonde, and other related structured matrices and reexamine their correlation to operations wi...
Bernard Mourrain, Victor Y. Pan
JSC
2008
162views more  JSC 2008»
13 years 11 months ago
Approximate factorization of multivariate polynomials using singular value decomposition
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
Erich Kaltofen, John P. May, Zhengfeng Yang, Lihon...
SODA
2003
ACM
143views Algorithms» more  SODA 2003»
14 years 1 months ago
Deterministic identity testing for multivariate polynomials
In this paper we present a simple deterministic algorithm for testing whether a multivariate polynomial f(x1, . . . , xn) is identically zero, in time polynomial in m, n, log(d + ...
Richard J. Lipton, Nisheeth K. Vishnoi
CC
2004
Springer
142views System Software» more  CC 2004»
14 years 5 months ago
A Symbolic Approach to Bernstein Expansion for Program Analysis and Optimization
Abstract. Several mathematical frameworks for static analysis of programs have been developed in the past decades. Although these tools are quite useful, they have still many limit...
Philippe Clauss, Irina Tchoupaeva