A Novel Elliptic curve cryptography Processor using NoC design
Hamid Javashi, Reza Sabbaghi-Nadooshan

TL;DR
This paper introduces a new elliptic curve cryptography processor design utilizing Network-on-Chip (NoC) to enhance parallelism and reduce latency in key generation over GF(2m) and GF(P).
Contribution
It presents a novel NoC-based processor architecture for ECC that improves performance through parallel field arithmetic and reduced latency.
Findings
Reduced latency in point multiplication
Enhanced parallelism in ECC processing
Effective NoC-based architecture implementation
Abstract
In this paper, we propose an elliptic curve key generation processor over GF(2m) and GF(P) with Network-on-Chip (NoC) design scheme based on binary scalar multiplication algorithm. Over the Two last decades, Elliptic Curve Cryptography (ECC) has gained increasing acceptance in the industry and the academic community. This interest is mainly caused by the same level of security with relatively small keys provided by ECC comparing to large key size in Rivest Shamir Adleman (RSA). Parallelism can be utilized in different hierarchy levels as shown in many publications. By using NoC, a new method with the reduced latency of point multiplication (with parallel field arithmetic) is introduced in this paper.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Residue Arithmetic · Coding theory and cryptography · Cryptography and Data Security
