Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Des Codes Cryptogr

Search In Journal Title:

Abbravation: Designs, Codes and Cryptography

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1007/s10654-016-0136-8

Search In DOI:

ISSN

1573-7586

Search In ISSN:
Search In Title Of Papers:

Practicaltime attacks against reduced variants of

Authors: Orr Dunkelman Nathan Keller
Publish Date: 2014/05/29
Volume: 76, Issue: 3, Pages: 601-627
PDF Link

Abstract

MISTY1 is a block cipher designed by Matsui in 1997 It is widely deployed in Japan where it is an egovernment candidate recommended cipher and is recognized internationally as a NESSIErecommended 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 practicaltime attack on 5round MISTY1 which exploits only the linear FL functions and thus remains valid even if the nonlinear FO functions are replaced On the other extreme we show the importance of the FL layers by presenting a devastating and experimentally verified relatedkey attack that can break MISTY1 with no FL layers requiring only 218 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 designersThe authors thank the anonymous reviewers for their useful and insightful comments The first author was supported in part by the GermanIsraeli Foundation for Scientific Research and Development through Grant No 228222226/2011 The second author was supported by the Alon Fellowship


Keywords:

References


.
Search In Abstract Of Papers:
Other Papers In This Journal:

  1. Composition of recursions and nonlinear complexity of periodic binary sequences
  2. On the largest affine sub-families of a family of NFSR sequences
  3. The dimension of subcode-subfields of shortened generalized Reed–Solomon codes
  4. On explicit factors of cyclotomic polynomials over finite fields
  5. Two classes of optimal two-dimensional OOCs
  6. Sequences with small correlation
  7. Improved algorithms for finding low-weight polynomial multiples in $$\mathbb {F}_{2}^{}[x]$$ and some cryptographic applications
  8. A tight asymptotic bound on the size of constant-weight conflict-avoiding codes
  9. Distinguisher-based attacks on public-key cryptosystems using Reed–Solomon codes
  10. A new table of permutation codes
  11. Bent functions embedded into the recursive framework of $${\mathbb{Z}}$$ -bent functions
  12. Nonexistence of CW (110, 100)
  13. Point compression for the trace zero subgroup over a small degree extension field
  14. The Diffie–Hellman problem and generalization of Verheul’s theorem
  15. Modular independence and generator matrices for codes over $${\mathbb {Z}_m}$$
  16. Improved lower bounds on sizes of single-error correcting codes
  17. A combinatorial problem related to sparse systems of equations
  18. Some results concerning cryptographically significant mappings over GF(2 n )
  19. A note on the reducibility of binary affine polynomials
  20. Primitive normal bases for quartic and cubic extensions: a geometric approach
  21. Computing isogenies between supersingular elliptic curves over $${\mathbb {F}}_p$$
  22. Some cyclic codes of length 2 p n
  23. On the correlation distribution of Delsarte–Goethals sequences
  24. Algebraic decoding of folded Gabidulin codes
  25. Inner balance of symmetric designs
  26. On the construction of Griesmer codes of dimension 5
  27. Applications of representation theory to wireless communications

Search Result: