Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a2580273cb0c4c41

Jump to content

// Workers AI · dad joke modeWhat did Spectr-H64 say? I'm a spectral failure at math.

From Wikipedia, the free encyclopedia
Spectr-H64
General
DesignersN.D. Goots, A.A. Moldovyan and N.A. Moldovyan
First published2001
SuccessorsCIKS-1
Cipher detail
Key sizes256 bits
Block sizes64 bits
StructureFeistel-like network
Rounds12
Best public 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

[edit]

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

[edit]
  • Selçuk Kavut and Melek D. Yücel (2002). Slide Attack on Spectr-H64 (PDF). 3rd International Conference on Cryptology in India (Indocrypt 2002). Springer. doi:10.1007/3-540-36231-2_4. ISBN 9783540002635.

Further reading

[edit]