Higher order differential cryptanalysis
- Higher order differential cryptanalysis
In cryptography, higher-order differential cryptanalysis is a generalization of differential cryptanalysis, an attack against block ciphers. Developed in 1994 by Lars Knudsen, the technique has been applied to a number of ciphers. Whereas ordinary differential cryptanalysis analyzes the differences between two texts, the higher-order variant considers differences between differences, etc. It has been shown to be more powerful than a first-order attack in some cases (see KN-Cipher).
References
* cite conference
author = Lars Knudsen
title = Truncated and Higher Order Differentials
booktitle = Fast Software Encryption (FSE 1994)
pages = 196-211
publisher = Springer-Verlag
date = 1994
location =
url = http://citeseer.ist.psu.edu/knudsen95truncated.html
format = PDF/PostScript
accessdate = 2007-02-14
Wikimedia Foundation.
2010.
Look at other dictionaries:
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
Truncated differential cryptanalysis — In cryptography, truncated differential cryptanalysis is a generalization of differential cryptanalysis, an attack against block ciphers. Lars Knudsen developed the technique in 1994. Whereas ordinary differential cryptanalysis analyzes the full… … Wikipedia
KN-Cipher — Infobox block cipher name = KN Cipher designers = Kaisa Nyberg and Lars Knudsen publish date = 1995 derived from = derived to = related to = certification = key size = 198 bits block size = 64 bits structure = Feistel network rounds = 6… … Wikipedia
Camellia (алгоритм) — У этого термина существуют и другие значения, см. Camellia (значения). Camellia Создатель: Mitsubishi, NTT Создан: 2000 г. Опубликован: 2000 г. Размер ключа: 128, 192 или 256 бит Размер блока: 128 бит Число раундов … Википедия
Data Encryption Standard — The Feistel function (F function) of DES General Designers IBM First publis … Wikipedia
Bent function — The 2 ary bent functions with Hamming weight 1 Their nonlinearity is … Wikipedia
Correlation attack — In cryptography, correlation attacks are a class of known plaintext attacks for breaking stream ciphers whose keystream is generated by combining the output of several linear feedback shift registers (called LFSRs for the rest of this article)… … Wikipedia
History of mathematics — A proof from Euclid s Elements, widely considered the most influential textbook of all time.[1] … Wikipedia
Timeline of computing hardware 2400 BC–1949 — History of computing Hardware before 1960 Hardware 1960s to present Hardware in Soviet Bloc countries Artificial intelligence Computer science Operating systems Programming languages … Wikipedia
Timeline of mathematics — A timeline of pure and applied mathematics history. Contents 1 Before 1000 BC 2 1st millennium BC 3 1st millennium AD 4 1000–1500 … Wikipedia
