We propose a modification of Derome's method (1993) to compute the RSA secret data d = e−1 mod (P − 1)(Q − 1) by utilizing the modular arithmetic operations, when e is not prime. Here P and Q are two large prime numbers in RSA cryptosystem and e is the public data.