International Journal of Computer Network and Information Security(IJCNIS)

ISSN: 2074-9090 (Print), ISSN: 2074-9104 (Online)

Published By: MECS Press

IJCNIS Vol.7, No.10, Sep. 2015

An Encryption Technique based upon Encoded Multiplier with Controlled Generation of Random Numbers

Full Text (PDF, 378KB), PP.50-57

Views:571   Downloads:40


Sanjay Kumar Pal, Suman De

Index Terms

Encryption;Decryption;Cryptography;Random Number;Multiplier;Encoding


This paper presents an encryption technique based on independent random number generation for every individual message sent based upon a pass key which depends upon a secured telephonic conversation and the starting time of the conversation. . A multiplier technique is then applied on the plain text in order to generate the cipher text. The world runs on ciphers today and the generation of secure keys for producing a cipher asks for more simplicity yet requires much more effective cryptosystems which could generate a cipher with the most minimal complexity. Vedic Mathematics in itself offers a wide variety of techniques for encrypting a text which even involves concepts of elliptical curves, Vedic multiplier and so on. The Vedic Multiplier system is used for encoding and decoding and here we have used it to encrypt plain texts and generate a certain kind of cipher based on some random sequence of character equivalents and partial products. The objective of this paper will always resound for the development of a unique system which will ensure secrecy and authenticity for the private communication between two entities. The proposed idea can be implemented for inter-office message communication.

Cite This Paper

Sanjay Kumar Pal, Suman De,"An Encryption Technique based upon Encoded Multiplier with Controlled Generation of Random Numbers", IJCNIS, vol.7, no.10, pp.50-57, 2015.DOI: 10.5815/ijcnis.2015.10.06


[1]Bonifus PL and Dani George, "ECC ENCRYPTION SYSTEM USING ENCODED MULTIPLIER AND VEDIC MATHEMATICS", International Journal of Advanced Research in Electrical, Electronics and Instrumentation Engineering, Vol. 2, Issue 11, November 2013.

[2]Matt Valeriote, "Public Key Cryptography", McMaster University, October 2014.

[3]Crytographic Service Guide, Apple Inc., 2014.

[4]J.M.Blacledge, "Cryptography using Chaos", Warsaw University of Technology Development Programme, 2010.

[5]C.H.Huang, "Cryptographic Techniques", Information Technologies for IPR Protections, 2003/11/12, R107, CSIE Building.

[6]Bruce Schneier, Applied Cryptography-Protocols, Algorithms, and Source Code in C.

[7]Sanjay Kr. Pal, Samar Sen Sarma, "Graph Coloring Approach for Hiding of Information",Elsevier Ltd., Procedia Technology 4(2012) 272-277.

[8]Jai Skand Tripathi, Priya Keerti Tripathi, Deepti Shakti Tripathi, "An Efficient Design of Vedic Multiplier Using New Encoding Scheme", International Journal of Computer Applications (0975-8887) Volume 53-No 11,September 2012.

[9]Complexity Analysis. Available:, Time Accessed: 12, April, 2015.

[10]S.Devi, K.Kanagaram, V.Palanisamy, "A New Approach for Encryption Method using Collective Techniques with Rijngdael Algorithm", International Journal of Advanced Research in Computer and Communication Engineering Vol. 3, Issue 6, June 2014.

[11]Dr. Mrs. Saylee Gharge, Mr. Honey Brijwani, Mr. Mohit Pugrani, Mr. Girish Sukhwani, Mr. Deepak Udherani, "Percon8 Algorithm for Random Number Generation", Int. Journal of Engineering Research and Applications, ISSN : 2248-9622, Vol. 4, Issue 5( Version 1), May 2014, pp.54-60.

[12]S G Srikantaswamy, Dr. H D Phaneendra, "Improved Caesar Cipher with Random Number Generation Technique and Multistage Encryption", International Journal on Cryptography and Information Security (IJCIS), Vol.2, No.4, December 2012.

[13]Mina Mishra, V.H.Mankar, "Text Encryption Algorithms based on Pseudo Random Number Generator", International Journal of Computer Applications (0975 – 8887) Volume 111 – No 2, February 2015.

[14]A.V.N.Krishna, "Probabilistic Encryption Based ECC Mechanism", International Journal of Advancements in Technology,, ISSN 0976-4860.