Issue |
ITM Web Conf.
Volume 22, 2018
The Third International Conference on Computational Mathematics and Engineering Sciences (CMES2018)
|
|
---|---|---|
Article Number | 01041 | |
Number of page(s) | 5 | |
DOI | https://doi.org/10.1051/itmconf/20182201041 | |
Published online | 17 October 2018 |
Power Side Channel Analysis and Anomaly Detection of Modular Exponentiation Method in Digital Signature Algorithm Based Fpga
1
Department of Computer Engineering, University of Agri Ibrahim Cecen, Agri, Turkey
2
Department of Computer Engineering, University of Firat, Elazig, Turkey
* Corresponding Author: bsonmez@agri.edu.tr
In this study, digital signature application was performed on FPGA with classical RSA and Chinese Remainder Theorem (CRT). The power consumption of the system was observed when the digital signature process was performed on the FPGA. In order to distinguish the modular exponentiation methods as the classical RSA and the Chinese Remainder Theorem (CRT), the anomaly detection method was applied to the digital signature application using the power side channel analysis of the system. According to the obtained result, it is proved that information about the structure of the algorithm executing in the system can be obtained by using the power information consumed by a cryptographic device.
© The Authors, published by EDP Sciences, 2018
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.