Abstract
In this study, first of all, we categorized encryption algorithms and exposed the structure and specifications of the symmetric and asymmetric algorithms. We explained that asymmetric encryption algorithms are based on hard problems (NP) and explained what these problems are. In addition, we showed how addition and doubling are realized on the elliptic curves and which theorems are used for that. We also showed how we can use Elliptic curves, which are very important development for asymmetric cryptosystems, in encryption process and explained how ECC algorithm using elliptic curves realize encryption and decryption process. As a result, we developed ECC application showing numerical results to compare with other asymmetric encryption algorithms in view of security
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
