Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Improving Performance in Space-Hard Algorithms
Date
2023-01-01
Author
Güner, Hatice Kübra
Mangır, Ceyda
Yayla, Oğuz
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
110
views
0
downloads
Cite This
Protecting secret keys from malicious observers is a major problem for cryptographic algorithms in untrusted environments. White-box cryptography suggests hiding the key in the cipher code with an appropriate method such that extraction of the key becomes impossible in the white-box settings. The key is generally embedded into the confusion layer with suitable methods. One of them is using encoding techniques. Nevertheless, many encoding methods are vulnerable to algebraic attacks and side-channel analysis. Another is the space hardness concept, which creates large lookup tables that cannot be easily extracted from the device. In (M,Z)-space hard algorithms, the secret key is embedded in large tables created as a substitution box with a suitable block cipher. So the key extraction problem in the white-box settings turns into a key recovery problem in the black-box case. One of the main issues in (M,Z)-space hard algorithms is accelerating the run-time of the black-box/white-box implementation. In this study, we aim to use the advantage of the efficiency of lightweight components to speed up the diffusion layer of white-box algorithms without decreasing the security size. Therefore, we compare the linear components of NIST Lightweight Standardization candidates for efficiency and suitability to white-box settings in existing space hard ciphers. The performance results of the algorithms are compared with WARX and SPNbox-32. According to the results, using the lightweight components in the diffusion layer accelerates the performance of white-box algorithms by at least nine times.
Subject Keywords
Efficiency
,
Lightweight components
,
Space-hard ciphers
,
White-box Cryptography
URI
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85164908128&origin=inward
https://hdl.handle.net/11511/104707
DOI
https://doi.org/10.1007/978-3-031-34671-2_28
Conference Name
7th International Symposium on Cyber Security, Cryptology, and Machine Learning, CSCML 2023
Collections
Graduate School of Applied Mathematics, Conference / Seminar
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
H. K. Güner, C. Mangır, and O. Yayla, “Improving Performance in Space-Hard Algorithms,” Be’er-Sheva, İsrail, 2023, vol. 13914 LNCS, Accessed: 00, 2023. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85164908128&origin=inward.