Sciweavers

3333 search results - page 225 / 667
» Abstract Proof Search
Sort
View
AAECC
2007
Springer
105views Algorithms» more  AAECC 2007»
15 years 11 months ago
On Non-randomness of the Permutation After RC4 Key Scheduling
Abstract. Here we study a weakness of the RC4 Key Scheduling Algorithm (KSA) that has already been noted by Mantin and Mironov. Consider the RC4 permutation S of N (usually 256) by...
Goutam Paul, Subhamoy Maitra, Rohit Srivastava
ESORICS
2007
Springer
15 years 11 months ago
Adaptive Soundness of Static Equivalence
Abstract. We define a framework to reason about implementations of equational theories in the presence of an adaptive adversary. We particularly focus on soundess of static equiva...
Steve Kremer, Laurent Mazaré
ISAAC
2007
Springer
124views Algorithms» more  ISAAC 2007»
15 years 11 months ago
Approximating the Crossing Number of Toroidal Graphs
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
Petr Hlinený, Gelasio Salazar
TGC
2007
Springer
15 years 11 months ago
Elimination of Ghost Variables in Program Logics
Abstract. Ghost variables are assignable variables that appear in program annotations but do not correspond to physical entities. They are used to facilitate specification and ver...
Martin Hofmann, Mariela Pavlova
GMP
2006
IEEE
102views Solid Modeling» more  GMP 2006»
15 years 11 months ago
Representing Topological Structures Using Cell-Chains
Abstract. A new topological representation of surfaces in higher dimensions, “cell-chains” is developed. The representation is a generalization of Brisson’s cell-tuple data s...
David E. Cardoze, Gary L. Miller, Todd Phillips