Sciweavers

52 search results - page 2 / 11
» A Simple Algebraic Representation of Rijndael
Sort
View
MLQ
2002
83views more  MLQ 2002»
13 years 8 months ago
Pseudomonadic Algebras as Algebraic Models of Doxastic Modal Logic
We generalize the notion of a monadic algebra to that of a pseudomonadic algebra. In the same way as monadic algebras serve as algebraic models of epistemic modal system S5, pseudo...
Nick Bezhanishvili
ACISP
2006
Springer
14 years 2 months ago
On Exact Algebraic [Non-]Immunity of S-Boxes Based on Power Functions
In this paper we are interested in algebraic immunity of several well known highly-nonlinear vectorial Boolean functions (or Sboxes), designed for block and stream ciphers. Unfortu...
Nicolas Courtois, Blandine Debraize, Eric Garrido
DAGSTUHL
2007
13 years 10 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
COGSCI
2008
67views more  COGSCI 2008»
13 years 8 months ago
Trade-Offs Between Grounded and Abstract Representations: Evidence From Algebra Problem Solving
fs Between Grounded and Abstract Representations: Evidence From Algebra Problem Solving Kenneth R. Koedingera, Martha W. Alibalib, Mitchell J. Nathanc a Human
Kenneth R. Koedinger, Martha W. Alibali, Mitchell ...
CADE
2000
Springer
14 years 26 days ago
System Description: ARA - An Automatic Theorem Prover for Relation Algebras
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...
Carsten Sinz