57 search results - page 10 / 12 » Invisible Genericity and 0 |
120
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We study the complexity of computing the real solutions of a bivariate polynomial system using the recently proposed algorithm Bisolve [3]. Bisolve is a classical elimination metho...
163
Voted
JOC
2010
14 years 10 months ago
2010
Let g be an element of prime order p in an abelian group and let Zp. We show that if g, g , and gd are given for a positive divisor d of p - 1, the secret key can be computed de...
146
Voted
ICCAD
2002
IEEE
16 years 17 days ago
2002
IEEE
In this survey, we outline basic SAT- and ATPGprocedures as well as their applications in formal hardware verification. We attempt to give the reader a trace trough literature and...
140
Voted
RFIDSEC
2010
15 years 2 months ago
2010
Abstract. In this paper, we classify the RFID distance bounding protocols having bitwise fast phases and no final signature. We also give the theoretical security bounds for two s...
134
Voted
ICDCN
2010
Springer
15 years 10 months ago
2010
Springer
Pease et al. introduced the problem of Byzantine Generals (BGP) to study the effects of Byzantine faults in distributed protocols for reliable broadcast. It is well known that BG...