Abstract
The connection between some fundamental mathematical problems in number theory with cryptography has been done in this work. A new version of the elliptic curve public key cryptosystem (ECPKC) has been proposed by Karrar Taher and Ruma Ajeena. Their main idea is to design this cryptosystem focusses on generating the elliptic curve group, its order divides the Euler phi function that is computed securely based on two large primes. Faster and more secure computations to generate the keys, encryption and decryption processes, on the KR-ECPK algorithm are discussed. In comparing with other algorithms like RSA and ElGamal public key cryptosystem (EEPKC), the KR-ECPKC considers as an efficient algorithm. So, the KR-ECPKC is more appropriate for elliptic curve cryptographic applications.
Published Version
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.
