12 search results - page 1 / 3 » The number field sieve for integers of low weight |
MOC
2010
12 years 11 months ago
2010
We define the weight of an integer N to be the smallest w such that N can be represented as w i=1 i2ci , with 1,..., w{1,-1}. Since arithmetic modulo a prime of low weight is parti...
CHES
2007
Springer
13 years 11 months ago
2007
Springer
The hardness of the integer factorization problem assures the security of some public-key cryptosystems including RSA, and the number field sieve method (NFS), the most efficient ...
STOC
1990
ACM
13 years 9 months ago
1990
ACM
The number field sieve is an algorithm to factor integers of the form re
ITCC
2005
IEEE
13 years 10 months ago
2005
IEEE
Recently, efficient custom-hardware designs were proposed for the linear algebra step of the Number Field Sieve integer factoring algorithm. These designs make use of a heuristic ...
COCO
2010
Springer
13 years 8 months ago
2010
Springer
We give a “regularity lemma” for degree-d polynomial threshold functions (PTFs) over the Boolean cube {−1, 1}n . Roughly speaking, this result shows that every degree-d PTF ...