Algebraic attacks over GF(q)

Recent algebraic attacks on LFSR-based stream ciphers and S-boxes have generated much interest as they appear to be extremely powerful. Theoretical work has been developed focusing around the Boo- lean function case. In this paper, we generalize this theory to arbitrary finite fields and extend the theory of annihilators and ideals introduced at Eurocrypt 2004 by Meier, Pasalic and Carlet. In particular, we prove that for any function f in the multivariate polynomial ring over GF(q), f has a low degree multiple precisely when two low degree functions appear in the same coset of the annihilator of f ^{q – 1} – 1. In this case, many such low degree multiples exist.

Simulation-based support tool for operator performance in batch manufacturing

In industry, the workload and utilization of shop floor operators is often misunderstood. In this paper, we will present several real case studies, using Discrete Event Simulation (DES) models, which allow us to better understand operators in a batch manufacturing environment. The first study investigates labour in a machining plant consisting of multiple identical CNC machines that batch produce parts. The second study investigates labour in an eight station, gravity die casting rotary table. The results from these studies have shown that there can be potential improvements made by the production planners in the current labour configuration. In the first case study, a matrix is produced that estimates what the operator's utilization levels will be for various configurations. From this, the preferred operator to machine ratio over a range of cycle times is presented. In the second study, the results have shown that by reducing the casting cycle time, the operator would be overloaded. A discrete event simulation of these two cases highlighted areas that were misunderstood by plant management, and provided them with a useful decision support tool for production planning.