Sciweavers

583 search results - page 102 / 117
» On the Complexity of Matsui's Attack
Sort
View
JOC
2008
92views more  JOC 2008»
13 years 7 months ago
Cryptanalysis of an E0-like Combiner with Memory
In this paper, we study an E0-like combiner with memory as the keystream generator. First, we formulate a systematic and simple method to compute correlations of the FSM output seq...
Yi Lu 0002, Serge Vaudenay
DSS
2007
231views more  DSS 2007»
13 years 7 months ago
Self-healing systems - survey and synthesis
As modern software-based systems and applications gain in versatility and functionality, the ability to manage inconsistent resources and service disparate user requirements becom...
Debanjan Ghosh, Raj Sharman, H. Raghav Rao, Shambh...
ENTCS
2007
129views more  ENTCS 2007»
13 years 7 months ago
Protocol Composition Logic (PCL)
Protocol Composition Logic (PCL) is a logic for proving security properties of network protocols that use public and symmetric key cryptography. The logic is designed around a pro...
Anupam Datta, Ante Derek, John C. Mitchell, Arnab ...
TCSB
2008
13 years 7 months ago
Robustness to Code and Data Deletion in Autocatalytic Quines
Abstract. Software systems nowadays are becoming increasingly complex and vulnerable to all sorts of failures and attacks. There is a rising need for robust self-repairing systems ...
Thomas Meyer, Daniel Schreckling, Christian F. Tsc...
FUIN
2000
71views more  FUIN 2000»
13 years 7 months ago
The Nondeterministic Information Logic NIL is PSPACE-complete
The nondeterministic information logic NIL has been introduced by Orlowska and Pawlak in 1984 as a logic for reasoning about total information systems with the similarity, the forw...
Stéphane Demri