Searching for the best linear approximation of DES-like cryptosystems

L. Buttyán, I. Vajda

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

The authors show that the problem of searching for the best characteristic in linear cryptanalysis is equivalent to searching for the maximal weight path in a directed graph. Under certain restrictions, the best characteristic can be easily obtained even on a personal computer.

Original languageEnglish
Pages (from-to)873-874
Number of pages2
JournalElectronics Letters
Volume31
Issue number11
DOIs
Publication statusPublished - Jan 1 1995

Fingerprint

Directed graphs
Personal computers
Cryptography

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Searching for the best linear approximation of DES-like cryptosystems. / Buttyán, L.; Vajda, I.

In: Electronics Letters, Vol. 31, No. 11, 01.01.1995, p. 873-874.

Research output: Contribution to journalArticle

@article{2b16e3fcf31645b9b67670e7665c37f6,
title = "Searching for the best linear approximation of DES-like cryptosystems",
abstract = "The authors show that the problem of searching for the best characteristic in linear cryptanalysis is equivalent to searching for the maximal weight path in a directed graph. Under certain restrictions, the best characteristic can be easily obtained even on a personal computer.",
author = "L. Butty{\'a}n and I. Vajda",
year = "1995",
month = "1",
day = "1",
doi = "10.1049/el:19950590",
language = "English",
volume = "31",
pages = "873--874",
journal = "Electronics Letters",
issn = "0013-5194",
publisher = "Institution of Engineering and Technology",
number = "11",

}

TY - JOUR

T1 - Searching for the best linear approximation of DES-like cryptosystems

AU - Buttyán, L.

AU - Vajda, I.

PY - 1995/1/1

Y1 - 1995/1/1

N2 - The authors show that the problem of searching for the best characteristic in linear cryptanalysis is equivalent to searching for the maximal weight path in a directed graph. Under certain restrictions, the best characteristic can be easily obtained even on a personal computer.

AB - The authors show that the problem of searching for the best characteristic in linear cryptanalysis is equivalent to searching for the maximal weight path in a directed graph. Under certain restrictions, the best characteristic can be easily obtained even on a personal computer.

UR - http://www.scopus.com/inward/record.url?scp=0029304460&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029304460&partnerID=8YFLogxK

U2 - 10.1049/el:19950590

DO - 10.1049/el:19950590

M3 - Article

AN - SCOPUS:0029304460

VL - 31

SP - 873

EP - 874

JO - Electronics Letters

JF - Electronics Letters

SN - 0013-5194

IS - 11

ER -