Abstract
We believe that there is no real data protection without our own tools. Therefore, our permanent aim is to have more of our own codes. In order to achieve that, it is necessary that a lot of young researchers become interested in cryptography. We believe that the encoding of cryptographic algorithms is an important step in that direction, and it is the main reason why in this paper we present a software implementation of finding the inverse element, the operation which is essentially related to both ECC (Elliptic Curve Cryptography) and the RSA schemes of digital signature.
Highlights
It has already been mentioned that we believe the best protection is achieved by developing our own software. This process requires a lot of knowledge, skills, patience and great responsibilities [7], provided that the undisputed cryptic of cryptography itself was previously overcome and that there are courage and willingness to enter more deeply into the matter
When it comes to joint operations, we have opted for finding the inverse element
4) Use the extended Euclidean algorithm ([2]) to compute the unique integer d, 1 < d
Summary
It has already been mentioned that we believe the best protection is achieved by developing our own software. This process requires a lot of knowledge, skills, patience and great responsibilities [7], provided that the undisputed cryptic of cryptography itself was previously overcome and that there are courage and willingness to enter more deeply into the matter. In this paper we want to show that it is possible to implement the inverse element without any software-hardware facilities (in the arithmetic of large numbers), which is a very important operation in the process of realization of both leading schemes of a public key – ECC and RSA [1] [4] [6]
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
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 call
