Proceedings Article10.1109/ICASID.2017.8285769
An efficient algorithm for computing modular division over GF(2 m ) in elliptic curve cryptography
Lin Siyuan,Shan He,Guo Xin,Donghui Guo +3 more
- 01 Oct 2017
3
TL;DR: A modified modular division algorithm in the binary finite field GF(2m) is presented and a hardware implementation is designed to verify the algorithm's performance with Verilog HDL and simulate it in GF( 2m) to compare with other algorithms on clock cycles consumption.
read more
Abstract: Modular inversion is the most complicated operation in elliptic curve cryptography(ECC) Based on the Extended Euclidean Algorithm(EEA), this paper presents a modified modular division algorithm in the binary finite field GF(2m) Furthermore, this paper designs a hardware implementation to verify the algorithm's performance with Verilog HDL, we also simulate it in GF(2m) to compare with other algorithms on clock cycles consumption
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
An Efficient Stream Data Processing Model for Multiuser Cryptographic Service
TL;DR: Prototyping experiments prove that this model can realize the correct and rapid processing of multiservice cross-data streams and increasing the pipeline depth and improving the processing performance in each stage of the pipeline are the key to improving the system performance.
Reconfigurable TPM Implemented with Ultralow-Power Management in 28nm CMOS Process for IoT SoC Design
Zenan Huang,Xiao Zhang,Jiebin Su,Zhixin Zhou,Hongyin Luo,Donghui Guo +5 more
- 01 Mar 2021
TL;DR: In this paper, a reconfigurable TPM with a power management module using 28nm CMOS process is proposed, which guarantees the energy saving and effectiveness of the chip by integrating clock management, power management and multi-voltage management strategy.
New Polynomial Based Bit-Level Serial GF(2 m ) Multiplier for RS(15,11) 4-bit Codec Optimization
Petrus Mursanto,R. Dimas Nugroho +1 more
- 01 May 2018
TL;DR: It is confirmed that the most optimal RS Codec can be achieved by selecting the best configuration of GF arithmetic operators, each of which does not necessarily the best variant.
References
Elliptic curve cryptosystems
TL;DR: The question of primitive points on an elliptic curve modulo p is discussed, and a theorem on nonsmoothness of the order of the cyclic subgroup generated by a global point is given.
5.9K
Use of Elliptic Curves in Cryptography
Victor S. Miller
- 18 Aug 1985
TL;DR: In this paper, an analogue of the Diffie-Hellmann key exchange protocol was proposed, which appears to be immune from attacks of the style of Western, Miller, and Adleman.
A fast algorithm for computing multiplicative inverses in GF(2 m ) using normal bases
Toshiya Itoh,Shigeo Tsujii +1 more
TL;DR: The fast algorithm proposed in this paper also uses normal bases, and computes multiplicative inverses iterating multiplications in GF(2 m ).
723
An Analysis of RFID Authentication Schemes for Internet of Things in Healthcare Environment Using Elliptic Curve Cryptography
Debiao He,Sherali Zeadally +1 more
TL;DR: Although most RFID authentication schemes cannot satisfy all security requirements and have satisfactory performance, it is found that there are three recently proposed ECC-based authentication schemes suitable for the healthcare environment in terms of their performance and security.
351
From Euclid's GCD to Montgomery Multiplication to the Great Divide
Sheueling Chang Shantz
- 01 Jun 2001
TL;DR: A binary add-and-shift algorithm for modular division in a residue class is described: this technique for fast computation of divisions in GF(2m) is the key to a highly efficient implementation of elliptic curve cryptosystems.