Problem 44956. Determine RSA keys (public and private) given two prime number character strings (p and q)
Solution Stats
Problem Comments
-
9 Comments
I get different results for d in test cases 2, 3, and 4 (in particular, d=929660805638728623653 for test case 2).
This was my first Cody problem and I had a mistake in the assert within the test cases. I fixed the problem. Previously the assert was looking for [n,d] combined into a single character array. I have tested the test cases and they are correct. You should use the Euclidean algorithm.
If I understand correctly, we should have mod(d*e,phi)=1, where phi=(p-1)*(q-1). My answers seem to satisfy that condition, but test cases 2, 3, and 4 do not.
Tim, you are absolutely correct. Thanks for the comment. I fixed the test cases.
Could someone help me out with the modular inversion. I can't seem to get it to work for any large numbers. I've been stuck for a while
I think my main issue is that I cannot use the mod function with large numbers, what is a way around this?
look at importing java biginteger
@David Hill. Thanks, that worked a lot better for me
One should first consider if MATLAB is even adapted for these kinds of calculations. Still, I had a lot of fun.
Solution Comments
-
2 Comments
Problem Recent Solvers12
Suggested Problems
-
Find the sum of all the numbers of the input vector
38472 Solvers
-
Find state names that end with the letter A
933 Solvers
-
Convert Roman to Arabic Numerals
84 Solvers
-
5462 Solvers
-
Split bread like the Pharaohs - Egyptian fractions and greedy algorithm
58 Solvers
More from this Author41
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!