An Algorithm for Encrypting/Decrypting Textual Messages
This paper evolves an algorithm for encrypting and decrypting textual messages for transmission over an unsecured channel. The algorithm is based on the selection of a prime integer depending upon the size of the message. Then all its 'generators' or primitive roots are identified. The primitive roots are used for generating the elements for calculating the keys. Key generation follows a particular strategy, on a pre-arranged manner. The message constituting the alpha-numeric string of characters is permuted by 1-level railway fence. The cipher text is determined by XORing the ASCII decimal value of the message character with its corresponding key, expressed in ASCII decimal. Selected bits of the cipher text, are flipped. The enciphered text is then transmitted to the receiver. The prime integer and the primitive roots needed for key generation are transmitted to the receiver in a separate message. Upon receiving the cipher-text and the key generation parameters, the receiver reverses the whole sequence of operations to recover the plain-text. The algorithm scrambles the message during transmission through unsecured channels, and also safeguards data stored in the cloud. Applying 3 strategies for encryption/decryption is attempted for the first time and hence no comparison is attempted with prior works with regard to efficiency or versatility. Flipping bits on the date is the new concept introduced here.
Prime integer, Primitive root, Discrete logarithm, Key, ASCII.