Sciweavers

351 search results - page 6 / 71
» Algebra and Geometry of Rewriting
Sort
View
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
14 years 3 months ago
Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers
Recently proposed algebraic attacks [2, 6] and fast algebraic attacks [1, 5] have provided the best analyses against some deployed LFSR-based ciphers. The process complexity is exp...
Philip Hawkes, Gregory G. Rose
RELMICS
1997
Springer
14 years 2 months ago
Relational Matching for Graphical Calculi of Relations
In this paper we extend an earlierapproach to graphicalrelationcalculitowards relational matching, thus allowing proofs with fewer auxiliary steps and concentrating more on the es...
Wolfram Kahl
ENTCS
2007
128views more  ENTCS 2007»
13 years 10 months ago
Rewriting-Based Access Control Policies
In this paper we propose a formalization of access control policies based on term rewriting. The state of the system to which policies are enforced is represented as an algebraic ...
Anderson Santana de Oliveira
FOCM
2006
76views more  FOCM 2006»
13 years 10 months ago
The Hopf Algebra of Rooted Trees, Free Lie Algebras, and Lie Series
We present an approach that allows performing computations related to the Baker-Campbell-Haussdorff (BCH) formula and its generalizations in an arbitrary Hall basis, using labeled...
A. Murua
KBSE
2000
IEEE
14 years 2 months ago
Circular Coinductive Rewriting
Circular coinductive rewriting is a new method for proving behavioral properties, that combines behavioral rewriting with circular coinduction. This method is implemented in our n...
Joseph A. Goguen, Kai Lin, Grigore Rosu