Sciweavers

104 search results - page 7 / 21
» On a special class of primitive words
Sort
View
MYCRYPT
2005
Springer
187views Cryptology» more  MYCRYPT 2005»
14 years 26 days ago
Distinguishing Attacks on T-Functions
Klimov and Shamir proposed a new class of simple cryptographic primitives named T-functions. For two concrete proposals based on the squaring operation, a single word T-function an...
Simon Künzli 0002, Pascal Junod, Willi Meier
TARK
2007
Springer
14 years 1 months ago
Preservation of epistemic properties in security protocol implementations
We introduce (i) a general class of security protocols with private channel as cryptographic primitive and (ii) a probabilistic epistemic logic to express properties of security pr...
Ron van der Meyden, Thomas Wilke
VTS
2002
IEEE
113views Hardware» more  VTS 2002»
14 years 8 days ago
Testing Static and Dynamic Faults in Random Access Memories
The ever increasing trend to reduce DPM levels of memories requires tests with very high fault coverages. The very important class of dynamic fault, therefore cannot be ignored an...
Said Hamdioui, Zaid Al-Ars, A. J. van de Goor
ICALP
2011
Springer
12 years 10 months ago
Compact Navigation and Distance Oracles for Graphs with Small Treewidth
Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to bui...
Arash Farzan, Shahin Kamali
ARSCOM
2005
106views more  ARSCOM 2005»
13 years 7 months ago
Chromatic Equivalence of Generalized Ladder Graphs
A class of graphs called generalized ladder graphs is defined. A sufficient condition for pairs of these graphs to be chromatically equivalent is proven. In addition a formula for...
Stephen Guattery, Gary Haggard, Ronald C. Read