No abstract

No abstract

No abstract

Abstract. Non-linear functions are very essential in different crypto primitives as they increase the security of the cipher designs. On the other hand, maximum length sequences help to prevent repeatability of a pseudorandom generator. Linear functions such as LFSR and linear cellular automata are used to generate maximum length sequences. However linear maximum length sequences are not secure. So there is a necessity of a construction that can provide both non-linearity and maximum length sequence for optimized cipher designs. In this work, we propose an algorithm for synthesizing a maximum length non-linear cellular automata to fulfill the requirement. Extensive experimentation on the proposed scheme shows that the construction achieves high non-linearity. Moreover, we have implemented and tested the design in Xilinx Spartan-3 FPGA platform and the hardware overhead is shown to be nominal.

Abstract. We present a Message Authentication Code (MAC) with integrated error correction capability, called AEC. The MAC itself can detect/correct errors upto a certain limit and provides an estimate of the number and location of the errors. The security of AEC lies in the random selection of the underlying error correcting code (ECC). In this work, we propose a new on-the-fly solution to this problem of random ECC selection, making it highly secure. Moreover, this solution combined with the simple and regular structure of Cellular Automata (CA) based ECC, makes it highly suitable for efficient hardware implementation. Detailed FPGA implementations of both standalone and compact variants of AEC, are presented on the Spartan-3 FPGA platform. The compact implementation has low area footprint and high throughput making it particularly suitable for resource constrained applications. To the best of our knowledge this is the only practical design of an ECC-MAC scheme.