12 search results - page 2 / 3 » The number field sieve for integers of low weight |
CHES
2005
Springer
2005
Springer
Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization
14 years 1 months ago
Motivated by the goal of factoring large integers using the Number Field Sieve, several special-purpose hardware designs have been recently proposed for solving large sparse system...
FCCM
2005
IEEE
14 years 1 months ago
2005
IEEE
The security of the most popular asymmetric cryptographic scheme RSA depends on the hardness of factoring large numbers. The best known method for factorization large integers is ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
For several semirings S, two weighted finite automata with multiplicities in S are equivalent if and only if they can be connected by a chain of simulations. Such a semiring S is c...
AINA
2009
IEEE
14 years 2 months ago
2009
IEEE
— The current internet infrastructure is facing a number of limitations that is not suitable to meet the growing number of services and users. In particular, one aspect that requ...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...