Lightweight Hash Function Design for the Internet of Things: Structure and SAT-Based Cryptanalysis
Guardado en:
| Publicado en: | Algorithms vol. 18, no. 9 (2025), p. 550-569 |
|---|---|
| Autor principal: | |
| Otros Autores: | , , |
| Publicado: |
MDPI AG
|
| Materias: | |
| Acceso en línea: | Citation/Abstract Full Text + Graphics Full Text - PDF |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 3254461635 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 1999-4893 | ||
| 024 | 7 | |a 10.3390/a18090550 |2 doi | |
| 035 | |a 3254461635 | ||
| 045 | 2 | |b d20250101 |b d20251231 | |
| 084 | |a 231333 |2 nlm | ||
| 100 | 1 | |a Kairat, Sakan | |
| 245 | 1 | |a Lightweight Hash Function Design for the Internet of Things: Structure and SAT-Based Cryptanalysis | |
| 260 | |b MDPI AG |c 2025 | ||
| 513 | |a Journal Article | ||
| 520 | 3 | |a This paper introduces a lightweight cryptographic hash algorithm, LWH-128, developed using a sponge-based construction and specifically adapted for operation under constrained computational and energy conditions typical of embedded systems and Internet of Things devices. The algorithm employs a two-layer processing structure based on simple logical operations (XOR, cyclic shifts, and S-boxes) and incorporates a preliminary diffusion transformation function G, along with the Davis–Meyer compression scheme, to enhance irreversibility and improve cryptographic robustness. A comparative analysis of hardware implementation demonstrates that LWH-128 exhibits balanced characteristics in terms of circuit complexity, memory usage, and processing speed, making it competitive with existing lightweight hash algorithms. As part of the cryptanalytic evaluation, a Boolean SATisfiability (SAT) Problem-based model of the compression function is constructed in the form of a conjunctive normal form of Boolean variables. Experimental results using the Parkissat SAT solver show an exponential increase in computational time as the number of unknown input bits increased. These findings support the conclusion that the LWH-128 algorithm exhibits strong resistance to preimage attacks based on SAT-solving techniques. | |
| 610 | 4 | |a National Institute of Standards & Technology | |
| 653 | |a Internet of Things | ||
| 653 | |a Artificial intelligence | ||
| 653 | |a Sustainable development | ||
| 653 | |a Trends | ||
| 653 | |a Boolean | ||
| 653 | |a Hash based algorithms | ||
| 653 | |a Design | ||
| 653 | |a Blockchain | ||
| 653 | |a Energy efficiency | ||
| 653 | |a Canonical forms | ||
| 653 | |a Cryptography | ||
| 653 | |a Systems stability | ||
| 653 | |a Algorithms | ||
| 653 | |a Research & development--R&D | ||
| 653 | |a Energy consumption | ||
| 653 | |a Computing time | ||
| 653 | |a Comparative analysis | ||
| 700 | 1 | |a Algazy Kunbolat | |
| 700 | 1 | |a Nursulu, Kapalova | |
| 700 | 1 | |a Varennikov Andrey | |
| 773 | 0 | |t Algorithms |g vol. 18, no. 9 (2025), p. 550-569 | |
| 786 | 0 | |d ProQuest |t Engineering Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/3254461635/abstract/embedded/J7RWLIQ9I3C9JK51?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text + Graphics |u https://www.proquest.com/docview/3254461635/fulltextwithgraphics/embedded/J7RWLIQ9I3C9JK51?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text - PDF |u https://www.proquest.com/docview/3254461635/fulltextPDF/embedded/J7RWLIQ9I3C9JK51?source=fedsrch |