COM373 Algorithmic Mathematics Assignment (2nd Option) (Weight 20%) RSA Cryptography Note: Anyone taking the lecture can prefer this option (Yes, the previous grading policy has changed!). As you know, 1st option is participating in online lectures actively and answering questions anytime your name is picked from the list. “RSA (Rivest–Shamir–Adleman) is a public-key cryptosystem that is widely used for secure data transmission. In a public-key cryptosystem, the encryption key is public and distinct from the decryption key, which is kept secret (private). An RSA user creates and publishes a public key based on two large prime numbers, along with an auxiliary value. The prime numbers are kept secret. Messages can be encrypted by anyone, via the public key, but can only be decoded by someone who knows the prime numbers.” For more please visit RSA (cryptosystem) – Wikipedia 1. Find a working RSA implementation source code that can work with arbitrarily large integers, which means integers can have 1000 or more decimal digits. An open-source code that you can use is given here: GitHub – abdallahelattar/RSA-and-Big-Numbers-Implementation: RSA Encryption and Decryption using Public and Private keys including other operations. (This code works in Visual Studio (C++ empty project), but there is no clear explanation of functions used. Some large primes having more than 100 digits are provided in the Rea_Me file.) 2. Run the code and in a video, explain how the core algorithms in RSA are coded. a. Explain general RSA algorithm b. Explain primality test algorithm c. Explain modular exponentiation algorithm Use Free screen recorder, video editor for Windows & macOS (atomisystems.com) for video recording. The recording must show your face in the corner. 3. Find an alternative for the modular exponentiation algorithm. You can start from here: iscturkeyHaticeKübraGüner.pdf Code it as an alternative function. Compare the original algorithm in your original code with this one, based on running time in seconds, for numbers having more than 150 decimal digits. In your video explain your alternative algorithm. Give complexities for both algorithms and give running time results. Submission material. 1. Source Code. 2. Link for downloading the video (Video must be 30 minutes, at least. It must show your face. Otherwise your submission will not be valid.) 3. Report.
We value our customers and so we ensure that what we do is 100% original..
With us you are guaranteed of quality work done by our qualified experts.Your information and everything that you do with us is kept completely confidential.
You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.Read more
The Product ordered is guaranteed to be original. Orders are checked by the most advanced anti-plagiarism software in the market to assure that the Product is 100% original. The Company has a zero tolerance policy for plagiarism.Read more
The Free Revision policy is a courtesy service that the Company provides to help ensure Customer’s total satisfaction with the completed Order. To receive free revision the Company requires that the Customer provide the request within fourteen (14) days from the first completion date and within a period of thirty (30) days for dissertations.Read more
The Company is committed to protect the privacy of the Customer and it will never resell or share any of Customer’s personal information, including credit card data, with any third party. All the online transactions are processed through the secure and reliable online payment systems.Read more
By placing an order with us, you agree to the service we provide. We will endear to do all that it takes to deliver a comprehensive paper as per your requirements. We also count on your cooperation to ensure that we deliver on this mandate.Read more