How many iterations of Miller-Rabin test do I need to do?

gibsray asked:

Hi I'm doing RSA project in which I'm using the Miller-Rabin algorithm to test if numbers are composite or probably prime (each number is 64 byte ~150 digits). I need to pass to this function the number to test and "certainty" - how many random bases should the function check. so what's the recommended number of this checks or certainty?
and is it sufficient to use the Rabin-Miller test or should I use another test for numbers that are probably prime (check all the numbers until the square root of the probably prime number)?
thanks.

Tags: Algorithms, Encryption, Cryptography

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

Cancel

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

Please note that all posts will be submitted under the http://www.codeproject.com/info/cpol10.aspx.