Sciweavers

70 search results - page 2 / 14
» Tractability Results in the Block Algebra
Sort
View
DAGSTUHL
2007
14 years 11 months ago
How Fast can be Algebraic Attacks on Block Ciphers?
In this paper we give a specification of a new block cipher that can be called the Courtois Toy Cipher (CTC). It is quite simple, and yet very much like any other known block ciph...
Nicolas Courtois
INDOCRYPT
2010
Springer
14 years 8 months ago
Algebraic, AIDA/Cube and Side Channel Analysis of KATAN Family of Block Ciphers
Abstract. This paper presents the first results on AIDA/cube, algebraic and sidechannel attacks on variable number of rounds of all members of the KATAN family of block ciphers. Ou...
Gregory V. Bard, Nicolas Courtois, Jorge Nakahara,...
KI
2005
Springer
15 years 3 months ago
Dependency Calculus: Reasoning in a General Point Relation Algebra
The point algebra is a fundamental formal calculus for spatial and temporal reasoning. We present a new generalization that meets all requirements to describe dependencies on netw...
Marco Ragni, Alexander Scivos
TSP
2008
179views more  TSP 2008»
14 years 10 months ago
Estimation in Gaussian Graphical Models Using Tractable Subgraphs: A Walk-Sum Analysis
Graphical models provide a powerful formalism for statistical signal processing. Due to their sophisticated modeling capabilities, they have found applications in a variety of fie...
V. Chandrasekaran, Jason K. Johnson, Alan S. Wills...
FOCS
2002
IEEE
15 years 3 months ago
A Dichotomy Theorem for Constraints on a Three-Element Set
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
Andrei A. Bulatov