Sciweavers

36781 search results - page 90 / 7357
» Parameterizing by the Number of Numbers
Sort
View
CHES
2000
Springer
114views Cryptology» more  CHES 2000»
14 years 1 months ago
Efficient Generation of Prime Numbers
The generation of prime numbers underlies the use of most public-key schemes, essentially as a major primitive needed for the creation of key pairs or as a computation stage appear...
Marc Joye, Pascal Paillier, Serge Vaudenay
FPGA
2000
ACM
128views FPGA» more  FPGA 2000»
14 years 1 months ago
Factoring large numbers with programmable hardware
The fastest known algorithms for factoring large numbers share a core sieving technique. The sieving cores find numbers that are completely factored over a prime base set raised t...
Hea Joung Kim, William H. Mangione-Smith
CSC
2006
13 years 11 months ago
On the Number of Minimal Addition Chains
An addition chain for a natural number n is a sequence 1 = a0 < a1 < . . . < ar = n of numbers such that for each 0 < i r, ai = aj + ak for some 0 k j < i. Thurbe...
Hatem M. Bahig
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
13 years 11 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
EM
2010
121views Management» more  EM 2010»
13 years 10 months ago
Self-Intersection Numbers of Curves on the Punctured Torus
On the punctured torus the number of essential self-intersections of a homotopy class of closed curves is bounded (sharply) by a quadratic function of its combinatorial length (th...
Moira Chas, Anthony Phillips