IJECT 8.1 Ver -1 (Jan-March 2017)

INTERNATIONAL JOURNAL OF ELECTRONICS & COMMUNICATION TECHNOLOGY (IJECT)
Vol 8 Issue 1 (Jan-March 2017)


International Journal of Electronics & Communication Technology Vol 8 Issue 1 (Jan-March 2017)
S.No. Research Topic Paper ID
01 Design of Low Power L2 Cache Using Multistep Tag Comparison Method
Abilash.V, Chidambaram.S

Abstract
Tag comparison in a highly associative cache consumes a significant portion of the cache energy. Existing methods for tag comparison reduction are based on predicting either cache hits or cache misses. In this project, we propose novel ideas for both cache hit and miss predictions. In this method, a partial tag-enhanced Bloom filter is used to improve the accuracy of the cache miss prediction method and hot/cold checks that control data liveness to reduce the tag comparisons of the cache hit prediction method. This approach combine both methods so that their order of application can be dynamically adjusted to adapt to changing cache access behavior, which further reduces tag comparisons. To overcome the common limitation of multistep tag comparison methods , a new method proposed that reduces tag comparisons while meeting the given performance bound.
Full Paper
IJECT/81/1/A-464
02 Development of Cryptographic Algorithm for Secure Communication
Sahnoaj Ahmed, Bijoy Mandal, Dr. Arindam Biswas, A. K. Bhattacharjee

Abstract
RSA algorithm uses Integer Factorization as the backbone of data security while Diffie-Hellman Algorithm uses Discrete Logarithm to provide platform for secure key exchange. In this paper, we provide algorithm to merge both of them to provide a user with even higher level of data security. Actually, our intent is to secure data of smaller as well as larger size by obtaining one randomly chosen key pair from set of RSA keys and one randomly chosen secret key using Diffie-Hellman algorithm and then applying RSA encryption to make even public components of Diffie-Hellman algorithm inaccessible for any eavesdropper freely. We design the encryption method, which uses Diffie-Hellman Secret Key in such a way that it would not only encrypt the data but also does not increase the size of it any further. On top of that, encrypted exchange of public components of Diffie-Hellman part of the system makes it hidden from all other than intended users to see Diffie-Hellman generator and prime modulus. This will make our algorithm M*N times complex to break using even the latest version of Brute Force attack, where M and N are corresponding complexities imposed by the Diffie-Hellman and RSA algorithms respectively.
Full Paper
IJECT/81/1/A-465
03 Enhanced Data Security using RSA Digital Signature with Robust Reversible Watermarking Algorithm in Cloud Environment
Monisha.M.S, Chidambaram.S

Abstract
Now a days multimedia is a fast growing technology and almost all the mobile users would need for multimedia based applications in mobile phones. In multimedia cloud due to its increasing demand, and millions of users can surfing for various purpose, therefore threat of its security is becoming a major issue. Several old security methods are suggested to secure the interaction between the mobile user and cloud environment. In traditional watermarking can cause damage to the sensitive information present in the original data. We know that the most secure web transactions today are already dependent on RSA algorithm.In our research work RSA digital signature algorithm used for encryption process. After the encryption algorithm,the scalable watermarking method is used to ensure the data integrity and confidentiality, which is a robust reversible watermarking used to watermark the encrypted sending message to enhance the data security and prevent access from the unauthorized users. In our work both RSA digital signature and robust reversible watermarking is used to protect the data in mobile application environment efficiently. Our research findings shows that the proposed method not only reaches better security performance, but also recover the original information and enhance the confidentiality purpose.
Full Paper
IJECT/81/1/A-466