Improved Point 5P Formula for Twisted Edwards Curve in Projective Coordinate Over Prime Field

Razali, Zuren; Muslim, Norliana; Kahar, Saliyah; Yunos, Faridah; Mohamed, Kamsiah

doi:10.1109/dasa54658.2022.9765062

Cited by 1 publication

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several PM algorithms are available in the literature. According to [14,15,28,30,31], the Double and Add algorithm is more convenient for unified models of ECC, e.g., Edwards, Huff, Twisted Edwards, etc. The Lopez Dahab PM algorithm is an attractive choice for achieving instruction-level parallelism for performance improvement.…”

Section: Key-authentication Protocol (Ecdh)mentioning

confidence: 99%

See 1 more Smart Citation

A Coprocessor Architecture for 80/112-bit Security Related Applications

Rashid¹,

Alotaibi²

2023

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

We have proposed a flexible coprocessor key-authentication architecture for 80/112-bit security-related applications over GF (2 m ) field by employing Elliptic-curve Diffie Hellman (ECDH) protocol. Towards flexibility, a serial input/output interface is used to load/produce secret, public, and shared keys sequentially. Moreover, to reduce the hardware resources and to achieve a reasonable time for cryptographic computations, we have proposed a finite field digit-serial multiplier architecture using combined shift and accumulate techniques. Furthermore, two finite-statemachine controllers are used to perform efficient control functionalities. The proposed coprocessor architecture over GF 2 163 and GF 2 233 is programmed using Verilog and then implemented on Xilinx Virtex-7 FPGA (field-programmable-gate-array) device. For GF 2 163 and GF 2 233 , the proposed flexible coprocessor use 1351 and 1789 slices, the achieved clock frequency is 250 and 235 MHz, time for one public key computation is 40.50 and 79.20 μs and time for one shared key generation is 81.00 and 158.40 μs. Similarly, the consumed power over GF 2 163 and GF 2 233 is 0.91 and 1.37 mW , respectively. The proposed coprocessor architecture outperforms state-of-the-art ECDH designs in terms of hardware resources.

show abstract

Section: Key-authentication Protocol (Ecdh)mentioning

confidence: 99%

“…The polynomial multiplication computation specifies the performance of the PM architecture [2,11,[17][18][19]21,27,28,[30][31][32]. For multiplying two m-bit polynomial multiplications, several architectures have been presented in the literature [11,[17][18][19]21,27,28,30].…”

Section: Arithmetic and Logic Unit (Alu)mentioning

confidence: 99%