Abstract
This paper presents a simple and structured symmetric-key block cipher called CHAIN which provides for variation in the block size, the key size, and the number of rounds of ciphering. This cipher performs encryption in three stages: mixing, permutation, and key-dependent substitution using the simple operations of XOR, table lookup, and substitution. The structure of CHAIN is byte-oriented, however the algorithm is designed in such a way that it can be expressed in a simple ‘compact form’ for efficient software or hardware implementation on platforms that support word sizes greater than 8 bits (such as on Intel's Pentium processor). Our C implementation of CHAIN with a 128-bit block size runs at 26 Mbits/Sec on a Pentium Pro 200 Mhz machine which is about 86% faster than RC5. Cryptanalysis of the algorithm indicates that it is very strong against the known attacks. It reaches the avalanche effect quite rapidly and provides very good resistance against linear and differential attacks.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.