Modern Block Cipher Algorithms in Cryptography

Cryptography signifies that which is concealed or hidden. It is writing or a description in a brief manner that secretly conveys a particular intelligence or words that we may wish to communicate. Cryptography may be used as a form of clandestine communication. The art of cryptography is a legitimate form of communication that is acknowledged in the world.

Encryption is a process that uses an encryption algorithm to convert a message from plaintext into ciphertext, making the message unreadable to a third party. Block ciphers operate by breaking a message into fixed block sized messages which are encrypted using the same key. The advantage with block ciphers is that a smaller block can be created from a large message.

DES (Data Encryption Standard)

Data Encryption Standard is basically a symmetric-key algorithm used in the encryption of data of electronic nature. The algorithm was developed in the 1970s by IBM as an improvement of the earlier version by Horst Fesitel. The modified version was approved by the National Bureau of Standards in consultation with the National Security Agency. The original DES was improved through strengthening against differential cryptanalysis.

DES is a block cipher that transforms a fixed-length plaintext into a cipher text bit string using a key to customize the process to enable protected decryption by individuals with knowledge on the key used in encryption. Usage of DES can only be done safely in the mode of operation. The algorithm is exposed to a brute-force approach attach. However, the level of exposure is minimal since the intruder must know a series of specified chosen plaintexts.

DES has certification weaknesses and exposed to other attacks such as linear cryptanalysis, differential cryptanalysis, and Davies’ attack. DES is relatively insecure due to its 56-bit size, which is small. In fact, the Electronic Frontier Foundation in collaboration with the distributed.net managed to break the DES key in less than 24 hours in 1999.

Moreover, a series of analytical results have demonstrated theoretical weaknesses in DES cipher. DES was used as a federal standard for unclassified data. It usage has spanned more than 30 years with the latest version called the Triple DES being approved for sensitive information by the government up to the year 2030.

Triple DES

Triple DES was first published in 1998 as an improvement of DES. The cipher components include block sizes of 64 bits and key sizes of 112, 168 or 56 bits. The structure of Triple DES is Fesitel network and has 48 DES-equivalent rounds. This algorithm provides three keying options with a key length of 160 bits. The three layers make Triple DES secure and more stable. However, it can only provide an effective security of 112 bits. Triple DES is generally exposed to known-plaintext and chosen-plaintext attacks. Triple DES is used in the electronic payment sector to promulgate and develop standards such as EMV. For instance, Microsoft Outlook 2007, Microsoft Configuration Manager 2012, and Microsoft OneNote use this algorithm to password guard system data and user content.

RIJNDAEL/AES

AES is a specification used in the encryption of electronic data. The algorithm was adopted in the US in 2001 by the National Institute of Standards and Technology. It is basically a sub-set of the Rijndael cipher developed by two cryptographers called Joan Daemen and Vincent Rijmen in 1998. The algorithm has been accepted by the government of the US and other parts of the world.

AES comes in different packages. It is derived from square and has NSA, NESSIE, AES winner, and CRYPTREC certifications. The key sizes are 128, 192, and 256 bits. Its block sizes are 128 bits. The algorithm has substitution-permutation structure network and has 10, 12, and 14 rounds, which are dependent on the key size. AES is exposed to side-channel attacks. However, the 10 to 14 rounds make AES less vulnerable. AES is used by the US government for non-classified documents protection.

MARS

Created in 1991 by Jerome Friedman, MARS is a non-parametric technique for regression and often seen as a linear model extension capable of automatically modeling nonlinearities between variables. Model building using MARS occurs in forward and backward pass phases. This makes it easy to use and enable a user to integrate multiple variables at any time. MARS is also very flexible compared to other linear regression models. However, the user is limited in the number of variables to use in the forward pass phase. Moreover, it only permits one of two interaction degrees. The algorithm is used in regression analysis.

RC5

RC5 is a simple cipher of symmetrical-key block nature created in 1994 by Ronald Rivest. Its successors are Akelarre and RC6. RC5’s key sizes are from 0 to 2040 bits while the block sizes are 32, 64, and 128 bits. The structure of RC5 is Fesitel-like network and has 1 to 255 rounds. This makes the algorithm relatively stronger since encryption involves many rounds, depending on the level of needed security. However, the 12-round RC5 is vulnerable to differential attacks when 244 is used as the chosen plaintexts.

