Reference : Complementing Feistel Ciphers
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/18677
Complementing Feistel Ciphers
English
Biryukov, Alex mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) > ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)]
Nikolic, Ivica []
2013
Fast Software Encryption, 20th International Workshop, Lecture Notes in Computer Science
Springer International Publishing
3-8
Yes
International
978-3-662-43932-6
Fast Software Encryption
11-03-2013
Singapore
[en] block ciphers ; cryptanalysis
[en] In this paper, we propose related-key differential distinguishers based on the complementation property of Feistel ciphers. We show that with relaxed requirements on the complementation, i.e. the property does not have to hold for all keys and the complementation does not have to be on all bits, one can obtain a variety of distinguishers. We formulate criteria sufficient for attacks based on the complementation property. To stress the importance of our findings we provide analysis of the full-round primitives: Camelia-128 and GOST.
Security and Trust (SnT)
Researchers ; Professionals
http://hdl.handle.net/10993/18677

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
Complementing_Feistel_Ciphers.pdfPublisher postprint354.46 kBView/Open

Additional material(s):

File Commentary Size Access
Open access
Slides01_1.pdfSlides398.6 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.