Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2410.12281 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909351912931328 |
|---|---|
| author | Darya, Abdollah Masoud Majzoub, Sohaib El-Moursy, Ali A. Eladham, Mohamed Wed Javeed, Khalid Elwakil, Ahmed S. |
| author_facet | Darya, Abdollah Masoud Majzoub, Sohaib El-Moursy, Ali A. Eladham, Mohamed Wed Javeed, Khalid Elwakil, Ahmed S. |
| contents | This letter proposes using intermittent chaotic clocks, generated from chaotic maps, to drive cryptographic chips running the Advanced Encryption Standard as a countermeasure against Correlation Power Analysis attacks. Five different chaotic maps -- namely: the Logistic map, the Bernoulli shift map, the Henon map, the Tent map, and the Ikeda map -- are used in this work to generate chaotic clocks. The performance of these chaotic clocks is evaluated in terms of timing overhead and the resilience of the driven chip against Correlation Power Analysis attacks. All proposed chaotic clocking schemes successfully protect the driven chip against attacks, with the clocks produced by the optimized Ikeda, Henon, and Logistic maps achieving the lowest timing overhead. These optimized maps, due to their intermittent chaotic behavior, exhibit lower timing overhead compared to previous work. Notably, the chaotic clock generated by the optimized Ikeda map approaches the theoretical limit of timing overhead, i.e., half the execution time of a reference periodic clock. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_12281 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Using Intermittent Chaotic Clocks to Secure Cryptographic Chips Darya, Abdollah Masoud Majzoub, Sohaib El-Moursy, Ali A. Eladham, Mohamed Wed Javeed, Khalid Elwakil, Ahmed S. Chaotic Dynamics Systems and Control This letter proposes using intermittent chaotic clocks, generated from chaotic maps, to drive cryptographic chips running the Advanced Encryption Standard as a countermeasure against Correlation Power Analysis attacks. Five different chaotic maps -- namely: the Logistic map, the Bernoulli shift map, the Henon map, the Tent map, and the Ikeda map -- are used in this work to generate chaotic clocks. The performance of these chaotic clocks is evaluated in terms of timing overhead and the resilience of the driven chip against Correlation Power Analysis attacks. All proposed chaotic clocking schemes successfully protect the driven chip against attacks, with the clocks produced by the optimized Ikeda, Henon, and Logistic maps achieving the lowest timing overhead. These optimized maps, due to their intermittent chaotic behavior, exhibit lower timing overhead compared to previous work. Notably, the chaotic clock generated by the optimized Ikeda map approaches the theoretical limit of timing overhead, i.e., half the execution time of a reference periodic clock. |
| title | Using Intermittent Chaotic Clocks to Secure Cryptographic Chips |
| topic | Chaotic Dynamics Systems and Control |
| url | https://arxiv.org/abs/2410.12281 |