87 search results - page 11 / 18 » On the Completeness of Attack Mutation Algorithms |
CRYPTO
2011
Springer
12 years 8 months ago
2011
Springer
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
FSE
2000
Springer
14 years 19 hour ago
2000
Springer
This paper presents an operational reconstruction technique of most stream ciphers. We primarily expose it for key-stream generators which consist of several linear feedback shift ...
CCS
2003
ACM
14 years 1 months ago
2003
ACM
Since IP packet reassembly requires resources, a denial of service attack can be mounted by swamping a receiver with IP fragments. In this paper we argue how this attack need not ...
ISQED
2010
IEEE
13 years 10 months ago
2010
IEEE
Recent studies have shown that an attacker can retrieve confidential information from cryptographic hardware (e.g. the secret key) by introducing internal faults. A secure and re...
SPAA
2009
ACM
14 years 9 months ago
2009
ACM
Denial of service (DoS) attacks are arguably one of the most cumbersome problems in the Internet. This paper presents a distributed information system (over a set of completely co...