FPGA Implementation of High-Efficiency ECC Point Multiplication Circuit
نویسندگان
چکیده
The authentication of Internet Things (IoT) devices based on the Physical Unclonable Function (PUF) is widely adopted in information security domain. However, leakage PUF responses an system reduces its privacy and security. To improve security, we can utilize Elliptic Curve Cryptography (ECC) algorithm with different key lengths to encrypt response arbitrarily. Point multiplication most time-consuming operation ECC because complex calculation process, which seriously affects efficiency encryption. In order solve this problem, a point multiplier binary field reconfigurable 233, 283, 409 571 designed paper. our method, by reusing underlying computing units, resources needed for are effectively reduced. What it more innovative that double operations length less than 283 bits be performed simultaneously elaborate circuit, speed up encryption process ECC. circuit implemented Xilinx Virtex-6 FPGA. experiment results show single times 19.33, 22.36, 41.36 56.5 ?s, respectively, under clock frequency 135 MHz. addition, only needs 19.33 ?s perform two-point when 233 at same time. When bits, twice 22.36 ?s.
منابع مشابه
High Speed Point Arithmetic Architecture for Ecc on Fpga
Elliptic curve cryptography plays a crucial role in networking and communication security. ECC have evolved in the recent past as an important alternative to established systems like RSA. This paper describes the implementation of an elliptic curve coprocessor based on the FPGA , which can provide a significant speedup for these cryptosystems. The FPGA configuration file is synthesized from VHD...
متن کاملHardware Implementation of Elliptic Curve Point Multiplication over GF (2) for ECC protocols
The Elliptic Curve Cryptography covers all relevant asymmetric cryptographic primitives like digital signatures and key agreement algorithms. In the present work, we develop a design of elliptic curve operations over binary Fields GF (2). The function used for this purpose is the scalar multiplication kP which is the core operation of ECCs. Where k is an integer and P is a point on an elliptic ...
متن کاملAnalysis of Multibase Scalar Point Multiplication Scheme in ECC
Development and research in cryptography has shown that RSA and Diffie-Hellman has is becoming more and more unsafe and Elliptic curve Cryptography is becoming a new trend in future for public key cryptosystem. The safety level of ECC with small size key is same as that of earlier cryptosystem with large size key. In this paper Nicolas Meloni’s,2 2012 springer algorithm for addition of points o...
متن کاملFPGA accelerator for floating-point matrix multiplication
This study treats architecture and implementation of a FPGA accelerator for double-precision floating-point matrix multiplication. The architecture is oriented towards minimising resource utilisation and maximising clock frequency. It employs the block matrix multiplication algorithm which returns the result blocks to the host processor as soon as they are computed. This avoids output buffering...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics
سال: 2021
ISSN: ['2079-9292']
DOI: https://doi.org/10.3390/electronics10111252