Sanjay Kumar Pal

Work place: Department of Computer Science and Applications, NSHM College of Management & Technology, Kolkata, 700053, India



Research Interests: Algorithmic Complexity Theory, Algorithmic Information Theory, Computability Theory, Computational Complexity Theory


Sanjay Kr. Pal is working as an Assistant Professor in NSHM College of Management and Technology, Kolkata. He has an MCA, M.Tech.(IT) and has already presented his Doctoral Public Seminar on ―Fascicles of Graph Algorithms‖ and expects to submit his thesis in a few months time. He has 23 years of experience shared between 13 years in Industry and 10 years in Teaching. He has a published book on Graph theory, ―Allurement of Some Graph Algorithms‖ and more than 50 research papers in different International and National Journals.

Author Articles
Cryptography Based on RGB Color Channels using ANNs

By Sanjay Kumar Pal Sumeet Anand

DOI:, Pub. Date: 8 May 2018

Information is by far the most precious thing in almost every field. Everything we do in the present-day world generated some data and most of the data are vulnerable to unwanted threats. The organizations and agencies are becoming more and more dependent on their digitized information systems. Also, the general public is slowly getting cyber- conscious and thus they also fear for the leak and tampering of their secured information. Today’s information systems are under the constant threats of manipulation and overriding by various criminal organizations. Thus, the information in today’s world is kept under the password authentication. These passwords are a combination of a string of alphanumeric and special characters. Also, the key used to encrypt the information are exposed to either both or one of the parties. To overcome this vulnerability, an encryption technique is proposed where the key will be generated and transmitted using TPM and the final encrypted text will be stored in the image format by segregating the text data into the 3-channelled image, i.e., RGB.

[...] Read more.
Evaluation Framework for Disabled Students based on Speech Recognition Technology

By Sanjay Kumar Pal Seemanta Bhowmick

DOI:, Pub. Date: 8 Oct. 2017

This paper intends to develop an evaluation framework for the students with disabilities based on speech recognition technology. Education is the most significant ingredient in the development and empowerment of individuals. Till the last decade, education was provided to the persons with disabilities in segregated school settings or “special schools”. But in the recent years, there has been a great shift in societal attitude towards disabled students globally. The calls for “integration” of all students, disabled students and non–disabled students into the mainstream classroom environments have gathered momentum worldwide. In the pre–existing frameworks, the disabled students faced great difficulty while interacting with the system. The prime objective of our proposed framework is to provide a user–friendly and interactive environment that gives equal opportunities to all the students being evaluated. The utilization of speech recognition technology would lead to the elimination of all misinterpretations arising due to the human scribe or mediator and would enhance the ability of the disabled students to keep pace with the other students.

[...] Read more.
An Encryption Technique based upon Encoded Multiplier with Controlled Generation of Random Numbers

By Sanjay Kumar Pal Suman De

DOI:, Pub. Date: 8 Sep. 2015

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.

[...] Read more.
An Approach of Degree Constraint MST Algorithm

By Sanjay Kumar Pal Samar Sen Sarma

DOI:, Pub. Date: 8 Aug. 2013

This paper is approaching a new technique of creating Minimal Spanning Trees based on degree constraints of a simple symmetric and connected graph G. Here we recommend a new algorithm based on the average degree sequence factor of the nodes in the graph. The time complexity of the problem is less than O(N log|E|) compared to the other existing time complexity algorithms is O(|E| log|E|)+C of Kruskal, which is optimum. The goal is to design an algorithm that is simple, graceful, resourceful, easy to understand, and applicable in various fields starting from constraint based network design, mobile computing to other field of science and engineering.

[...] Read more.
Other Articles