this paper investigates the scalar multiplication algorithms of Elliptic Curve Cryptography (ECC) resisting power analysis attack in security System on Chip (SoC) and analyzes their efficiency. According to the charac...
详细信息
ISBN:
(纸本)9781467372114
this paper investigates the scalar multiplication algorithms of Elliptic Curve Cryptography (ECC) resisting power analysis attack in security System on Chip (SoC) and analyzes their efficiency. According to the characteristics of resource-constrained SoC, we compare and evaluate the average computation time complexity of different algorithms, and then propose an improved left to right Non-Adjacent Form (NAF) encoding algorithm (INAFEA). Furthermore, an improved scalar multiplication algorithm (ISMA) based on the INAFEA with the random signed binary code to call points operations is proposed, which can save a lot of chip area. Based on the work we have done, we proposed a new algorithm to preprocess the random key to make INAFEA more useful and built up an experimental encrypt system. The experimental results show that our proposed ISMA made the security SoC random power consumption, better efficiency and stronger ability to resist power analysis attack compared to the traditional scalar multiplication algorithm.
In this paper, a distributed selectsort algorithm and a parameterized selectsort algorithm are presented to be applied on distributed systems for cases when N >> P where N is the number of elements to be sorted ...
详细信息
In this paper, a distributed selectsort algorithm and a parameterized selectsort algorithm are presented to be applied on distributed systems for cases when N >> P where N is the number of elements to be sorted and P is the number of processors in the system. The distributed system considered in this paper uses a broadcasting channel for communication between processors. We show that the number of messages required for the parameterized selectsort algorithm is dependent of N and is of complexity O(P), which is optimal in a distributed system with P processors. Furthermore, the amount of communication required in terms of elements is N + O(P3) and the computation time complexity is O((N/P)lgN + P2 lg(N/P)). Hence, when N-greater-than-or-equal-to P3, the computation time complexity is O((N/P)lg N), which is optimal using P processors. In addition, this parameterized algorithm provides us with a parameter K such that by choosing the value of K allows us to trade among processing requirement, memory requirement, and communication requirement. It is shown that this parameterized algorithm can reduce the communication requirements significantly while only slightly increasing the computation requirements.
暂无评论