2629 search results - page 106 / 526 » complex 2009 |
103
Voted
ASIACRYPT
2009
Springer
15 years 7 months ago
2009
Springer
In this paper we present two related-key attacks on the full AES. For AES-256 we show the first key recovery attack that works for all the keys and has 299.5 time and data complex...
100
click to vote
WEBI
2009
Springer
15 years 7 months ago
2009
Springer
Abstract—Measuring Inconsistency in ontologies is an important topic in ontology engineering as it can provide extra information for dealing with inconsistency. Many approaches h...
CDVE
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Existing tools for supporting parallel work feature some disadvantages that prevent them to be widely used. Very often they require a complex installation and creation of...
99
Voted
COCO
2009
Springer
15 years 7 months ago
2009
Springer
Starting with Kilian (STOC ‘92), several works have shown how to use probabilistically checkable proofs (PCPs) and cryptographic primitives such as collision-resistant hashing to...
103
click to vote
CSR
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In 1992, A. Hiltgen [1] provided the first constructions of provably (slightly) secure cryptographic primitives, namely feebly one-way functions. These functions are pro...