NDLI: Practical-time attacks against reduced variants of MISTY1

Content Provider	Springer Nature Link
Author	Keller, Nathan Dunkelman, Orr
Copyright Year	2014
Abstract	MISTY1 is a block cipher designed by Matsui in 1997. It is widely deployed in Japan where it is an e-government candidate recommended cipher, and is recognized internationally as a NESSIE-recommended cipher as well as an ISO/IEC standard and an RFC. Moreover, MISTY1 was selected to be the blueprint on top of which KASUMI, the GSM/3G block cipher, was based. Since its introduction, and especially in recent years, MISTY1 was subjected to extensive cryptanalytic efforts, which resulted in numerous attacks on its reduced variants. Most of these attacks aimed at maximizing the number of attacked rounds, and as a result, their complexities are highly impractical. In this paper we pursue another direction, by focusing on attacks of practical time complexity. We present the first practical-time attack on 5-round MISTY1 which exploits only the linear $$FL$$ functions, and thus, remains valid even if the non-linear $$FO$$ functions are replaced. On the other extreme, we show the importance of the $$FL$$ layers, by presenting a devastating (and experimentally verified) related-key attack that can break MISTY1 with no $$FL$$ layers, requiring only $$2^{18}$$ data and time. While our attacks clearly do not compromise the security of the full MISTY1, they expose several weaknesses in the components used in MISTY1, and improve our understanding of its security. These insights are also applicable to future designs which rely on MISTY1 as their base, and should be taken into close consideration by designers.
Ending Page	627
Page Count	27
Starting Page	601
File Format	PDF
ISSN	09251022
e-ISSN	15737586
Journal	Designs, Codes and Cryptography
Issue Number	3
Volume Number	76
Language	English
Publisher	Springer US
Publisher Date	2014-05-29
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Information and Communication, Circuits MISTY1 Data Encryption Practical-time Slide attacks Data Structures, Cryptology and Information Theory Data encryption Discrete Mathematics in Computer Science Cryptanalysis Coding and Information Theory Related-key attacks Cryptography Combinatorics
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Discrete Mathematics and Combinatorics Theoretical Computer Science Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Truncated differential based known-key attacks on round-reduced SIMON

Structural cryptanalysis of McEliece schemes with compact keys

Reflections on slide with a twist attacks

Provable security of block ciphers against linear cryptanalysis: a mission impossible? : An experimental review of the practical security approach and the key equivalence hypothesis in linear cryptanalysis

Attacks and counter-attacks on the GPT public key cryptosystem

Internal differential collision attacks on the reduced-round Grøstl-0 hash function

Improving impossible-differential attacks against Rijndael-160 and Rijndael-224

Distinguisher-based attacks on public-key cryptosystems using Reed–Solomon codes

Zero-correlation linear cryptanalysis of reduced-round LBlock

Practical-time attacks against reduced variants of MISTY1

Similar Documents

Truncated differential based known-key attacks on round-reduced SIMON

Structural cryptanalysis of McEliece schemes with compact keys

Reflections on slide with a twist attacks

Provable security of block ciphers against linear cryptanalysis: a mission impossible? : An experimental review of the practical security approach and the key equivalence hypothesis in linear cryptanalysis

Attacks and counter-attacks on the GPT public key cryptosystem

Internal differential collision attacks on the reduced-round Grøstl-0 hash function

Improving impossible-differential attacks against Rijndael-160 and Rijndael-224

Distinguisher-based attacks on public-key cryptosystems using Reed–Solomon codes

Zero-correlation linear cryptanalysis of reduced-round LBlock

Practical-time attacks against reduced variants of MISTY1