The paper discusses simple functional constraint networks and a value propagation method for program construction. Structural synthesis of programs is described as an example of d...
Abstract. We evaluate constructions for building pseudo-random functions (PRFs) from pseudo-random permutations (PRPs). We present two constructions: a slower construction which pr...
Chris Hall, David Wagner, John Kelsey, Bruce Schne...
Feistel ciphers are very common and very important in the design and analysis of blockciphers, especially due to four reasons: (1) Many (DES-like) ciphers are based on Feistel’s ...
Abstract. Viewing discrete-time causal linear systems as (Mealy) coalgebras, we describe their semantics, minimization and realisation as universal constructions, based on the fin...
Abstract. We present a general methodology for non-deterministic programming based on pure functional programming. We construct families of automata constructions which are used as...