# LOKI

In cryptography, **LOKI89** and **LOKI91** are symmetric-key block ciphers designed as possible replacements for the Data Encryption Standard (DES). The ciphers were developed based on a body of work analysing DES, and are very similar to DES in structure. The **LOKI** algorithms were named for Loki, the god of mischief in Norse mythology.

## LOKI89[edit]

LOKI89 was first published in 1990, then named just "LOKI", by Australian cryptographers Lawrie Brown, Josef Pieprzyk, and Jennifer Seberry. LOKI89 was submitted to the European RIPE project for evaluation, but was not selected.

The cipher uses a 64-bit block and a 64-bit key. Like DES, it is a 16-round Feistel cipher and has a similar general structure, but differs in the choice of the particular S-boxes, the "P-permutation", and the "Expansion permutation". The S-boxes use the non-linearity criteria developed by Josef Pieprzyk, making them as "complex" and "unpredicatable" as possible. Their effectiveness was compared against the known design criteria for the DES S-boxes. The permutations were designed to "mix" the outputs of the S-boxes as quickly as possible, promoting the avalanche and completeness properties, essential for a good Feistel cipher. However unlike their equivalents in the DES, they are intended to be as clean and simple as possible (in retrospect perhaps a little too simple), aiding the analysis of the design.

Following the publication of LOKI89, information on the new differential cryptanalysis became available, as well as some early analysis results by (Knudsen 1993a). This resulted in the design being changed to become LOKI91.

## LOKI91[edit]

LOKI 91 was designed in response to the attacks on LOKI89 (Brown et al., 1991). The changes included removing the initial and final key whitening, a new S-box, and small alterations to the key schedule.

More specifically, the S-boxes were changed to minimise the probability of seeing different inputs resulting in the same output (a hook which Differential cryptanalysis uses), thus improving LOKI91's immunity to this attack, as detailed by the attacks authors (Biham and Shamir 1991). The changes to the key schedule were designed to reduce the number of "equivalent" or "related" keys, which resulted in the exhaustive search space for the cipher being reduced.

Whilst the resulting cipher is clearly stronger and more secure than LOKI89, there are a number of potential attacks, as detailed in the papers by Knudsen and Biham. Consequently these ciphers should be viewed as academic efforts to advance the field of block cipher design, rather than algorithms for use. The number of citations and published critiques suggests this aim has been achieved.

## See also[edit]

## References[edit]

- Eli Biham, "New Types of Cryptanalytic Attacks Using Related Keys", Journal of Cryptology, vol 7 no 4, pp 229–246, Springer-Verlag, 1994.
- Eli Biham, Adi Shamir, "Differential Cryptanalysis of Snefru, Khafre, REDOC-II, LOKI and Lucifer", in Advances in Cryptology – CRYPTO'91, LNCS 576, pp 156–171, J Feigenbaum (ed), Springer-Verlag, 1991.
- L. Brown, Josef Pieprzyk and Jennifer Seberry, "LOKI - A Cryptographic Primitive for Authentication and Secrecy Applications", in Advances in Cryptology – Auscrypt'90, LNCS 453, pp229–236, J Seberry, J Pieprzyk (eds), Springer-Verlag, 1990.
- L. Brown, M Kwan, J Pieprzyk, J Seberry, " Improving Resistance to Differential Cryptanalysis and the Redesign of LOKI", in Advances in Cryptology – Asiacrypt'91", LNCs 739, pp 36–50, H Imai et al. (eds), Springer-Verlag, 1993.
- Lars R. Knudsen, "Cryptanalysis of LOKI", in Advances in Cryptology – ASIACRYPT'91, LNCS 739, pp 22–35, H Imai et al. (eds), Springer-Verlag, 1993.
- Lars R. Knudsen, "Cryptanalysis of LOKI91", in Advances in Cryptology – ASIACRYPT'92, LNCS 718, pp 196–208, J Seberry, Y Zheng (eds), Springer-Verlag, 1993.
- Lars R. Knudsen, "New Potentially 'Weak' Keys for DES and LOKI", in Advances in Cryptology – EUROCRYPT'94, LNCS 950, pp 419–424, Springer-Verlag, 1994.
- Lars R. Knudsen, M. J. B. Robshaw, "Non-linear Approximations in Linear Cryptanalysis", in Advances in Cryptology – Eurocrypt'96, LNCS 1070, pp 224–236, Springer-Verlag, 1996.
- Kouichi Sakurai, Souichi Furuya, "Improving Linear Cryptanalysis of LOKI91 by Probabilistic Counting Method", in Fast Software Encryption, pp 114–133, Springer-Verlag, 1997.
- Toshio Tokita, Tohru Sorimachi, Mitsuru Matsui, "Linear Cryptanalysis of LOKI and s2DES", in Advances in Cryptology – ASIACRYPT'94, LNCS 917, pp 293–303, Springer-Verlag, 1994.