CSE 116 Lecture Notes - Lecture 8: Wolfram Alpha
1 Jul 2017
School
Department
Course
Professor
Document Summary
Cse 116 intro to computer science ii. As you saw in the lecture, using the rsa encryption scheme involves mathematics with large numbers. The key to the security of the rsa scheme is that it is mathematically time consuming to factor a very large number into 2 prime-number factors. Any integer of hundreds or even thousands of bits involves values way beyond the ability of the java integer or long integer types to manage. But it must be done and it must be done quickly in order for the method to be useful. This exercise is intended to give you an appreciation of the difficulty of the solution to that problem. Since very large numbers (ex: integers of several hundred digits) are completely beyond the ability of java to manage, you will create the capability to perform arithmetic on such values. The exercise will enable you to both add and multiply very large integer numbers.
