Sciweavers

3819 search results - page 252 / 764
» Simple Easy Terms
Sort
View
LPAR
2005
Springer
16 years 22 days ago
Algebraic Intruder Deductions
Abstract. Many security protocols fundamentally depend on the algebraic properties of cryptographic operators. It is however difficult to handle these properties when formally anal...
David A. Basin, Sebastian Mödersheim, Luca Vi...
LPNMR
2005
Springer
16 years 22 days ago
An Algebraic Account of Modularity in ID-Logic
ID-logic uses ideas from the field of logic programming to extend second order logic with non-monotone inductive defintions. In this work, we reformulate the semantics of this lo...
Joost Vennekens, Marc Denecker
CAV
2004
Springer
120views Hardware» more  CAV 2004»
16 years 19 days ago
Termination of Linear Programs
We show that termination of a class of linear loop programs is decidable. Linear loop programs are discrete-time linear systems with a loop condition governing termination, that is...
Ashish Tiwari
CCS
2004
ACM
16 years 19 days ago
Cryptanalysis of a provably secure CRT-RSA algorithm
We study a countermeasure proposed to protect Chinese remainder theorem (CRT) computations for RSA against fault attacks. The scheme was claimed to be provably secure. However, we...
David Wagner
GECCO
2004
Springer
137views Optimization» more  GECCO 2004»
16 years 19 days ago
Modeling Coevolutionary Genetic Algorithms on Two-Bit Landscapes: Random Partnering
Abstract. A model of coevolutioinary genetic algorithms (COGA) consisting of two populations coevolving on two-bit landscapes is investigated in terms of the effects of random par...
Ming Chang, Kazuhiro Ohkura, Kanji Ueda, Masaharu ...