Abstract
An Improved RSA based on Double Even Magic Square of order 32
Highlights
Decryption is the inverse, Converting from the unreadable cipher text back to plaintext
To encrypt the clear message characters, their ASCII values are taken which is possible that the same cipher text is produced for the characters which occur in several positions in the plaintext
This paper attempts to improve a method with "doubly even magic squares (DEMS)" of order 32 (32 ×32) which equals to 1024 different values and dividing this magic square to different corresponding ASCII tables
Summary
Decryption is the inverse, Converting from the unreadable cipher text back to plaintext. An example of asymmetric systems is RSA, The security of several cryptographic systems relates with the creation of unexpected elements like the secret key in the DES algorithms, the key stream in the one-time pad and the prime P, and Q in the RSA encryption. In every these instances, the keys made must be sufficient in size and the arbitrary. Instead of taking the ASCII values of the characters to encrypt, different numerals representing the location of ASCII values in the magic square are taken and using the same magic square to select two prime numbers (P and Q) which is used to generate the public key (e, n) these numerals are encrypted using "RSA cryptosystem"
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
