Skipjack (cipher)

Skipjack
General
Designers NSA
First published 1998 (declassified)
Cipher detail
Key sizes 80 bits
Block sizes 64 bits
Structure unbalanced Feistel network
Rounds 32
Best public cryptanalysis

ECRYPT II recommendations note that, as of 2012, ciphers with a key size of 80 bits provide only "Very short-term protection against agencies".[1] NIST recommends not to use Skipjack after 2010.[2]

Impossible differential cryptanalysis breaks 31 rounds (but only slightly faster than exhaustive search).[3]

In cryptography, Skipjack is a block cipher—an algorithm for encryption—developed by the U.S. National Security Agency (NSA). Initially classified, it was originally intended for use in the controversial Clipper chip. Subsequently, the algorithm was declassified and now provides a unique insight into the cipher designs of a government intelligence agency.[4]

History of Skipjack

Skipjack was proposed as the encryption algorithm in a US government-sponsored scheme of key escrow, and the cipher was provided for use in the Clipper chip, implemented in tamperproof hardware. Skipjack is used only for encryption; the key escrow is achieved through the use of a separate mechanism known as the Law Enforcement Access Field (LEAF).

The algorithm was initially secret, and was regarded with considerable suspicion by many for that reason. It was declassified on 24 June 1998, shortly after its basic design principle had been discovered independently by the public cryptography community.[5]

To ensure public confidence in the algorithm, several academic researchers from outside the government were called in to evaluate the algorithm (Brickell et al., 1993). The researchers found no problems with either the algorithm itself or the evaluation process. Moreover, their report gave some insight into the (classified) history and development of Skipjack:

[Skipjack] is representative of a family of encryption algorithms developed in 1980 as part of the NSA suite of "Type I" algorithms... Skipjack was designed using building blocks and techniques that date back more than forty years. Many of the techniques are related to work that was evaluated by some of the world's most accomplished and famous experts in combinatorics and abstract algebra. Skipjack's more immediate heritage dates to around 1980, and its initial design to 1987...The specific structures included in Skipjack have a long evaluation history, and the cryptographic properties of those structures had many prior years of intense study before the formal process began in 1987.[6]

Description

Skipjack uses an 80-bit key to encrypt or decrypt 64-bit data blocks. It is an unbalanced Feistel network with 32 rounds.[7] It was designed to be used in secured phones.

Cryptanalysis

Eli Biham and Adi Shamir discovered an attack against 16 of the 32 rounds within one day of declassification,[8] and (with Alex Biryukov) extended this to 31 of the 32 rounds (but with an attack only slightly faster than exhaustive search) within months using impossible differential cryptanalysis.[3]

A truncated differential attack was also published against 28 rounds of Skipjack cipher.[9]

A claimed attack against the full cipher was published in 2002,[10] but a more recent paper with attack designer as a co-author clarifies that no attack on the full 32 round cipher is known to date.[11]

In pop culture

An algorithm named Skipjack forms part of the back-story to Dan Brown's 1998 novel Digital Fortress. In Brown's novel, Skipjack is proposed as the new public-key encryption standard, along with a back door secretly inserted by the NSA ("a few lines of cunning programming") which would have allowed them to decrypt Skipjack using a secret password and thereby "read the world's email". When details of the cipher are publicly released, programmer Greg Hale discovers and announces details of the backdoor. This is arguably similar to the Dual_EC_DRBG NSA controversy.

Additionally, in the Half-Life 2 modification Dystopia, the "encryption" program used in cyberspace apparently uses both Skipjack and Blowfish algorithms.[12]

References

  1. ↑ Yearly Report on Algorithms and Keysizes (2012), D.SPA.20 Rev. 1.0, ICT-2007-216676 ECRYPT II, 09/2012.
  2. ↑ Transitions: Recommendation for Transitioning the Use of Cryptographic Algorithms and Key Lengths, NIST
  3. ↑ 3.0 3.1 Eli Biham, Adi Shamir, Alex Biryukov (1999). "Cryptanalysis of Skipjack reduced to 31 rounds using impossible differentials.". EUROCRYPT: 12–23.
  4. ↑ Schneier, Bruce (July 15, 1998). "Declassifying Skipjack".
  5. ↑ "However, I have noted that the inconsistency involved may be more apparent than real. Between the statements cited, and the declassification of SKIPJACK, a paper was published by an academic researcher noting that Feistel ciphers of a particular type, specifically those in which the f-function was itself a series of Feistel rounds, could be proven to be immune to differential cryptanalysis." http://www.quadibloc.com/crypto/co040303.htm
  6. ↑ Brickell; Denning (July 28, 1993). "SKIPJACK Review Interim Report The SKIPJACK Algorithm".
  7. ↑ "SKIPJACK and KEA Algorithm Specifications" (PDF). May 29, 1998.
  8. ↑ Eli Biham, Adi Shamir. "Initial observations on Skipjack (Biham et al.)".
  9. ↑ Lars Knudsen, M.J.B. Robshaw, David Wagner (1999). "Truncated differentials and Skipjack". CRYPTO.
  10. ↑ R. Chung-Wei Phan (2002). "Cryptanalysis of full Skipjack block cipher". Electronics Letters 38 (2): 69–71. doi:10.1049/el:20020051.
  11. ↑ Jongsung Kim, Raphael C.-W. Phan (2009). "Advanced Differential-Style Cryptanalysis of the NSA's Skipjack Block Cipher". an attack on the full 32-round Skipjack remains elusive until now. [Paper by the same author as the 2002 attack]
  12. ↑ "Dystopia Wiki".

Further reading

External links