65 search results - page 11 / 13 » On the Randomness of Bits Generated by Sufficiently Smooth F... |
DCC
2003
IEEE
14 years 7 months ago
2003
IEEE
Nguyen and Shparlinski recently presented a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each s...
JOC
2002
13 years 7 months ago
2002
We present a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each signature generation) are known ...
BMCBI
2007
13 years 7 months ago
2007
Background: The availability of microarrays measuring thousands of genes simultaneously across hundreds of biological conditions represents an opportunity to understand both indiv...
CVPR
2007
IEEE
14 years 1 months ago
2007
IEEE
Image matting is the problem of determining for each pixel in an image whether it is foreground, background, or the mixing parameter, ”alpha”, for those pixels that are a mixt...
SIGGRAPH
2010
ACM
13 years 11 months ago
2010
ACM
In this paper, we introduce a compact random-access vector representation for solid textures made of intermixed regions with relatively smooth internal color variations. It is fea...