92 search results - page 7 / 19 » Generating Shorter Bases for Hard Random Lattices |
JOC
2002
14 years 9 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 ...
101
click to vote
ISSTA
2007
ACM
14 years 11 months ago
2007
ACM
Progress in testing requires that we evaluate the effectiveness of testing strategies on the basis of hard experimental evidence, not just intuition or a priori arguments. Random ...
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
This paper addresses the issue of social recommendation based on collaborative filtering (CF) algorithms. Social recommendation emphasizes utilizing various attributes informatio...
114
click to vote
PTS
2010
14 years 7 months ago
2010
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
77
Voted
DCC
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract. Braid cryptosystem was proposed in CRYPTO 2000 as an alternate public-key cryptosystem. The security of this system is based upon the conjugacy problem in braid groups. S...