Saeed Rostami
Related-key impossible differential cryptanalysis of full-round HIGHT
Rostami, Saeed; Bamohabbat Chafjiri, Sadegh; Tabatabaei, Seyed Amir Hossein
Authors
Sadegh Bamohabbat Chafjiri
Seyed Amir Hossein Tabatabaei
Abstract
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 2 127.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.
Presentation Conference Type | Conference Paper (published) |
---|---|
Conference Name | 2013 International Conference on Security and Cryptography (SECRYPT) |
Start Date | Jul 29, 2013 |
End Date | Jul 31, 2013 |
Publication Date | Aug 27, 2015 |
Deposit Date | Dec 8, 2022 |
Publicly Available Date | Dec 9, 2022 |
Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
Pages | 1-6 |
Book Title | 2013 International Conference on Security and Cryptography (SECRYPT) |
Keywords | Ciphers, Encryption, Schedules, Time complexity, HIGHT, Lightweight Block Cipher, Related-key, Impossible Differential, Cryptanalysis |
Public URL | https://uwe-repository.worktribe.com/output/10224593 |
Publisher URL | https://ieeexplore.ieee.org/abstract/document/7223212 |
Related Public URLs | https://ieeexplore.ieee.org/xpl/conhome/7174743/proceeding |
Files
Related-key Impossible Differential Cryptanalysis Of Full-round HIGHT
(107 Kb)
PDF
Licence
http://www.rioxx.net/licenses/all-rights-reserved
Publisher Licence URL
http://www.rioxx.net/licenses/all-rights-reserved
Copyright Statement
This is the author’s accepted manuscript of their article. The final published version is available here: https://ieeexplore.ieee.org/abstract/document/7223212
© 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
See https://www.ieee.org/publications/rights/index.html for more information.
You might also like
Stop at the red-light is no longer boring
(2022)
Presentation / Conference Contribution
Rate secrecy of networks with game theory approach
(2011)
Presentation / Conference Contribution
Improving search space analysis of fuzzing mutators using cryptographic structures
(2024)
Presentation / Conference Contribution
Vulnerability detection through machine learning-based fuzzing: A systematic review
(2024)
Journal Article
Downloadable Citations
About UWE Bristol Research Repository
Administrator e-mail: repository@uwe.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search