This paper, discusses the implementation of RSA (Rivest–Shamir–Adleman) algorithm of encrypting and decrypting data. This is an assymetric algorithmic approach, which implies that two different keys, one public and another private have been used to accomplish the purpose. This paper also extends the application of RSA algorithm by choosing random prime numbers for every byte of transferred data. The programs involved are entirely based on the microprocessor INTEL 8085.