http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
A Novel Lossless Image Encryption Method using DNA Substitution and Chaotic Logistic Map
Shouvik Chakraborty,Arindrajit Seal,Mousomi Roy,Kalyani Mali 보안공학연구지원센터 2016 International Journal of Security and Its Applicat Vol.10 No.2
Presently, there is a growth in the transmission of image and video data. Security becomes a main issue. Very strong image cryptographic techniques are a solution to this problem. There is a use of a randomly generated public key and based on that there is an application of DNA algorithm. In the proposed method DNA algorithm based substitution is used for spatial domain bit permutation. Here the chaotic logistic map is used for generating a pseudorandom bit sequence. We have generated 48bit length sequences for every pixel. After the substitution operation, a final layer of security is imposed to make this process more fault tolerant. The For checking the strength of the work a series of tests are performed and various parameters are checked like Correlation Coefficient Analysis, analysis of NPCR and UACI values etc.
An Efficient Approach to Job Shop Scheduling Problem using Simulated Annealing
Shouvik Chakraborty,Sandeep Bhowmik 보안공학연구지원센터 2015 International Journal of Hybrid Information Techno Vol.8 No.11
The Job-Shop Scheduling Problem (JSSP) is a well-known and one of the challenging combinatorial optimization problems and falls in the NP-complete problem class. This paper presents an algorithm based on integrating Genetic Algorithms and Simulated Annealing methods to solve the Job Shop Scheduling problem. The procedure is an approximation algorithm for the optimization problem i.e. obtaining the minimum makespan in a job shop. The proposed algorithm is based on Genetic algorithm and simulated annealing. SA is an iterative well known improvement to combinatorial optimization problems. The procedure considers the acceptance of cost-increasing solutions with a nonzero probability to overcome the local minima. The problem studied in this research paper moves around the allocation of different operation to the machine and sequencing of those operations under some specific sequence constraint.
An Efficient Image Cryptographic Algorithm based on Frequency Domain using Haar Wavelet Transform
Kalyani Mali,Shouvik Chakraborty,Arindrajit Seal,Mousomi Roy 보안공학연구지원센터 2015 International Journal of Security and Its Applicat Vol.9 No.12
Presently a number of techniques are used to restrict confidential image data from unauthorized access. In this paper, the authors have proposed an efficient lossless image cryptographic algorithm to transmit pictorial data securely. Initially we take a 64 bit key, we convert our decimal pixel value into binary 8 bits and we XOR the first 8 bits of the key with the pixel value. After that we take the next 8 bits of the key and XOR with the next pixel value. We perform the circular right shit operation when the key gets exhausted. We perform the first level haar wavelet decomposition thereafter. Dividing the LL1 into four equal sections we perform some swapping operations. Decryption follows the reverse of the encryption .Evaluation is done by some parametric tests which includes correlation analysis, NPCR, UACI readings etc. show that the proposed work is resilient and robust in the field of cryptography.