20175 search results - page 4 / 4035 » Is abstraction the key to computing |
ICPR
2002
IEEE
16 years 1 months ago
2002
IEEE
bstraction of Wildlife Footage using Gaussian Mixture Models and the Minimum Description Length Criterion David Gibson Neill Campbell Barry Thomas Department of Computer Science Un...
ESORICS
2006
Springer
15 years 4 months ago
2006
Springer
Abstract We present a computational analysis of basic Kerberos with and without its public-key extension PKINIT in which we consider authentication and key secrecy properties. Our ...
64
Voted
IMA
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. The key agreement protocol are either based on some computational infeasability, such as the calculus of the discrete logarithm in [1], or on theoretical impossibility un...
129
click to vote
IH
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. A physically unclonable function (PUF) is a multiple-input, multipleoutput, large entropy physical system that is unreproducible due to its structural complexity. A publi...
90
Voted
ASIACRYPT
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. GPUs offer a tremendous amount of computational bandwidth that was until now largely unusable for cryptographic computations due to a lack of integer arithmetic and user...