Loading...

Cryptanalysis of Lightweight Primitives and Protocols

Ahmadian, Zahra | 2014

1286 Viewed
  1. Type of Document: Ph.D. Dissertation
  2. Language: Farsi
  3. Document No: 46541 (05)
  4. University: Sharif University of Technology
  5. Department: Electrical Engineering
  6. Advisor(s): Salmasizadeh, Mahmood; Aref, Mohammad Reza
  7. Abstract:
  8. Lightweight cryptography is a new area in cryptography developed as a solution to the security requirements in pervasive, low cost and lightweight systems, such as RFID networks. Due to the pervasive nature of these systems, the users’ privacy is seriously threatened while severe restrictions are imposed on computational, memory and power resources. Therefore, the conventional design rules of cryptographic primitives and protocols are not accountable here and the designers have adopted innovative methods for lightweight designs. This makes the design of a lightweight primitive/protocol a very challenging and sensitive task which is not still reliable enough. Such a trust can not be made unless with a deep and precise external cryptanalysis of any new lightweight scheme. This thesis focuses on cryptanalysis of lightweight cryptographic primitives and protocols.
    In the domain of primitives, we focus on block ciphers, which play a key role as a building block of many other symmetric schemes. For this purpose, we precisely examine some well-known lightweight block ciphers to extract their security weaknesses and exploit them to propose new attacks on the target block ciphers. These attacks include a framework for dynamic cube attack for cryptanalysing lightweight block ciphers with a low algebraic degree round function, compensated by a large number of rounds. It is shown that, in spite of its counterpart in stream ciphers, a fully automated algorithm for the preprocessing phase of this dynamic attack can be realized. Furthermore, cryptanalytical results of some well-known lightweight block ciphers shows that, although cube attack family does not have a bold background in cryptanalysis of block ciphers, the proposed method can absolutely compete the well-established conventional methods for cryptanalysis of block ciphers such as differential and linear attack families. In the following we examine the security of lightweight block ciphers against biclique attack and show how the limited diffusion, whether in the algorithm itself or in the key schedule, can largely contribute to its vulnerability against bliclique attack. This domain will be terminated by proposing a method for reducing data complexity of the biclique attack and also showing the extreme vulnerability of block ciphers with partial nonlinear layers against linear and differential attacks.
    In the area of lightweight protocols, we focus on ultralightweight protocols which are the protocols that can be implemented by logical and arithmetic operations only in the tag side. Two frameworks for cryptanalysis of such protocols are proposed, namely recursive linear and recursive differential attacks, which can work efficiently on a significant class of ultralightweight protocols. Both of the proposed methods can be successfully applied to some ultralightweight schemes. Due to their generality, they can be used as design criteria for the upcoming schemes of this type which seems to be very necessary in this domain. Finally a desynchronization attack on a newly proposed ultralightweight protocol is proposed which has shown resistance to our two proposed methods
  9. Keywords:
  10. Lightweight Encryption ; Cryptanalysis ; Radio Frequency Identification (RFID) ; Block Cipher ; Cryptographic Algorithms Analysis ; Lightweight Authentication Protocols

 Digital Object List

 Bookmark

  • فهرست مطالب
  • فصل مقدمه
    • انگیزه‌ها
    • امنیت در سامانه‌های فراگیر
    • رمزنگاری سبک
    • طرح کلی رساله
  • فصل تحلیل الگوریتم‌های رمز سبک
    • مقدمه
    • الگوریتم‌های رمز سبک
    • تحلیل مکعبی پویای رمزهای قالبی
      • خانواده حملات مکعبی
      • مدل کلی حمله پیشنهادی
      • تحلیل KATAN
      • تحلیل SIMON
    • تحلیل دو بخشی
      • مشخصات الگوریتم رمز KLEIN-64
      • نقاط ضعف KLEIN
      • حمله دوبخشی به KLEIN-64
    • سایر تحلیل‌های الگوریتم‌های رمز سبک
      • تحلیل دوبخشی با پیچیدگی داده کم
      • تحلیل خطی و تفاضلی
    • نتیجه گیری
  • فصل تحلیل پروتکل‌های احراز اصالت فراسبک
    • مقدمه
    • مدل کلی پروتکل‌های احراز اصالت فراسبک
    • حمله خطی بازگشتی
      • مدل کلی حمله
      • تحلیل پروتکل SLMAP
      • تحلیل پروتکل یه و همکارانش
    • حمله تفاضلی بازگشتی
      • مدل کلی حمله
      • تحلیل پروتکل LMAP++
      • تحلیل پروتکل SASI
    • حمله ناهمزمان‌سازی به RAPP
      • تاریخچه
      • مشخصات
      • حمله ناهمزمان‌سازی
    • نتیجه گیری
  • فصل نتیجه گیری و پیشنهاد پژوهش های آینده
    • جمع بندی
    • پژوهش‌های آینده
  • مراجع
...see more