Spectr-H64

Spectr-H64

Infobox block cipher
name = Spectr-H64
designers = N.D. Goots, A.A. Moldovyan and N.A. Moldovyan
publish date = 2001
derived from =
derived to = CIKS-1
related to =
key size = 256 bits
block size = 64 bits
structure = Feistel-like network
rounds = 12
cryptanalysis = Slide attack using 217 chosen plaintexts

In cryptography, Spectr-H64 is a block cipher designed in 2001 by N. D. Goots, A. A. Moldovyan and N. A. Moldovyan. It relies heavily on the permutation of individual bits, so is much better suited to implementation in hardware than in software.

The algorithm has a block size of 64 bits and key size of 256 bits. It uses a 12 round structure in which half of the block determines the transformation of the other half in each round, similar to a Feistel cipher or RC5. This same basic design was repeated in its successor, CIKS-1.

Cryptanalysis

An analysis of Spectr-H64 was presented in 2002 by Selçuk Kavut and Melek D. Yücel of the Middle East Technical University, showing a method of using a differential attack to retrieve half of the key bits when a single round is used. Using this method, they then presented a slide attack that requires 217 chosen plaintexts to return all key bits on the full 12 rounds.

References

*cite conference
author = Selçuk Kavut and Melek D. Yücel
title = Slide Attack on Spectr-H64
booktitle = 3rd International Conference on Cryptology in India (Indocrypt 2002)
date = 2002
url = http://www.eee.metu.edu.tr/~yucel/SlideAttack.pdf
format = PDF
accessdate = 2007-01-26


Wikimedia Foundation. 2010.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • CIKS-1 — General Designers A.A. Moldovyan and N.A. Moldovyan First published January 2002 Derived from Spectr H64 Cipher detail Key sizes 256 bits …   Wikipedia

  • Cobra ciphers — In cryptography, Cobra is the general name of a family of data dependent permutation based block ciphers: Cobra S128, Cobra F64a, Cobra F64b, Cobra H64, and Cobra H128. In each of these names, the number indicates the cipher s block size, and the …   Wikipedia

  • Block cipher — In cryptography, a block cipher is a symmetric key cipher operating on fixed length groups of bits, called blocks, with an unvarying transformation. A block cipher encryption algorithm might take (for example) a 128 bit block of plaintext as… …   Wikipedia

  • Data Encryption Standard — The Feistel function (F function) of DES General Designers IBM First publis …   Wikipedia

  • Differential cryptanalysis — is a general form of cryptanalysis applicable primarily to block ciphers, but also to stream ciphers and cryptographic hash functions. In the broadest sense, it is the study of how differences in an input can affect the resultant difference at… …   Wikipedia

  • International Data Encryption Algorithm — IDEA An encryption round of IDEA General Designers Xuejia Lai and James Massey …   Wikipedia

  • Triple DES — Triple Data Encryption Algorithm General First published 1998 (ANS X9.52) Derived from DES Cipher detail Key sizes 168, 112 or 56 bits (Keying option 1, 2, 3 respectively) Block sizes …   Wikipedia

  • Block cipher modes of operation — This article is about cryptography. For method of operating , see modus operandi. In cryptography, modes of operation is the procedure of enabling the repeated and secure use of a block cipher under a single key.[1][2] A block cipher by itself… …   Wikipedia

  • Meet-in-the-middle attack — Not to be confused with man in the middle attack. The meet in the middle attack is a cryptographic attack which, like the birthday attack, makes use of a space time tradeoff. While the birthday attack attempts to find two values in the domain of… …   Wikipedia

  • NESSIE — For other uses, see Nessie (disambiguation). NESSIE (New European Schemes for Signatures, Integrity and Encryption) was a European research project funded from 2000–2003 to identify secure cryptographic primitives. The project was comparable to… …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”