EXPLORING A NON FACTOR METHOD OF DECRYPTING THE RSA CODE
Joyce Nyaga, C W Mwathi · 2011
Breaking of the RSA cryptosystem remains an unsolved intriguing mathematical problem. The security of the RSA code rests on the fact that factoring large integers is a hard problem. These are numbers having exactly two large prime factors. Several such numbers with 129 digits or more, known as RSA numbers, have been factored. In spite of this achievement, no progress in breaking the code seems to be forthcoming from the factoring approach. This difficulty arises from availability of a prime number greater than n, where n is a natural number. In this work, we explore a method that is independent of factoring methods. With the RSA code, a public key (e, n) is given to the public. We set ) (mod n c p e ≡ where p is a plaintext word and c is its corresponding ciphertext word. Some secret key ) ( , ( n d f (where ) (n f is the Euler phi function of