Modification of an encryption scheme based on the laplace transform

Hiwarekar (2012) recently introduced a new scheme in cryptography the construction of which is based on the Laplace transform of the Maclaurin series of a C∞ function tk (rt). (Gupta and Mishra, 2014) posit that the single-iteration procedure offers a weak encryption scheme by showing that cyphertext messages can be decrypted by elementary modular arithmetic, and stating that the procedure is independent of the Laplace transform. This paper examines the conditions that give rise to the encryption scheme based on the Laplace transform, and will discuss ways of strengthening the purported sources of weakness of such cryptographic process. A modification of the initial step of the encryption scheme is then offered, giving rise to two passwords for a single iteration, hence increasing the security of the encryption.