DOCSLIB.ORG

A Practical-Time Attack on Reduced-Round MISTY1

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Practical-Time Attack on Reduced-Round MISTY1 A Practical-time Attack on Reduced-round MISTY1 Nobuyuki Sugio1, Yasutaka Igarashi2, Toshinobu Kaneko2 and Kenichi Higuchi2 1NTT DOCOMO, INC., 3-6 Hikarinooka, Yokosuka, Kanagawa, 239-8536, Japan 2Tokyo University of Science,2641 Yamazaki, Noda, Chiba, 278-8510, Japan Keywords: MISTY1, Symmetric Key Algorithm, Block Cipher, Higher Order Differential Attack. Abstract: MISTY1 is a symmetric key algorithm which has been standardized by ISO and that its modified version is used in GSM and 3G mobile networks. MISTY1 is a 64-bit block cipher supporting key length of 128 bits. In this paper, we focused on evaluating the security of MISTY1 against higher order differential attack. We show 6-round MISTY1 with 4 FL layers is attackable with 243 blocks of chosen plaintexts and 243.31 times of data encryption. This is the best practical-time attack on reduced-round MISTY1. 1 INTRODUCTION MISTY1 with 4 FL layers, that requires 262.9 known plaintexts and 2118 encryptions (Yi and Chen, 2014). MISTY1 is one of the symmetric key algorithms. Todo introduced Integral attack by division property, and showed that the secret key of the full MISTY1 can MISTY1 is a 64-bit block cipher supporting key 63.58 121 length of 128 bits. MISTY1 was proposed by Mat- be recovered with 2 chosen plaintexts and 2 sui in 1997 (Matsui, 1997). The number of rounds is time complexity (Todo, 2015). Bar On improved the attack proposed by Todo, and presented full MISTY1 8. MISTY1 achieves a provable security against dif- 64 69.5 ferential cryptanalysis and linear cryptanalysis with was attackable with 2 chosen plaintexts and 2 round function FO. Designer adds on an auxiliary encryptions (Bar-On, 2015a). function FL in order to become secure against other Most of the previous attacks aimed at maximiz- attacks. MISTY1 was selected as one of the NESSIE- ing the number of attacked rounds, and as a result, recommended ciphers portfolio and was adopted as their complexities are highly impractical. In this pa- the international standard by ISO/IEC 18033-3 (ISO, per, we focused on evaluating the security of MISTY1 2010). CRYPTREC project has chosen MISTY1 as in terms of practical-time complexity. The previous one of the e-Government Recommended candidate ci- practical-time attack was proposed by Hatano et. al. phers in 2013 (CRYPTREC, 2013). Furthermore, the (Y. Hatano and Kaneko, 2004), and Dunkelman et. al. block cipher KASUMI designed as a slight modifica- (Dunkelman and Keller, 2013), respectively. The best tion of MISTY1 is used in the GSM/3G mobile net- practical-time attack was higher order differential at- works, which makes it one of the most widely used tack on 5-round MISTY1 with 4 FL layers.The neces- block ciphers today. sary computational complexity by using higher order Up to now, many cryptanalytic methods were used differential can be estimated as sum of the following to evaluate the security of MISTY1 such as higher or- 2-steps. der differential attack, impossible differential attack, 1. Preparation of data integral attack, and multi-dimensional zero correla- 2. Key recovery tion linear attack. The main previous attacks are as follows. Tsunoo et. al. proposed 46-th order differ- The order of differential affects both steps. Therefore, ential and showed 7-round MISTY1 with 4 FL lay- it is very important to discover the lower order differ- ers was attackable with 254.1 chosen plaintexts and ential characteristics to reduce the complexity for an 2120.7 encryptions (Y. Tsunoo and Kawabata, 2008). attack. The results we obtain are the following. Jia et. al. constructed a 7-round impossible differ- 1. We implemented the 46th-order differential for ential and mounted impossible differential attack on 4-round MISTY1 introduced in (Y. Tsunoo and 7-round MISTY1 with 3 FL layers (Jia and Li, 2012). Kawabata, 2008) on a computer which mounted Yi presented zero-correlation linear attack on 7-round Graphics Processing Unit (GPU) co-processors 235 Sugio, N., Igarashi, Y., Kaneko, T. and Higuchi, K. A Practical-time Attack on Reduced-round MISTY1. DOI: 10.5220/0005652202350242 In Proceedings of the 2nd International Conference on Information Systems Security and Privacy (ICISSP 2016), pages 235-242 ISBN: 978-989-758-167-0 Copyright c 2016 by SCITEPRESS – Science and Technology Publications, Lda. All rights reserved ICISSP 2016 - 2nd International Conference on Information Systems Security and Privacy Table 1: Summary of single-key attacks on MISTY1. Rounds FL layers Data Time Attack algorithm Reference 5 4 222 CP 228 Higher Order Differential (Y. Hatano and Kaneko, 2004) 6 4 251 CP 2123.4 Impossible Differential (Dunkelman and Keller, 2008) 6 4 253.7 CP 253.7 Higher Order Differential (Y. Tsunoo and Kawabata, 2008) 6 4 243 CP 243.31 Higher Order Differential Section5 7 0 250.2 KP 2114.1 Impossible Differential (Dunkelman and Keller, 2008) 7 3 258 KP 2124.4 Impossible Differential (Jia and Li, 2012) 7 4 262.9 KP 2118 Multi-Zero Correlation (Yi and Chen, 2014) 7 4 254.1 CP 2120.7 Higher Order Differential (Y. Tsunoo and Kawabata, 2008) 7 5 251.45 CP 2121 Higher Order Differential (Bar-On, 2015b) 8 5 263.58 CP 2121 Integral by division property (Todo, 2015) 8 5 264 CP 269.5 Integral by division property (Bar-On, 2015a) CP: Chosen Plaintexts, KP : Known Plaintexts. Table 2: The Key Scheduling of MISTY1. KOi1 KOi2 KOi3 KOi4 KIi1 KIi2 KIi3 KLi1 KLi2 Ki Ki+2 Ki+7 Ki+4 Ki0+5 Ki0+1 Ki0+3 K i+1 (odd i) K0i+1 (odd i) 2 2 +6 K0i (even i) K i +4 (even i) 2 +2 2 and found 16-bits of the above characteristic was 2 MISTY1 always 0. We gradually reduced the order of dif- ferentials for 4-round MISTY1 by computer ex- MISTY1 is a Feistel type 64-bit block cipher support- periment, and discovered new 38-th order differ- ing secret key length of 128 bits. MISTY1 was pro- ential characteristics for 4-round MISTY1 which posed by Matsui in 1997 (Matsui, 1997). The number 1 held 7-bits of those differential characteristics 0 . of rounds which designer recommends is 8. MISTY1 2. We can attack 6-round MISTY1 with 4 FL layers achieves a provable security against differential crypt- by using the 38-th order differential characteris- analysis and linear cryptanalysis with round function tic. The complexity for the attack needs 243 cho- FO. Designer adds on an auxiliary function FL in or- sen plaintexts and 243.31 encryptions. Our method der to become secure against other attacks. can reduce the necessary number of chosen plain- Figure 1 shows the main structure and components texts and the computational cost for the attack of of the cipher. The round function FOi (1 i 8) is ≤ ≤ 6-round MISTY1 with 4 FL layers illustrated in a variant of a 3-round Feistel construction which has (Y. Tsunoo and Kawabata, 2008) by a factor of 16-bit bijective function FIi j (1 j 3) and 16-bit 10 ≤ ≤ 2 . This is the best practical-time attack on 6- extended key KOi j (1 j 4), KIi j (1 j 3). FIi j ≤ ≤ ≤ ≤ round MISTY1. Summary of main attacks on is a variant of a 3-round Feistel construction and its in- MISTY1 are shown in Table 1. put is divided into left 9-bit data and right 7-bit data, which are transformed by bitwise XOR operations de- The remainder of this paper is organized as fol- noted by the symbol and substitution tables S7 and lows. Section 2 gives a brief introduction of MISTY1. S9. KI and KI are⊕ left 7-bit data and right 9-bit Section 3 explains higher order differentials and its i j1 i j2 data of KI , respectively. The key dependent linear application for an attack. Section 4 shows previous i j function FL are composed of bitwise AND operation higher order differentials and presents a new higher i denoted by the symbol , OR operation denoted by order differential for 4-round MISTY1. Section 5 the symbol , XOR operations∩ and KL (1 j 2). proposes higher order differential attack on 6-round ∪ i j ≤ ≤ The key schedule of MISTY1 takes the 128-bit se- MISTY1 with 4 FL layers. Section 6 summarizes this cret key K to generate extended keys. Let K (1 i paper. i 8) be the i-th (from left) 16-bit data of the secret≤ key≤ 1 K, and let KO (1 i 8) be the output of FI where The characteristic of 38-th order differential equals to i ≤ ≤ i j the characteristic of 46-th order differential for 4-round the input of FIi j is Ki and the key KIi j is Ki+1. Also, MISTY1 estimated in (Y. Tsunoo and Kawabata, 2008) identify K9 with K1. The correspondence between the 236 A Practical-time Attack on Reduced-round MISTY1 Figure 1: Outline of MISTY1. symbols KO , KI , KL and the actual key is shown The plaintext and ciphertext are denoted by P and i j i j i j • in Table 2. Here, Ki0 is the output of FIi, j where the C. The left 32-bit value of P is denoted by PL and input is Ki and the key is Ki+1. the right 32-bit value of P is denoted by PR. The left 32-bit value of C is denoted by CL and the 2.1 Notations Used in This Paper right 32-bit value of C is denoted by CR, respec- tively. We use the following notations for intermediate val- The input of i-th round (1 i 8) are denoted by • ≤ ≤ ues during the MISTY1 encryptions process.
Load more

