Sciweavers

3443 search results - page 118 / 689
» More Algebras for Determiners
Sort
View
MFCS
2005
Springer
14 years 2 months ago
Regular Sets of Higher-Order Pushdown Stacks
Abstract. It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pu...
Arnaud Carayol
SACRYPT
2005
Springer
138views Cryptology» more  SACRYPT 2005»
14 years 2 months ago
On the (Im)Possibility of Practical and Secure Nonlinear Filters and Combiners
A vast amount of literature on stream ciphers is directed to the cryptanalysis of LFSR-based filters and combiners, resulting in various attack models such as distinguishing attac...
An Braeken, Joseph Lano
ISAAC
2004
Springer
87views Algorithms» more  ISAAC 2004»
14 years 2 months ago
Random Access to Advice Strings and Collapsing Results
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
Jin-yi Cai, Osamu Watanabe
FSE
2003
Springer
228views Cryptology» more  FSE 2003»
14 years 2 months ago
Further Observations on the Structure of the AES Algorithm
We present our further observations on the structure of the AES algorithm relating to the cyclic properties of the functions used in this cipher. We note that the maximal period of...
Beomsik Song, Jennifer Seberry
OOPSLA
2001
Springer
14 years 1 months ago
The Java Syntactic Extender
The ability to extend a language with new syntactic forms is a powerful tool. A sufficiently flexible macro system allows programmers to build from a common base towards a langua...
Jonathan Bachrach, Keith Playford