I need an explanation for this Programming question to help me study.
Write a 1000 word, APA style paper on "Number Theory." In your paper include a discussion on the following:
In cryptography the Chinese Reminder Theorem can be used for the purpose of generating random numbers. explain how the algorithm is used for functionality for modular computation. Discuss how this can be used to preven the reply attack and for countermeasures. Hint: What is a nonce?
Explain how Euler's totient function is used in cryptography. Describe this funciton and its relationship to public key cryptography.
Finally, compare Fermat's primality test to the Miller-Rabin. What are the differences, strengths, and advantages?
Include a title page and 2-3 references. Only one reference may be from the internet (not Wikipedia) the rest must come from the online Grantham Library. Only the body of the paper will count towards the word requirement. Please see rubric below.
NO PLAGIARISM, Will be checked.
Student has agreed that all tutoring, explanations, and answers provided by the tutor will be used to help in the learning process and in accordance with Studypool's honor code & terms of service.