An Improved RSA based on Double Even Magic Square of order 32

Because of the computers systems discovery and the use of computer networks between countries, security is very important to transfer confidential information over the networks; traditional cryptographic systems such as rivest-shamir-adlemen (rsa) are depend on guesswork as well as mathematics. information theory illustrates that conventional cryptographic systems cannot be regarded fully secure unless the private key ; which it is used once only; is at least as long as the plain text. and another limitation is using ascii value to represent the plaintext, so the repetition of characters in the plain text will appear in the cipher text therefore we have given approach to generate magic square of order 32 which cannot be easily traced and use this square in the cryptography which it is used to improve efficiency through providing an additional level of security to encryption. through of the characteristics of magic squares, and it's some complex conditions (non-repetition property), these squares generates a huge numbers of non-duplicate random numbers which can be used to represent the numerals rather than ascii values as well as the magic square is also used to generate the keys for public key encryption algorithms.