{"title":"Implementation of stream cipher system based on representation of integers in Residue Number System","authors":"Ganesh Aithal, K. Bhat, U. Sripathi","doi":"10.1109/IADCC.2010.5423007","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423007","url":null,"abstract":"Residue Number Systems (RNS) based on Chinese Remainder Theorem (CRT) permits the representation of large integers in terms of combinations of smaller ones. The set of all integers from 0 to M-1 with RNS representation and component wise modular addition and multiplication constitutes direct sum of smaller commutative rings. Encryption and decryption algorithm based on the properties of direct sum of smaller rings offers distinct advantages over decimal or fixed radix arithmetic. In this paper representation of integer using RNS, is successfully utilized in additive, multiplicative and affine stream cipher systems. The property of the cipher system based on RNS number system allow speeding up the encryption / decryption algorithm, reduce the time complexity and provides immunity to side channel, algebraic, and known plain text attacks. In this paper, the characteristics of additive, multiplicative and affine stream cipher systems, the key generation, and encryption and decryption based on RNS number system representation are discussed.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":" 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120832411","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Hybrid channel allocation in wireless network using evolutionary strategy","authors":"S. Shinde, G. Chowdhary, M. Dhore, A. Shinde","doi":"10.1109/IADCC.2010.5423036","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423036","url":null,"abstract":"Radio spectrum is limited resource in wireless mobile communication system. Cellular system has to serve the maximum possible number of calls while the number of channels available is limited. Hence the problem of determining an optimal allocation of channels to mobile users that minimizes call-blocking and call-dropping probabilities is of paramount importance. This paper proposes a hybrid channel allocation model using an evolutionary strategy with an allocation distance to give efficient use of frequency spectrum.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"11255 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131242990","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A parallel algorithm for outline capturing system for object recognition","authors":"A. Gopal, S. Patil, A. Nikam","doi":"10.1109/IADCC.2010.5423046","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423046","url":null,"abstract":"Computer vision involves image edge detection which is crucial in outline capturing systems for decomposing and describing an object. This paper presents a scalable parallel algorithm skeleton for outline capturing and object recognition based on first order difference chain encoding. UNIX based Intel Xeon 2-Quadra-Core system is used for the implementation of the parallel algorithm. The algorithm complexity of the averaging process is independent of the size of image and, the speedup of the proposed parallel algorithm is observed to be near linear. The parallel processing approach presented here can be extended to solve similar problems such as, image representation, restoration, compression, matching etc.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133958147","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An improved design approach in spatial databases using frequent Association Rule Mining algorithm","authors":"A. Tripathy, Subhalaxmi Das, P. Patra","doi":"10.1109/IADCC.2010.5422905","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422905","url":null,"abstract":"Recently Negative Association Rule Mining (NARM) has become a focus in the field of spatial data mining. Negative association rules are useful in data analysis to identify objects that conflict with each other or that complement each other. Much effort has been devoted for developing algorithms for efficiently discovering relation between objects in space. All the traditional association rule mining algorithms were developed to find positive associations between objects. By positive correlation we refer to associations between frequently occurring objects in space such as a city is always located near a river and so on. Recently the problem of identifying negative associations (or “dissociations”) that is absence of objects has been explored and considered relevant. This paper presents an improved design approach for mining both positive and negative association rules in spatial databases. This approach extends traditional association rules to include negative association rules using a minimum support count. Experimental results show that this approach is efficient on simple and sparse datasets when minimum support is high to some degree, and it overcomes some limitations of the previous mining methods. The proposed form will extend related applications of negative association rules to a greater extent.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133823072","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Dishant Ailawadi, Milan Kumar Mohapatra, A. Mittal
{"title":"Frame-based parallelization of MPEG-4 on compute unified device architecture (CUDA)","authors":"Dishant Ailawadi, Milan Kumar Mohapatra, A. Mittal","doi":"10.1109/IADCC.2010.5422997","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422997","url":null,"abstract":"Due to its object based nature, flexible features and provision for user interaction, MPEG-4 encoder is highly suitable for parallelization. The most critical and time-consuming operation of encoder is motion estimation. Nvidia's general-purpose graphical processing unit (GPGPU) architecture allows for a massively parallel stream processor model at a very cheap price (in a few thousands Rupees). However synchronization of parallel calculations and repeated device to host data transfer is a major challenge in parallelizing motion estimation on CUDA. Our solution employs optimized and balanced parallelization of motion estimation on CUDA. This paper discusses about frame-based parallelization wherein parallelization is done at two levels - at macroblock level and at search range level. We propose a further division of macroblock to optimize parallelization. Our algorithm supports real-time processing and streaming for key applications such as e-learning, telemedicine and video-surveillance systems, as demonstrated by experimental results.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130124364","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Fault tolerant application execution model in computing grid","authors":"Major Singh, L. Kaur","doi":"10.1109/IADCC.2010.5422939","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422939","url":null,"abstract":"Performance and availability of resources cannot be guaranteed in the highly distributed and decentralized grid environment. For a reliable application execution in grid, mechanisms are needed to minimize or neutralize the effects of resource related faults and their volunteer leaving or joining the grid. In this paper a fault tolerant application execution model for grid has been investigated. The proposed model is an efficient solution towards resource usage and application execution cost. Analytical study of the reliability for the proposed model is specified. Illustrative examples are also presented.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114599403","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A flow based anomaly detection system using chi-square technique","authors":"M. N, Arun Parmar, Manish Kumar","doi":"10.1109/IADCC.2010.5422996","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422996","url":null,"abstract":"Various tools, which are capable to evade different security mechanisms like firewall, IDS and IPS, exist and that helps the intruders for sending malicious traffic to the network or system. So, inspection of malicious traffic and identification of anomalous activity is very much essential to stop future activity of intruders which can be a possible attack. In this paper we present a flow based system to detect anomalous activity by using IP flow characteristics with chi-square detection mechanism. This system provides solution to identify anomalous activities like scan and flood attack by means of automatic behavior analysis of the network traffic and also give detailed information of attacker, victim, type and time of the attack which can be used for corresponding defense. Anomaly Detection capability of the proposed system is compared with SNORT Intrusion detection system and results prove the very high detection rate of the system over SNORT for different scan and flood attack. The proposed system detects different stealth scan and malformed packets scan. Since the probability of using stealth scan in real attack is very high, this system can identify the real attacks in the initial stage itself and preventive action can be taken.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133387448","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
R. Kar, V. Maheshwari, M. Maqbool, A. K. Mal, A. Bhattacharjee
{"title":"A closed form delay evaluation approach using burr's distribution function for high speed on-chip RC interconnects","authors":"R. Kar, V. Maheshwari, M. Maqbool, A. K. Mal, A. Bhattacharjee","doi":"10.1007/978-3-642-12214-9_13","DOIUrl":"https://doi.org/10.1007/978-3-642-12214-9_13","url":null,"abstract":"","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"241 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123617077","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An autonomic computing approach to Enterprise Management","authors":"M. Manuja, Rajender Kalra","doi":"10.1109/IADCC.2010.5422925","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422925","url":null,"abstract":"Autonomic Computing is the practice to reduce complexity involved in integrated systems across an enterprise. It is the term associated with a system capable of operating and managing on its own [1]. A business establishment is composed of a variety of legacy and contemporary systems. The operation and maintenance of such systems can be eased if we integrate them and develop a temperate system. An Enterprise Management infrastructure is a copybook example of a system where autonomic computing can prove vital. Such a system will have the capability to take action and provide relevant information to people in various roles in an office. It will employ the business rules stored in it and the business intelligence capabilities of the subsystems involved. An autonomic Enterprise Management system will thus carry out management of various functions related to the enterprise and its employee. The information will be presented using the rich client interfaces as and when necessary. The paper suggests a model for Enterprise Management which has been implemented using the autonomic computing principle.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130325377","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Effect of routing misbehavior in mobile ad hoc network","authors":"R. Nath, Pankaj Kumar Sehgal, Atul Sethi","doi":"10.1109/IADCC.2010.5423008","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423008","url":null,"abstract":"Mobile ad hoc networks are infrastructure-free, pervasive and ubiquitous in nature, without any centralized authority. These characteristics tied with the growing concerns for security attacks. This paper provides simulation experiments that describe various routing misbehavior that are specific to MANET and the effects of these routing attacks on the network performance. The paper is focused on the evaluation of network performance in terms of packet delivery fraction, average end-to-end delay and global throughput of a mobile ad hoc network where a defined percentage of nodes behave maliciously. The simulation results show that network operation and network performance severely degrade when no countermeasures are taken.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129145630","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}