Recommended publications
  • Integral Cryptanalysis on Full MISTY1⋆
    Integral Cryptanalysis on Full MISTY1? Yosuke Todo NTT Secure Platform Laboratories, Tokyo, Japan [email protected] Abstract. MISTY1 is a block cipher designed by Matsui in 1997. It was well evaluated and standardized by projects, such as CRYPTREC, ISO/IEC, and NESSIE. In this paper, we propose a key recovery attack on the full MISTY1, i.e., we show that 8-round MISTY1 with 5 FL layers does not have 128-bit security. Many attacks against MISTY1 have been proposed, but there is no attack against the full MISTY1. Therefore, our attack is the first cryptanalysis against the full MISTY1. We construct a new integral characteristic by using the propagation characteristic of the division property, which was proposed in 2015. We first improve the division property by optimizing a public S-box and then construct a 6-round integral characteristic on MISTY1. Finally, we recover the secret key of the full MISTY1 with 263:58 chosen plaintexts and 2121 time complexity. Moreover, if we can use 263:994 chosen plaintexts, the time complexity for our attack is reduced to 2107:9. Note that our cryptanalysis is a theoretical attack. Therefore, the practical use of MISTY1 will not be affected by our attack. Keywords: MISTY1, Integral attack, Division property 1 Introduction MISTY [Mat97] is a block cipher designed by Matsui in 1997 and is based on the theory of provable security [Nyb94,NK95] against differential attack [BS90] and linear attack [Mat93]. MISTY has a recursive structure, and the component function has a unique structure, the so-called MISTY structure [Mat96].
    [Show full text]
  • The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS (Full Version)
    The SKINNY Family of Block Ciphers and its Low-Latency Variant MANTIS (Full Version) Christof Beierle1, J´er´emy Jean2, Stefan K¨olbl3, Gregor Leander1, Amir Moradi1, Thomas Peyrin2, Yu Sasaki4, Pascal Sasdrich1, and Siang Meng Sim2 1 Horst G¨ortzInstitute for IT Security, Ruhr-Universit¨atBochum, Germany [email protected] 2 School of Physical and Mathematical Sciences Nanyang Technological University, Singapore [email protected], [email protected], [email protected] 3 DTU Compute, Technical University of Denmark, Denmark [email protected] 4 NTT Secure Platform Laboratories, Japan [email protected] Abstract. We present a new tweakable block cipher family SKINNY, whose goal is to compete with NSA recent design SIMON in terms of hardware/software perfor- mances, while proving in addition much stronger security guarantees with regards to differential/linear attacks. In particular, unlike SIMON, we are able to provide strong bounds for all versions, and not only in the single-key model, but also in the related-key or related-tweak model. SKINNY has flexible block/key/tweak sizes and can also benefit from very efficient threshold implementations for side-channel protection. Regarding performances, it outperforms all known ciphers for ASIC round-based implementations, while still reaching an extremely small area for serial implementations and a very good efficiency for software and micro-controllers im- plementations (SKINNY has the smallest total number of AND/OR/XOR gates used for encryption process). Secondly, we present MANTIS, a dedicated variant of SKINNY for low-latency imple- mentations, that constitutes a very efficient solution to the problem of designing a tweakable block cipher for memory encryption.
    [Show full text]
  • ICEBERG : an Involutional Cipher Efficient for Block Encryption in Reconfigurable Hardware
    1 ICEBERG : an Involutional Cipher Efficient for Block Encryption in Reconfigurable Hardware. Francois-Xavier Standaert, Gilles Piret, Gael Rouvroy, Jean-Jacques Quisquater, Jean-Didier Legat UCL Crypto Group Laboratoire de Microelectronique Universite Catholique de Louvain Place du Levant, 3, B-1348 Louvain-La-Neuve, Belgium standaert,piret,rouvroy,quisquater,[email protected] Abstract. We present a fast involutional block cipher optimized for re- configurable hardware implementations. ICEBERG uses 64-bit text blocks and 128-bit keys. All components are involutional and allow very effi- cient combinations of encryption/decryption. Hardware implementations of ICEBERG allow to change the key at every clock cycle without any per- formance loss and its round keys are derived “on-the-fly” in encryption and decryption modes (no storage of round keys is needed). The result- ing design offers better hardware efficiency than other recent 128-key-bit block ciphers. Resistance against side-channel cryptanalysis was also con- sidered as a design criteria for ICEBERG. Keywords: block cipher design, efficient implementations, reconfigurable hardware, side-channel resistance. 1 Introduction In October 2000, NIST (National Institute of Standards and Technology) se- lected Rijndael as the new Advanced Encryption Standard. The selection pro- cess included performance evaluation on both software and hardware platforms. However, as implementation versatility was a criteria for the selection of the AES, it appeared that Rijndael is not optimal for reconfigurable hardware im- plementations. Its highly expensive substitution boxes are a typical bottleneck but the combination of encryption and decryption in hardware is probably as critical. In general, observing the AES candidates [1, 2], one may assess that the cri- teria selected for their evaluation led to highly conservative designs although the context of certain cryptanalysis may be considered as very unlikely (e.g.
    [Show full text]
  • On the Avalanche Properties of Misty1, Kasumi and Kasumi-R
    ON THE AVALANCHE PROPERTIES OF MISTY1, KASUMI AND KASUMI-R SEDAT AKLEYLEK FEBRUARY 2008 ON THE AVALANCHE PROPERTIES OF MISTY1, KASUMI AND KASUMI-R A THES ĐS SUBM ĐTTED TO THE GRADUATE SCHOOL OF APPLIED MATHEMATICS OF MIDDLE EAST TECHNICAL UNIVERSITY BY SEDAT AKLEYLEK IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF SCIENCE IN THE DEPARTMENT OF CRYPTOGRAPHY FEBRUARY 2008 Approval of the Graduate School of Applied Mathematics ________________________________ Prof. Dr. Ersan AKYILDIZ Director I certify that this thesis satisfies all the requirements as a thesis for the degree of Master of Science ________________________________ Prof. Dr. Ferruh ÖZBUDAK Head of Department This is to certify that we have read this thesis and that in our opinion it is fully adequate, in scope and quality, as a thesis for the degree of Master of Science. ________________________________ Assoc. Prof. Dr. Melek Diker YÜCEL Supervisor Examining Committee Members Prof. Dr. Ersan AKYILDIZ _________________________________ Assoc. Prof. Dr. Melek Diker YÜCEL _________________________________ Prof. Dr. Ferruh ÖZBUDAK _________________________________ Assoc. Prof. Dr. Emrah ÇAKÇAK _________________________________ Dr. Hamdi Murat YILDIRIM _________________________________ I hereby declare that all information in this document has been obtained and presented in accordance with academic rules and ethical conduct. I also declare that, as required by these rules and conduct, I have fully cited and referenced all material and results that are not original to this work. Name, Last Name : Sedat AKLEYLEK Signature : iv Abstract ON THE AVALANCHE PROPERTIES OF MISTY1, KASUMI AND KASUMI-R AKLEYLEK, Sedat M.Sc., Deparment of Cryptography Supervisor : Melek Diker YÜCEL February 2008, 69 pages The Global System for Mobile (GSM) Communication is the most widely used cellular technology.
    [Show full text]
  • Cryptanalysis of Block Ciphers
    Cryptanalysis of Block Ciphers Jiqiang Lu Technical Report RHUL–MA–2008–19 30 July 2008 Royal Holloway University of London Department of Mathematics Royal Holloway, University of London Egham, Surrey TW20 0EX, England http://www.rhul.ac.uk/mathematics/techreports CRYPTANALYSIS OF BLOCK CIPHERS JIQIANG LU Thesis submitted to the University of London for the degree of Doctor of Philosophy Information Security Group Department of Mathematics Royal Holloway, University of London 2008 Declaration These doctoral studies were conducted under the supervision of Prof. Chris Mitchell. The work presented in this thesis is the result of original research carried out by myself, in collaboration with others, whilst enrolled in the Information Security Group of Royal Holloway, University of London as a candidate for the degree of Doctor of Philosophy. This work has not been submitted for any other degree or award in any other university or educational establishment. Jiqiang Lu July 2008 2 Acknowledgements First of all, I thank my supervisor Prof. Chris Mitchell for suggesting block cipher cryptanalysis as my research topic when I began my Ph.D. studies in September 2005. I had never done research in this challenging ¯eld before, but I soon found it to be really interesting. Every time I ¯nished a manuscript, Chris would give me detailed comments on it, both editorial and technical, which not only bene¯tted my research, but also improved my written English. Chris' comments are fantastic, and it is straightforward to follow them to make revisions. I thank my advisor Dr. Alex Dent for his constructive suggestions, although we work in very di®erent ¯elds.
    [Show full text]
  • Efficient FPGA Implementation of Block Cipher MISTY1
    Efficient FPGA Implementation of Block Cipher MISTY1 Gael Rouvroy, Francois-Xavier Standaert Jean-Jacques Quisquater, Jean-Didier Legat Universite catholique de Louvain, Microelectronic Laboratory Place du Levant, 3, 1348 Louvain-La-Neuve, Belgium rouvroy,standaert,quisquater,[email protected] Abstract on the basis of the theory of provable security against dif- ferential and linear cryptanalysis. In addition, it allows us NESSIE is a 3-year research project (2000-2002). The to realize high speed encryption on hardware platforms as goal of the project is to put forward some algorithms to ob- well as on software environments [2]. The detailed spec- tain a set of the next generation of cryptographic primitives. ification can be found in [2, 3]. In this paper, we study In order to achieve this objective, the project needs to evalu- the efficiency of MISTY1 encryption for an FPGA imple- ate mathematical security levels and software/hardware im- mentation. Our fast core is detailed and compared to AES plementations. This paper investigates the significance of RIJNDAEL, SERPENT, KHAZAD and previous MISTY1 an FPGA implementation of the block cipher MISTY1. Re- circuits to determine the efficiency of our MISTY1 FPGA programmable devices such as FPGA’s are highly attrac- implementation. tive solutions for hardware implementations of encryption The paper is organized as follows: Section 2 de- algorithms. A strong focus is placed on a high through- scribes the FPGA technology used and the synthe- put circuit which completely unrolls all the MISTY1 rounds sis/implementation tools; Section 3 gives a short mathemat- and pipelines them in order to increase the data rate.
    [Show full text]
  • Efficient FPGA Implementations of Block Ciphers KHAZAD and MISTY1
    Efficient FPGA Implementations of Block Ciphers KHAZAD and MISTY1 Francois-Xavier Standaert, Gael Rouvroy, Jean-Jacques Quisquater, Jean-Didier Legat fstandaert,rouvroy,quisquater,[email protected] UCL Crypto Group Laboratoire de Microelectronique Universite Catholique de Louvain Place du Levant, 3, B-1348 Louvain-La-Neuve, Belgium Abstract. The technical analysis used in determining which of the NESSIE candidates will be selected as a standard block cipher includes efficiency testing of both hardware and soft- ware implementations of candidate algorithms. Reprogrammable devices such as Field Pro- grammable Gate Arrays (FPGA’s) are highly attractive options for hardware implementations of encryption algorithms and this report investigates the significance of FPGA implementa- tions of the block ciphers KHAZAD and MISTY1. A strong focus is placed on high throughput circuits and we propose designs that unroll the cipher rounds and pipeline them in order to optimize the frequency and throughput results. In addition, we implemented solutions that allow to change the plaintext and the key on a cycle-by-cycle basis with no dead cycle. The resulting designs fit on a VIRTEX1000 FPGA and have throughput between 8 and 9 Gbits=s. This is an impressive result compared with existing FPGA implementations of block ciphers within similar devices. 1 Introduction The NESSIE project1 is about to put forward a portfolio of strong cryptographic primitives that has been obtained after an open call and been evaluated using a transparent and open process. These primitives include block ciphers, stream ciphers, hash functions, MAC algorithms, digital signature schemes, and public-key encryption schemes. The technical analysis used in determining which of the NESSIE candidates will be selected as a standard block cipher includes efficiency testing of both hardware and software implementations of candidate algorithms.
    [Show full text]
  • SEA a Scalable Encryption Algorithm for Small Embedded Applications
    SEA a Scalable Encryption Algorithm for Small Embedded Applications Fran»cois-Xavier Standaert1;2, Gilles Piret1, Neil Gershenfeld2, Jean-Jacques Quisquater1 1UCL Crypto Group Laboratoire de Micro¶electronique Universit¶eCatholique de Louvain Place du Levant, 3, B-1348 Louvain-La-Neuve, Belgium 2Center for Bits and Atoms Massachusetts Institute of Technology 20 Ames Street, Cambridge, MA 02139, USA fstandaert,piret,[email protected], [email protected] Abstract. Most present symmetric encryption algorithms result from a tradeo® between implementation cost and resulting performances. In ad- dition, they generally aim to be implemented e±ciently on a large variety of platforms. In this paper, we take an opposite approach and consider a context where we have very limited processing resources and throughput requirements. For this purpose, we propose low-cost encryption routines (i.e. with small code size and memory) targeted for processors with a limited instruction set (i.e. AND, OR, XOR gates, word rotation and mod- ular addition). The proposed design is parametric in the text, key and processor size, provably secure against linear/di®erential cryptanalysis, allows e±cient combination of encryption/decryption and “on-the-fly” key derivation. Target applications for such routines include any context requiring low-cost encryption and/or authentication. 1 Introduction Resource constrained encryption does not have a long history in symmetric cryp- tography. Noticeable examples of such ciphers are the Tiny Encryption Algo- rithm TEA [32] or Yuval's proposal [33]. However, both of them are relatively old and do not provide provable security against attacks such as linear and di®eren- tial cryptanalysis.
    [Show full text]
  • Statistical Cryptanalysis of Block Ciphers
    STATISTICAL CRYPTANALYSIS OF BLOCK CIPHERS THÈSE NO 3179 (2005) PRÉSENTÉE À LA FACULTÉ INFORMATIQUE ET COMMUNICATIONS Institut de systèmes de communication SECTION DES SYSTÈMES DE COMMUNICATION ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE POUR L'OBTENTION DU GRADE DE DOCTEUR ÈS SCIENCES PAR Pascal JUNOD ingénieur informaticien dilpômé EPF de nationalité suisse et originaire de Sainte-Croix (VD) acceptée sur proposition du jury: Prof. S. Vaudenay, directeur de thèse Prof. J. Massey, rapporteur Prof. W. Meier, rapporteur Prof. S. Morgenthaler, rapporteur Prof. J. Stern, rapporteur Lausanne, EPFL 2005 to Mimi and Chlo´e Acknowledgments First of all, I would like to warmly thank my supervisor, Prof. Serge Vaude- nay, for having given to me such a wonderful opportunity to perform research in a friendly environment, and for having been the perfect supervisor that every PhD would dream of. I am also very grateful to the president of the jury, Prof. Emre Telatar, and to the reviewers Prof. em. James L. Massey, Prof. Jacques Stern, Prof. Willi Meier, and Prof. Stephan Morgenthaler for having accepted to be part of the jury and for having invested such a lot of time for reviewing this thesis. I would like to express my gratitude to all my (former and current) col- leagues at LASEC for their support and for their friendship: Gildas Avoine, Thomas Baign`eres, Nenad Buncic, Brice Canvel, Martine Corval, Matthieu Finiasz, Yi Lu, Jean Monnerat, Philippe Oechslin, and John Pliam. With- out them, the EPFL (and the crypto) would not be so fun! Without their support, trust and encouragement, the last part of this thesis, FOX, would certainly not be born: I owe to MediaCrypt AG, espe- cially to Ralf Kastmann and Richard Straub many, many, many hours of interesting work.
    [Show full text]
  • Research Problems in Block Cipher Cryptanalysis: an Experimental Analysis Amandeep, G
    International Journal of Innovative Technology and Exploring Engineering (IJITEE) ISSN: 2278-3075, Volume-8 Issue-8S3, June 2019 Research Problems in Block Cipher Cryptanalysis: An Experimental Analysis Amandeep, G. Geetha Abstract: Cryptography has always been a very concerning Organization of this paper is as follows. Section 2 lists the issue in research related to digital security. The dynamic need of Block ciphers in a chronological order in a table having six applications and keeping online transactions secure have been columns stating name of the algorithm, year of publication, giving pathways to the need of developing different its cryptographic strategies. Though a number of cryptographic structure, block size, key size, and the cryptanalysis done on algorithms have been introduced till now, but each of these algorithms has its own disadvantages or weaknesses which are that particular cipher. This table becomes the basis of the identified by the process of cryptanalysis. This paper presents a analysis done in Section 3 and tabulates the information as to survey of different block ciphers and the results of attempts to which structure has been cryptanalyzed more, thereby identify their weakness. Depending upon the literature review, establishing a trend of structures analyzed Section 4 some open research problems are being presented which the identifies the open research problems based on the analysis cryptologists can depend on to work for bettering cyber security. done in Section 3. Section 5 of the paper, presents the conclusion of this study. Index Terms: block ciphers, cryptanalysis, attacks, SPN, Feistel. II. RELATED WORK I. INTRODUCTION This paper surveys 69 block ciphers and presents, in Cryptography is the science which deals with Table I, a summarized report as per the attacks concerned.
    [Show full text]
  • Recent Developments in the Design of Conventional Cryptographic Algorithms
    Recent Developments in the Design of Conventional Cryptographic Algorithms Bart Preneel?, Vincent Rijmen??, and Antoon Bosselaers Katholieke Universiteit Leuven, Dept. Electrical Engineering–ESAT Kardinaal Mercierlaan 94, B–3001 Heverlee, Belgium bart.preneel,vincent.rijmen,antoon.bosselaers @esat.kuleuven.ac.be { } Abstract. This paper examines proposals for three cryptographic prim- itives: block ciphers, stream ciphers, and hash functions. It provides an overview of the design principles of a large number of recent proposals, which includes the global structure, the number of rounds, the way of in- troducing non-linearity and diffusion, and the key schedule. The software performance of about twenty primitives is compared based on highly op- timized implementations for the Pentium. The goal of the paper is to provided a technical perspective on the wide variety of primitives that exist today. 1 Introduction An increasing number of applications uses software implementations of crypto- graphic algorithms in order to provide an acceptable security level at a low cost. An important constraint is that the performance of the application should be influenced as little as possible by the introduction of cryptography. The design of secure cryptographic primitives which achieve very high software performance is a challenging problem for the cryptologic research community. This paper intends to report on the state of the art on this problem. The best which can be achieved currently is to design fast primitives with some provable properties, but the general paradigm is still a ‘trial-and-error’ procedure, which consists of the publication of candidate algorithms and an evaluation by cryptanalysts. In this process, the cryptographic community gath- ers knowledge on how to design cryptographic algorithms.
    [Show full text]
  • An Improved Impossible Differential Attack on MISTY1
    An Improved Impossible Differential Attack on MISTY1 Orr Dunkelman1,⋆ and Nathan Keller2,⋆⋆ 1 Ecole´ Normale Sup´erieure D´epartement d’Informatique, CNRS, INRIA 45 rue d’Ulm, 75230 Paris, France. [email protected] 2Einstein Institute of Mathematics, Hebrew University. Jerusalem 91904, Israel [email protected] Abstract. MISTY1 is a Feistel block cipher that received a great deal of cryptographic attention. Its recursive structure, as well as the added FL layers, have been successful in thwarting various cryptanalytic tech- niques. The best known attacks on reduced variants of the cipher are on either a 4-round variant with the FL functions, or a 6-round variant without the FL functions (out of the 8 rounds of the cipher). In this paper we combine the generic impossible differential attack against 5-round Feistel ciphers with the dedicated Slicing attack to mount an attack on 5-round MISTY1 with all the FL functions with time com- plexity of 246.45 simple operations. We then extend the attack to 6- round MISTY1 with the FL functions present, leading to the best known cryptanalytic result on the cipher. We also present an attack on 7-round MISTY1 without the FL layers. 1 Introduction MISTY1 [10] is a 64-bit block cipher with presence in many cryptographic stan- dards and applications. For example, MISTY1 was selected to be in the CRYP- TREC e-government recommended ciphers in 2002 and in the final NESSIE portfolio of block ciphers, as well as an ISO standard (in 2005). MISTY1 has a recursive Feistel structure, where the round function is in itself (very close to) a 3-round Feistel construction.
    [Show full text]