Loading...

Related-key impossible differential cryptanalysis of full-round HIGHT

Rostami, S ; Sharif University of Technology | 2013

370 Viewed
  1. Type of Document: Article
  2. Publisher: 2013
  3. Abstract:
  4. The HIGHT algorithm is a 64-bit block cipher with 128-bit key length, at CHES'06 as a lightweight cryptographic algorithm. In this paper, a new related-key impossible differential attack on the full-round algorithm is introduced. Our cryptanalysis requires time complexity of 2127.276 HIGHT evaluations which is slightly faster than exhaustive search attack. This is the first related-key impossible differential cryptanalysis on the full-round HIGHT block cipher. Copyright
  5. Keywords:
  6. Cryptanalysis ; HIGHT ; Impossible differential ; Lightweight block cipher ; Related-key ; Lightweight block ciphers ; Related keys ; Algorithms ; Electronic commerce ; Lyapunov methods ; Security of data ; Cryptography
  7. Source: ICETE 2013 - 10th International Joint Conference on E-Business and Telecommunications; SECRYPT 2013 - 10th International Conference on Security and Cryptography, Proceedings, Reykjavik ; 2013 , Pages: 537-542 ; 9789898565730 (ISBN)
  8. URL: http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=7223212&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D7223212