test vectors...... where to search

From: Giovanni Parodi (gioparodi-forng_at_yahoo.it)
Date: 11/02/04 

Date: 1 Nov 2004 23:51:57 -0800

Hello everybody, I would like to test an application to evaluate the
ModExp() function that I implemented following the suggestion founded
in "Analyzing and Comparing Montgomery Multiplication Algorithms" (in
this article there is a good description of Montgomery multiplication
algorithm). I have the problem that I don't know where to find the
values of n and n' enough big (512 bit). For n I searched on google
test vector RSA , but there is an enormous number of link and between
them I got lost. For n' (it is the integer with the property r*r^-1
-n*n' = 1) I don't know where to search (I know that it is posible to
obtain n' with Euclidean Algorithm, but I don't have yet implemented
it with big number).. is there someone that can help me ?
thanks a lot, Gio