DocumentCode
795009
Title
Searching for the best linear approximation of DES-like cryptosystems
Author
Buttyan, L. ; Vajda, I.
Author_Institution
Dept. of Commun., Tech. Univ. Budapest, Hungary
Volume
31
Issue
11
fYear
1995
fDate
5/25/1995 12:00:00 AM
Firstpage
873
Lastpage
874
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
Keywords
approximation theory; cryptography; decoding; directed graphs; DES-like cryptosystems; best characteristic search; directed graph; linear approximation; linear cryptanalysis; maximal weight path;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:19950590
Filename
390934
Link To Document