Efficient Algorithm and Architecture for Elliptic Curve Cryptographic Processor
This paper presents a new high-efficient algorithm and architecture for an elliptic curve cryptographic processor. To reduce the computational complexity, novel modified Lopez-Dahab scalar point multiplication and left-to-right algorithms are proposed for point multiplication operation. Moreover, bi...
Saved in:
Published in | Journal of semiconductor technology and science Vol. 16; no. 1; pp. 118 - 125 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | Korean |
Published |
2016
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | This paper presents a new high-efficient algorithm and architecture for an elliptic curve cryptographic processor. To reduce the computational complexity, novel modified Lopez-Dahab scalar point multiplication and left-to-right algorithms are proposed for point multiplication operation. Moreover, bit-serial Galois-field multiplication is used in order to decrease hardware complexity. The field multiplication operations are performed in parallel to improve system latency. As a result, our approach can reduce hardware costs, while the total time required for point multiplication is kept to a reasonable amount. The results on a Xilinx Virtex-5, Virtex-7 FPGAs and VLSI implementation show that the proposed architecture has less hardware complexity, number of clock cycles and higher efficiency than the previous works. |
---|---|
Bibliography: | KISTI1.1003/JNL.JAKO201608450940817 |
ISSN: | 1598-1657 |