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

See more:

encryption

algorithm

, +

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.