Kumarjit Banerjee

Work place: Systems Engineer- Tata Consultancy Services, Dept. of I.T, Kalyani Govt. Engg College, Kalyani, Nadia (W.B), India

E-mail: kumarjit.banerjee@tcs.com


Research Interests: Artificial Intelligence, Image Processing


Kumarjit Banerjee (27/08/1986) has received his B. Tech degree in Computer Science and Engineering form West Bengal University of Technology, West Bengal, India. His field of interest includes Image Processing, Number Theory and Artificial Intelligence. He has published six papers in international Conference. His two research papers have been published in International journal.

Author Articles
Improved Trial Division Technique for Primality Checking in RSA Algorithm

By Kumarjit Banerjee Satyendra Nath Mandal Sanjoy Kumar Das

DOI: https://doi.org/10.5815/ijcnis.2013.09.07, Pub. Date: 8 Jul. 2013

The RSA cryptosystem, invented by Ron Rivest, Adi Shamir and Len Adleman was first publicized in the August 1977 issue of Scientific American. The security level of this algorithm very much depends on two large prime numbers. To check the primality of large number in personal computer is huge time consuming using the best known trial division algorithm. The time complexity for primality testing has been reduced using the representation of divisors in the form of 6n±1. According to the fundamental theorem of Arithmetic, every number has unique factorization. So to check primality, it is sufficient to check if the number is divisible by any prime below the square root of the number. The set of divisors obtained by 6n±1 form representation contains many composites. These composite numbers have been reduced by 30k approach. In this paper, the number of composites has been further reduced using 210k approach. A performance analysis in time complexity has been given between 210k approach and other prior applied methods. It has been observed that the time complexity for primality testing has been reduced using 210k approach.

[...] Read more.
Performance Analysis for Detection and Location of Human Faces in Digital Image With Different Color Spaces for Different Image Formats

By Satyendra Nath Mandal Kumarjit Banerjee

DOI: https://doi.org/10.5815/ijigsp.2012.07.02, Pub. Date: 28 Jul. 2012

A human eye can detect a face in an image whether it is in a digital image or also in some video. The same thing is highly challenging for a machine. There are lots of algorithms available to detect human face. In this paper, a technique has been made to detect and locate the position of human faces in digital images. This approach has two steps. First, training the artificial neural network using Levenberg–Marquardt training algorithm and then the proposed algorithm has been used to detect and locate the position of the human faces from digital image. The proposed algorithm has been implemented for six color spaces which are RGB, YES, YUV, YCbCr, YIQ and CMY for each of the image formats bmp, jpeg, gif, tiff and png. For each color space training has been made for the image formats bmp, jpeg, gif, tiff and png. Finally, one color space and particular image format has been selected for face detection and location in digital image based on the performance and accuracy.

[...] Read more.
Other Articles