چكيده فارسي :
The protection of information for long period time is very critical in many environments. One way of implementation this protection with high activity is RSA cryptosystem. In this paper the old algorithm of RSA system is showed. And for more complexity and to increase time of attack coding. A new coefficient is z has been added to generator function Φ(n) in additional to selected p and q witch are depended in old algorithm. Furthermore: A flowchart of this moderation is presented with corresponding Matlab program ,and for more illustration one mathematical example is employed here.
