Arindam Sarkar

Arindam Sarkar, J. K. Mandal

In this paper, a multilayer perceptron guided key generation for encryption/decryption (MLPKG) has been proposed through recursive replacement using mutated character code generation for wireless communication of data/information. Multilayer perceptron transmitting systems at both ends accept an identical input vector, generate an output bit and the network are trained based on the output bit which is used to form a protected variable length secret-key. For each session, different hidden layer of multilayer neural network is selected randomly and weights or hidden units of this selected hidden layer help to form a secret session key. The plain text is encrypted using mutated character code table. Intermediate cipher text is yet again encrypted through recursive replacement technique to from next intermediate encrypted text which is again encrypted to form the final cipher text through chaining, cascaded xoring of multilayer perceptron generated session key. If size of the final block of intermediate cipher text is less than the size of the key then this block is kept unaltered. Receiver will use identical multilayer perceptron generated session key for performing deciphering process for getting the recursive replacement encrypted cipher text and then mutated character code table is used for decoding. Parametric tests have been done and results are compared in terms of Chi-Square test, response time in transmission with some existing classical techniques, which shows comparable results for the proposed technique.

Arindam Sarkar, J. K. Mandal

In this paper GA based light weight faster version of Digital Signature Algorithm (GADSA) in wireless communication has been proposed. Various genetic operators like crossover and mutation are used to optimizing amount of modular multiplication. Roulette Wheel selection mechanism helps to select best chromosome which in turn helps in faster computation and minimizes the time requirements for DSA. Minimization of number of modular multiplication itself a NP-hard problem that means there is no polynomial time deterministic algorithm for this purpose. This paper deals with this problem using GA based optimization algorithm for minimization of the modular multiplication. Proposed GADSA initiates with an initial population comprises of set of valid and complete set of individuals. Some operators are used to generate feasible valid offspring from the existing one. Among several exponents the best solution reached by GADSA is compared with some of the existing techniques. Extensive simulations shows competitive results for the proposed GADSA.

Arindam Sarkar, S. Karforma, J. K. Mandal

Nowadays different state and central government in India as well as abroad are taking initiative to deliver different kind of services electronically specially using Information and Communication Technology (ICT). Intruders or hackers can steal or modify the information communicated between Government and consumer through internet. To implement privacy and confidentiality of the information we must use suitable encryption technique. In this paper an Object Oriented Modelling of International Data Encryption Algorithm (IDEA) using GA based efficient key generation technique has been proposed to incorporate privacy and confidentiality of information which would be communicated between government and consumer.