Subscribe

Issue No.03 - March (2011 vol.60)

pp: 375-385

Debdeep Mukhopadhyay , Indian Institute of Technology, Kharagpur

Dipanwita RoyChowdhury , Indian Institute of Technology, Kharagpur

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2010.136

ABSTRACT

We present a scalable, modular, memoryless, and reconfigurable parallel architecture to generate cryptographically robust mappings, which are useful in the construction of stream and block ciphers. It has been theoretically proved that the proposed architecture can be reconfigured to generate a large number of mappings, all of which have high nonlinearity, satisfies Strict Avalanche Criterion (SAC) and is robust against linear and differential cryptanalysis. The architecture can be also used to optimize the resiliency and algebraic degree. The architecture has been found to scale easily to handle large number of input variables, which is an important criterion in realizing nonlinear combiners for stream ciphers using Boolean functions.

INDEX TERMS

Boolean functions, S-Box, stream cipher, cryptographic robustness, scalable architecture.

CITATION

Debdeep Mukhopadhyay, Dipanwita RoyChowdhury, "A Parallel Efficient Architecture for Large Cryptographically Robust n × k (k>n/2) Mappings",

*IEEE Transactions on Computers*, vol.60, no. 3, pp. 375-385, March 2011, doi:10.1109/TC.2010.136REFERENCES