Tests the correct implementation of the modulo exponential and inverse modulo functions using RSA encryption and decryption. The two pseudoprimes p and q are fixed, but the two RSA keys are generated for each round of testing.

public static void RSATest2(
	int rounds
)

Public Shared Sub RSATest2 ( 
	rounds As Integer
)

public:
static void RSATest2(
	int rounds
)

static member RSATest2 : 
        rounds : int -> unit