RC6

First published in 1998, RC6 was designed and developed by Matt Robshaw, Ron Rivest, Yiqun Lisa Yin, and Ray Sidney. This algorithm is derived from RC5 and has AES finalist certification. The cipher key sizes are 128, 192, and 256 bits while its block sizes are 128 bits. RC6 has 20 rounds and functions on type 2 Feistel network. RC6 is used in NSA implants. For instance, in 2016, the Equation Group revealed several codes used in network security that uses RC6 for communication confidentiality. The multilayer in each round makes this cipher strong and relatively stable. However, RC6 is also exposed to differential attacks as its predecessor.

Serpent

First published in 1998, Serpent is a symmetric cipher designed and developed by Lars Kudsen, Eli Biham, and Ross Anderson. Serpent is derived from Square and has AES finalist certification. Its key sizes are 128, 192, or 256 bits while block sizes are 128 bits. The structure of Serpent is substitution-permutation network and comes with 32 rounds. The numerous public attack trials have not succeeded to penetrate the full-32 rounds cipher. Trial attacks in 2011 only managed to break 11 rounds. This makes this cipher secure and relatively predictable. However, an effective XSL attack might weaken Serpent. This cipher is available for public use since there are no encumbrances with regards to user restrictions.

Blowfish

Blowfish is also a symmetric-key block cipher that was designed and created by Bruce Schneier in 1993. This cipher is known to provide a stable encryption in software. Since its creation, there has never been am effective cryptanalysis. Blowfish is multi-purpose algorithm that improves on the challenges of DES. Since it is unpatented, the cipher is available for use across the globe in the public domain. Its successor is Twofish.

Blowfish’s key sizes are from 32 to 448 bits and block sizes are 64 bits. The cipher has 16 rounds and functions on Feistel network. This makes the cipher difficult to penetrate. However, the first four rounds of Blowfish are vulnerable to differential attack of second order. Moreover, the 64-bit size makes this cipher susceptible to birthday attacks, especially in HTTPS context.

Twofish

Also designed and created by Bruce Schneier in 1998, Twofish is a symmetric-key block cipher derived from Square, SAFER, and Blowfish. This cipher is related to Threefish and has AES finalist certification. Its key sizes are 128, 192 or 256 bits while block sizes are 128 bits. Twofish has sixteen rounds and structured in Feistel network, which makes its secure as the multilayer keys are difficult to penetrate. Its distinctive features have made this cipher a complex key schedule to integrate the Maximum Distance Separable matrix. Twofish is available in public domain. This cipher is exposed to impossible differential attack, which is capable of breaking the first six rounds.

Threefish

Threefish was first published in 2008 and developed by Bruce Schneier, Jesse Walker, Doug Whiting and others. This cipher is related to Blowfish and Twofish. Its key sizes are 256, 512, and 1024 bits and block sizes are 72 bits. Threefish has a speed of 6.1 cpb on core 2. This cipher has a mix function and permutation steps change position of texts according to preset constant pattern. This makes Threefish secure. However, it is exposed to rebound attack, which affects its Skein hash function as established in 2010. Moreover, Threefish is susceptible to bommerang attack, especially for its 32-round version.

IDEA

First published in 1991 and designed by James Massey and Xuejia Lai, IDEA is a symmetric-key block cipher created as a replacement of DES. The design was sponsored by the Hasler Foundation and is currently available freely for non-commercial usage. This cipher has been used in the BassOmatic, Pretty Good Privacy and is available optional Open PGP algorithm standard. IDEA’s successors are MESH, MMB, IDEA NXT, and Akelarre.

Its key and block sizes are 128 bits and 64 bits, respectively. IDEA has 8.5 rounds and Lai-Massey scheme structure. The differential cryptanalysis by its designers revealed that IDEA is immune algebraic or linear weaknesses. A trial in 2013 to recover the key revealed that IDEA is vulnerable to computational complexity attack with the use of narrow bicliques. Moreover, IDEA’s simple key structure makes it to generate weak encryption.

CAST-128

First published in 1996, CAST-128 was designed by Stafford Tavares and Carlisle Adams as a symmetric-key block cipher. It has been used in different products as the primary default cipher in PGP and GPG. CAST-128 successor is CAST-256 and has 12 or 16 rounds. The key and block sizes are 40 to 128 bits and 64 bits, respectively. This makes the algorithm secure and easy to integrate. However, it is susceptible to differential and Brute-force attacks.

