Accepted Papers

  • A Novel Symmetric Cryptography Algorithm for Fast and Secure Encryption
    Aswin Achuthshankar and Aswathy A S, University of Calicut, India
    Data encryption is the best way to provide secure communication. This paper proposes a novel symmetric encryption scheme which guarantees the secure communication. The method is suitable to encrypt smaller as well as for larger files. The approach includes two files: symmetric key file and message file, both of any format opted by the user. In this approach the hackers can't even crack which type of message file was it. So breaking cipher text becomes impossible in effect. The plain text hooks up with a key document and performs some mathematical functions on it. The proposed symmetric encryption scheme has the following features over traditional schemes. First, the encryption and decryption uses the same algorithm, which is safe, simple and fast. Second, any type of file can be encrypted using this approach. Third, any type of key file can also be used according to the user's wish. In this paper, the performance is compared with the popular encryption algorithms, and the results prove that the proposed scheme is more robust and faster than traditional encryption schemes.
  • A Dynamic Algorithm to Reduce Power Consumption in Multi-core Processors
    Rahul Ravichandran and Vignesh Muralidharan, SSN College of Engineering, India
    The usage of multi-core processors has increased exponentially in the past decade. The need of the hour is to optimize the power and performance of a chip multi-core processor (CMP). In this paper, we propose a dynamic algorithm to improve power efficiency of a CMP using pipeline stage unification (PSU) and dynamic voltage frequency scaling (DVFS). The proposed algorithm alters various parameters like clock frequency, supply voltage, number of active cores,etc dynamically to obtain the best power-performance ratio.
  • Vehicular Ad-hoc Network (VANET) - Improving The Performance of Information Distribution
    Karthika S1 and Rajasubramanian S2, 1Anna University, India and 2T.J.S.Engineering College, India
    Vehicular Ad-hoc Network is an advanced version of Mobile Ad-hoc Network. VANETs are appropriate networks that can be used in intelligent transportation systems. Among challenges in VANET, scalability is a critical issue for a network designer. Clustering is one solution for the scalability problem. As our first algorithm, we propose a clustering framework for communication among the VANET nodes. The proposed model can be used to characterize the Cluster Based Highway Scenario Model (CBHSM). As our second algorithm, we propose an algorithm for joint adaptation of transmission power and contention window to improve the performance of vehicular network. The performance of the proposed clustering and joint adaptation scheme was evaluated and their characteristics are compared with the use of NS 2.34 version simulator.
  • A Comparative Analysis of Canny Edge Detection and K-Means Clustering for Citrus Fruit Recognition
    R. Thendral and A. Suhasini, Annamalai University, India
    In this paper, we presented two segmentation methods. Edge based and color based detection methods were used to segment images of orange fruits obtained under natural lighting conditions. Twenty digitized images of orange fruits were randomly selected from the Internet in order to find an orange in each image and to determine its location. We compared the results of both segmentation results and the color based segmentation outperforms the edge based segmentation in all aspects. The MATLAB image processing toolbox is used for the computation and comparison results are shown in the segmented image results.
  • Secure Data Storage Using Decentralized Access Control in Cloud
    Jenifer J, Muthu Rajkumar S, Rakesh R, Pandiyaraju V and SaiRamesh L, Anna University, India
    Privacy, Security and Access Control are some of the challenges while sharing of physical resources among untrusted tenants. Anonymous authentication in cloud ensures that cloud users remain anonymous while getting duly authenticated. We propose a digital signature based authentication scheme with key management where Key Distribution Centers are decentralized. Key Policy Attribute based encryption scheme along with assymmetric key cryptosystem is used for encrypting the data that is stored in the cloud. To provide access policy, Extended Attributed Control Markup Language (XACML) is used. Moreover, data stored in cloud is vulnerable to losses or corruption inorder to overcome this, an automatic retrieval mechanism is used. Moreover to efficiently manage storage, automatic time based deletion of files is proposed. User revocation is also supported in this framework.
  • Real Time Secured Transmission of Biosignal Using Chaotic Communication System
    Dhivya. R and Premkumar. R, Rajalakshmi Engineering College, India
    Biosignals such as Electrocardiogram (ECG), Electroencephalogram (EEG) and Electromyogram (EMG) contains critical and sensitive information about the patient's health. In order to preserve its confidentiality, the information about the patient must be transmitted in a secure manner. In this work, biosignals are communicated by employing chaotic secure system to safeguard the medical information. Chaotic signals are generated using the non linear components of chua circuit. Chaos theory portrays non linear dynamics of a system, in which random events are actually predictable from simple deterministic equations. Transmitter and receiver are synchronized using bidirectional coupling. Time division multiplexing (TDM) method is adopted for transmitting different Biosignal at a time in an efficient manner by reducing the intersymbol interference and signal loss. Multisim.13 software is used to simulate chaotic communication system and ECG signals for transmission. In the receiver end, band pass filter with pass-band frequency of 0.05-100Hz is employed to remove the noise. From the results, ECG signals transmitted was recovered with less deterioration and can be efficiently used for diagnosis.
  • Resisting Proxy based Mimicking Attacks and Anti-attacks in Cyberspace
    A.Joshi, P.V.Meenakshi and K.S.Keerthana, Panimalar Institute of Technology, India
    Botnets have become major engines for malicious activities in cyberspace nowadays. To sustain their botnets and disguise their malicious actions, botnet owners are mimicking legitimate cyber behaviour to fly under radar. This poses a critical challenge in anomaly detection. First of all, we establish a semi- Markov model for browsing behaviour. Based on this model it is impossible to detect mimicking attacks based on statistics if the number of active bots of the attacking botnet is sufficiently large. However, we also find it is hard for botnet owners to satisfy the condition to carry out a mimicking attack most of the time. With this new finding, we conclude that mimicking attacks can be discriminated from genuine flash crowds using second order statistical metrics. We define a new fine correntropy metrics and show its effectiveness compared to others.
  • A Self Adaptive SAR Scheduling For Estimating a Process in File Sharing
    R.Saranya and S.Muthukumarasamy, S.A Engineering College, India
    The Task programming could be a formal event for the act of network infrastructure, just in case of the unstable nature of the network environments, reality of users request and dependency of load the network should offer convenient quality of service for managing the hundreds. The file sharing could be an extremely popular web service within the recent years the load equalization is changing into a troublesome issue as these facilities extents. The server ineffectual to tolerate the load given by the users and does not manufacture a response in an exceedingly restricted quantity of the time underneath the circumstances of traffic. During this work the SAR programming is completed to scale back the work load of a server by analyzing the performance of client machine by victimization the activity factors. The server is split into several varieties of sub servers. The sync algorithmic program establishes an association between client and server to associate the methods. When the completion of all methods the files is with success received by the users in economical approach.
  • Design and Implementation of Truncated Multiplier in FIR Filter
    R.Muthammal and Sandhya S, GKM College of Engineering and Technology, India
    Low-cost finite impulse response (FIR) designs are presented using the concept of faithfully rounded truncated multiplier. This multiplier design is usually considered where the maximum absolute error is no more than 1 unit of least position. And also this truncated multipliers offer significant improvement in area, delay and power. The proposed method jointly consider the deletion, reduction, truncation and rounding of partial product bits in order to minimize the number of full adders and half adders during tree reduction. In addition, the truncated multiplier design also has smaller delay due to the smaller bit width in the final carry-propagate adder. In previous papers truncation error is reduced by adding error compensation circuits in fixed width multiplier to get a precised output. But here, there is no need of error compensation circuits and the final output will be precised. The proposed filter using truncated multiplier will be designed using VerilogHDL and synthesis using ISE Simulator (ISIM) and simulate it using MODELSIM ALTERA 6.4a (Quartus II 9.2i).It achieves best area and power result when compared with previous FIR design approaches.
  • A Comprehensive Performance Analysis of Chaotic Colour Image Encryption Algorithms based on its Cryptographic Requirements
    K.S.Tamilkodi and N. Rama, Presidency College, India
    As we live and revel in a digital age, the day to day transmission of multimedia data over the internet is beyond our imaginations. Consequently, the increased risk of losing or altering the data during transit is more. Protection of this multimedia data (audio,speech, image, and video) becomes one of the major security concerns, because millions of Internet users worldwide, are infringing digital rights daily, by downloading multimedia content illegally from the Internet. The image protection is very important, as the image transmission covers the highest percentage of the multimedia data. Image encryption is one of the ways out to achieve this. Our world, built upon the concept of progression and advancement, has entered a new scientific realm known as Chaos theory. Chaotic encryption is one of the best alternative ways to ensure security. Many image encryption schemes using chaotic maps have been proposed, because of its extreme sensitivity to initial conditions, unpredictability and random like behaviors etc. Each one of them has its own strength and weakness. In this paper, some existing chaos based colour image encryption schemes are classified and analyzed with respect to various parameters like implementation, key management and security analysis to fulfill some basic cryptographic requirements for chaos based image encryption algorithms from the year 2010 to 2014.



AIRCC Library


Technically Sponsored by