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.
Googling can supplant programming sometimes.
Return the largest number that is adjacent to a zero
Construct an index vector from two input vectors in vectorized fashion
Sophie Germain prime
Set a diagonal
Optimal Asymmetric Encryption Padding decoding of message for RSA Cryptography
All flights lead to Idaho Falls
Convert base 10 to base x (2-16)
Binary Array to Hex Representation
Mask Generation Function (MGF1) for PKCS #1 Standard utilizing Optimal Asymmetric Encryption Padding for RSA Cryptography
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office