Abstract:

This work investigates whether the computational models used to implement the ECDH protocol can also serve as a common computational framework for the classical DieHellman protocol and RSA. The starting point was the assumption that, despite the algebraic dier- ences between these protocols, their hardware implementations rely on the same fundamental operations: modular addition, subtraction, multiplication, and reduction. As part of the study, three variants of the algebraic-curve-based component were de- signed: one based on singular curves, one based on twisted Edwards curves, and one based on the RCB model. The obtained synthesis results and comparative analysis demonstrated that the semi-agnostic approach is practically justied. In particular, the variants based on twisted Edwards curves and the RCB model proved especially promising, as in these cases the computational machinery typically associated with ECC can also be used to perform operations classically realized through modular exponentiation in RSA and DieHellman.