738 search results - page 112 / 148 » cases 2001 |
EUROCRYPT
2001
Springer
15 years 2 months ago
2001
Springer
The use of elliptic curves in cryptography relies on the ability to count the number of points on a given curve. Before 1999, the SEA algorithm was the only efficient method known ...
EUROCRYPT
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We present a new algorithm for upper bounding the maximum average linear hull probability for SPNs, a value required to determine provable security against linear cryptan...
81
Voted
FM
2001
Springer
15 years 2 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
GCSE
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. The C++ language has only a limited runtime type information system, which doesn’t provide full reflection capabilities. We present a general mechanism to support refle...
GD
2001
Springer
15 years 2 months ago
2001
Springer
We prove that every tree T = (V, E) on n vertices with edges of unit length can be embedded in the plane with distortion O( √ n); that is, we construct a mapping f: V → R2 suc...