A Secure Hardware Implementation for Elliptic Curve Digital Signature Algorithm

Bedoui, Mouna; Bouallègue, Belgacem; Ahmed, Abdelmoty M.; Hamdi, Belgacem; Machhout, Mohsen; Mahmoud, Soliman A.; Khattab, M.

doi:10.32604/csse.2023.026516

Cited by 4 publications

(3 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Additionally, the Digital Signature Algorithm (DSA), rooted in modular arithmetic and discrete logarithms, is widely recognized for creating digital signatures. Noteworthy variants include ECDSA (Elliptic Curve Digital Signature Algorithm) [23,27], ElGamal (ElGamal Encryption Algorithm) [24], and ECDH (Elliptic Curve Diffie-Hellman) [26].…”

Section: Asymmetric Encryptionmentioning

confidence: 99%

RoseCliff Algorithm: Making Passwords Dynamic

Umejiaku,

Sheng

2024

Applied Sciences

View full text Add to dashboard Cite

Authentication in the digital landscape faces persistent challenges due to evolving cyber threats. Traditional text-based passwords, which are vulnerable to various attacks, necessitate innovative solutions to fortify user systems. This paper introduces the RoseCliff Algorithm, which is a dual authentication mechanism designed to enhance resilience against sophisticated hacking attempts and to continuously evolve stored passwords. The study explores encryption techniques, including symmetric, asymmetric, and hybrid encryption, thereby addressing the emerging threats posed by quantum computers. The RoseCliff Algorithm introduces introduces dynamism into passwords that allows for more secured communication across multiple platforms. To assess the algorithm’s robustness, potential attacks such as brute force, dictionary attacks, man-in-the-middle attacks, and machine learning-based attacks are examined. The RoseCliff Algorithm, through its dynamic password generation and encryption methodology, proves effective against these threats. Usability evaluation encompasses the implementation and management phase, focusing on seamless integration, and the user experience, emphasizing clarity and satisfaction. Limitations are acknowledged, thus urging further research into encryption technique resilience, robustness against breaches, and the integration of emerging technologies. In conclusion, the RoseCliff Algorithm emerges as a promising solution, thereby effectively addressing the complexities of modern authentication challenges and providing a foundation for future research and enhancements in digital security.

show abstract

Section: Asymmetric Encryptionmentioning

confidence: 99%

RoseCliff Algorithm: Making Passwords Dynamic

Umejiaku,

Sheng

2024

Applied Sciences

View full text Add to dashboard Cite

show abstract

“…For example, key authentication is essential when making payments online or in shopping centers. Similarly, key exchange is necessary for secure network/client communications [20][21][22]. Therefore, an elliptic curve digital signature algorithm (ECDSA) [23] is generally employed for key authentications.…”

Section: Related Ecpm Hardware Accelerators and Limitationsmentioning

confidence: 99%

Throughput/Area-Efficient Accelerator of Elliptic Curve Point Multiplication over GF(2233) on FPGA

Rashid,

Sonbul,

Zia

et al. 2023

Electronics

View full text Add to dashboard Cite

This paper presents a throughput/area-efficient hardware accelerator architecture for elliptic curve point multiplication (ECPM) computation over GF(2233). The throughput of the proposed accelerator design is optimized by reducing the total clock cycles using a bit-parallel Karatsuba modular multiplier. We employ two techniques to minimize the hardware resources: (i) a consolidated arithmetic unit where we combine a single modular adder, multiplier, and square block instead of having multiple modular operators, and (ii) an Itoh–Tsujii inversion algorithm by leveraging the existing hardware resources of the multiplier and square units for multiplicative inverse computation. An efficient finite-state-machine (FSM) controller is implemented to facilitate control functionalities. To evaluate and compare the results of the proposed accelerator architecture against state-of-the-art solutions, a figure-of-merit (FoM) metric in terms of throughput/area is defined. The implementation results after post-place-and-route simulation are reported for reconfigurable field-programmable gate array (FPGA) devices. Particular to Virtex-7 FPGA, the accelerator utilizes 3584 slices, needs 7208 clock cycles, operates on a maximum frequency of 350 MHz, computes one ECPM operation in 20.59 μs, and the calculated value of FoM is 13.54. Consequently, the results and comparisons reveal that our accelerator suits applications that demand throughput and area-optimized ECPM implementations.

show abstract

“…Today, strong cryptographic operations that are a component of cryptosystems are crucial to information security (1,2) , big data security (3) and wireless networks. https://www.indjst.org/ Advanced study (4) requires the ECDSA toughening with the incorporation of advance secrecy where even if the Signer's enigmatic key is found today, digital signatures can secure previously marked messages. The toughened ECDSA should be able to withstand security threats like man-in-the-middle attacks, replay attacks and forgery attacks.…”

Section: Introductionmentioning

confidence: 99%

A Chosen-Provably-Secure Attack-Resistant Light-Weight Digital Signature Based on Elliptical Curve for Resource Constrained Applications

Toradmalle¹,

Amarendra²

2023

IJST

View full text Add to dashboard Cite

Objectives: To build a bridge to provide a solution by developing a lightweight ECDSA method that is not only lower in computational aspect but also is more secure than the Zhong's ECDSA. Methods: The proposed research work performs cryptanalysis of Zhong's ECDSA and demonstrates that the method fails to withstand MITM attacks. The proposed ECDSA uses only 1 elliptic curve point multiplication ECPM operation, 1 Modular multiplication operation and zero Modular Inverse operations making it lightweight in terms of computational time. Zero inverse operations save computational time as the process involves scalar mathematics which is time-consuming. Findings: Zhong's ECDSA is not secure. Additionally, the technique takes 13.28% less time to sign data than the suggested ECDSA method. Through proofs, it is shown by comparison of the proposed ECDSA and Zhong's ECDSA and cryptanalysis that the proposed ECDSA is more applicable in real time. Although Zhong's Method for Signature verification at the Receiver end takes 8.2% more time, the recommended technique stands out in comparison to Zhong's ECDSA w.r.t security. Novelty: The work is a detailed expression of the provablysecure attack-resistant light-weight digital signature based on elliptical curve for resource constrained applications. Advancing, the novelty of the work lies in the comparison of the two techniques w.r.t their performance parameters like number of keys generated, time taken to generate keys, number of keys verified, time taken for key verification, time taken for Signature generation and time taken for Signature verification.

show abstract

A Secure Hardware Implementation for Elliptic Curve Digital Signature Algorithm

Cited by 4 publications

References 25 publications

RoseCliff Algorithm: Making Passwords Dynamic

RoseCliff Algorithm: Making Passwords Dynamic

Throughput/Area-Efficient Accelerator of Elliptic Curve Point Multiplication over GF(2233) on FPGA

A Chosen-Provably-Secure Attack-Resistant Light-Weight Digital Signature Based on Elliptical Curve for Resource Constrained Applications

Contact Info

Product

Resources

About