CAST-256

First published in 1998, CAST-256 is a symmetric-key block cipher as a replacement of AES. However, it did not make it to the final list of preferred algorithms. It is derived from CAST-128 and has 48 rounds. CAST-256 structure is generalized type 1 Feistel network and has key sizes of 128, 160, 192, 224, and 256 bits. Its block sizes are 128 bits. The many rounds make this cipher safe and secure. However, it is known to be vulnerable to zero-correlation cryptanalysis using a secret key.

Camellia

First published in 2000, Camellia is derived from E2 and MISTY1. This cipher was designed by Mitsubishi Electronic in collaboration with NTT and has NESSIE and CRYPTREC certifications. The cipher is used for hardware and software implementations ranging from low-cost to high-speed smart cards and network systems. Camellia is integrated in the Transport Layer Security to offer communication security in computer networks.

This cipher has Feistel network structure with key and block sizes of 128, 192 or 256 bits and 128 bits, respectively. Camellia has 18 or 24 rounds. This cipher is considered safe, modern, and infeasible to penetrate even by Brute-force attack. At present, there has never been a successful attack on this cipher. Camellia is used by the Japanese CRYPTREC project, the EU’s NESSIE and the IEC/ISO.

DEAL

DEAL is a symmetric-key block cipher designed by Lars Knudsen and published in 1998. This cipher is derived from DES and related to Ladder-Des. Its key and block sizes are 128, 192, or 256 bits and 128 bits, respectively. DEAL has 6 or 8 rounds with Nested Feistel network. The cipher many rounds makes it safer. However, it is exposed to Brute-force and differential attacks, especially in low keys.

LOK197

Designed by Lawrie Brown, Jennifer Seberry, and Josef Pieprzyk, LOK197 is a symmetric-key block cipher created in 2001. This cipher is relatively safe and has multiple usages in securing electronic data. However, it is exposed to Brute-force and differential attacks, especially in low keys. However, the multiple layers in each round make the cipher relatively secure. The encryption algorithm has low reliability, thus, limiting its usage in software and hardware support.

DFC

Decorrelated Fast Cipher (DFC) is also a symmetric-key block published in 1998 by a conglomerate of researchers drawn from France Telecom, CNRS, and Ecole Normale Superieure. DFC is related to COCONUT98 and has 8 rounds. Its key and block sizes are 128, 192, or 256 bits and 128 bits, respectively. The cipher is exposed to timing, differential and linear at tacks due to its low native capabilities in low key. However, in high key, DFC is secure and allows for many cipher parameter choices using modified keys schedules to phase out weak keys.

MAGENTA

First published in 1998, MAGENTA is a symmetric-key block cipher designed by Klaus Huber and Michael Jacobson. It has 6 or 8 rounds with key and block sizes of 128, 192, or 356 bits and 128 bits, respectively. MAGENTA’s structure is Feistel network. This cipher is used for general encryption and support of network telecommunication apps. However, it is slower in low key and exposed to differential attacks. However, MAGENTA is relatively secure or immune under specific protocols.

E2

E2 cipher is a 12 rounds symmetric-key block that was published in 1998 and designed by NTT. Its successor is Camellia and has key and block sizes of 128, 192, or 256 bits and 128 bits, respectively. Unlike some ciphers, E2 has an output and input transformations that use modular multiplication, thus, multiple usages. However, its round function is limited to S-box and XORs lookups. Most of E2 component have been integrated in Camellia.

CRYPTON

Designed by Chae Hoon Lim and first published in 1998, CRYPTON is a symmetric-key block cipher created to replace AES. This cipher is relatively efficient, especially in hardware implementations. For instance, Future Systems Incorporation has successfully used this cipher in their hardwares. CRYPTON has four steps in its round transformation consisting of column-wise, byte-wise, column-to-row, and final-key. This cipher uses 12 rounds and has substitution-permutation network. It is derived from Square. CRYPTON has key and block sizes of 128, 192, or 256 bits and 128 bits, respectively. However, this cipher is weak in low key and exposed to Brute-force and differential attacks.

Leave a Reply

Your email address will not be published. Required fields are marked *