Sciweavers

583 search results - page 97 / 117
» On the Complexity of Matsui's Attack
Sort
View
ASIACRYPT
2005
Springer
14 years 27 days ago
Fast Computation of Large Distributions and Its Cryptographic Applications
Let X1, X2, . . . , Xk be independent n bit random variables. If they have arbitrary distributions, we show how to compute distributions like Pr{X1 ⊕ X2 ⊕ · · · ⊕ Xk} and ...
Alexander Maximov, Thomas Johansson
RTA
2005
Springer
14 years 25 days ago
Intruder Deduction for AC-Like Equational Theories with Homomorphisms
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
Pascal Lafourcade, Denis Lugiez, Ralf Treinen
ISI
2004
Springer
14 years 21 days ago
Aligning Simulation Models of Smallpox Outbreaks
We aligned two fundamentally different models of smallpox transmission after a bioterrorist attack: A location-explicit multi-agent model (BioWar) and the conventional epidemiologi...
Li-Chiou Chen, Boris Kaminsky, Tiffany Tummino, Ka...
SETA
2004
Springer
79views Mathematics» more  SETA 2004»
14 years 21 days ago
A Survey of the Merit Factor Problem for Binary Sequences
A classical problem of digital sequence design, first studied in the 1950s but still not well understood, is to determine those binary sequences whose aperiodic autocorrelations ...
Jonathan Jedwab
EUROSEC
2010
ACM
14 years 19 days ago
Managing intrusion detection rule sets
The prevalent use of the signature-based approach in modern intrusion detection systems (IDS) emphasizes the importance of the efficient management of the employed signature sets....
Natalia Stakhanova, Ali A. Ghorbani