Skillset can help you prepare! Sign up for your free Skillset account and take the first steps towards your certification.
The first step in the RSA public key cryptosystem is to choose two prime numbers, 'p' and 'q.' The next step is:
Compute n = p*q
Compute n = p+q
Compute n = p/q
Compute n = p-q
The next step is to multiply these two large prime numbers together, yielding n = p*q.
1/ Choose two distinct prime numbers p and q; for security purposes, the integers p and q should be chosen at random, and should be similar in magnitude but 'differ in length by a few digits' to make factoring harder. 2/ Compute n = pq. n is used as the modulus for both the public and private keys. Its length, usually expressed in bits, is the key length.
Train with Skillset and pass your certification exam. Faster. Guaranteed.
Study thousands of practice questions that organized by skills and ranked by difficulty.
Create a tailored training plan based on the knowledge you already possess.
Know when you’re ready for the high-stakes exam. Have the confidence that you will pass on your first attempt.