Click here to Skip to main content
12,633,373 members (32,317 online)
Rate this:
 
Please Sign up or sign in to vote.
See more: Encryption Algorithms , +
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.
Posted 19-Oct-12 23:41pm
gibsray306

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

  Print Answers RSS
Top Experts
Last 24hrsThis month


Advertise | Privacy | Mobile
Web02 | 2.8.161208.2 | Last Updated 20 Oct 2012
Copyright © CodeProject, 1999-2016
All Rights Reserved. Terms of Service
Layout: fixed | fluid

CodeProject, 503-250 Ferrand Drive Toronto Ontario, M3C 3G8 Canada +1 416-849-8900 x 100