The Monte Carlo Type Method of Attack on the RSA Cryptosystem

The RSA cryptosystem is the most widely used cryptosystem, and its security is based on the difficulty of factorization of big integers. We study the possibility of determination of the secret key of an RSA cryptosystem by means of the Monte Carlo method applied to the continued fraction method. We develop and extend similar techniques studied earlier by Wiener, de Weger, and others.