Pub Date : 2015-08-20DOI: 10.1109/IC3.2015.7346691
Sarthak Singhal, P. Ralhan, Nishtha Jatana
Diabetes Mellitus is a hazardous disease plaguing many humans in the world and it is caused due to high Blood Glucose Levels (BGL). Patients with diabetes need to regularly check their BGL in order to stay safe. Through this paper, we aim to provide a medical image processing system based on colorimetric detection particularly for diabetic patients that will measure the blood glucose levels by scanning an image of the visual glucose test strip using a smart-phone. The proposed technique measures the color change of the scanned test strip by using HSV and CIELAB color model based processing wherein concepts of color-gradient and CIEDE2000 color-difference formulas are applied. The technique was implemented in an Android based environment and tested using Accu-Chek active visual test strips along with its corresponding reference color chart. The results of the experiment show that such technique has promising capability to measure BGL in humans. Further, such technique can be also applied for any other visual medical test strips or even for other measurements which are calculated using a color metric.
{"title":"Smartphone-based colorimetric detection to measure Blood Glucose Levels","authors":"Sarthak Singhal, P. Ralhan, Nishtha Jatana","doi":"10.1109/IC3.2015.7346691","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346691","url":null,"abstract":"Diabetes Mellitus is a hazardous disease plaguing many humans in the world and it is caused due to high Blood Glucose Levels (BGL). Patients with diabetes need to regularly check their BGL in order to stay safe. Through this paper, we aim to provide a medical image processing system based on colorimetric detection particularly for diabetic patients that will measure the blood glucose levels by scanning an image of the visual glucose test strip using a smart-phone. The proposed technique measures the color change of the scanned test strip by using HSV and CIELAB color model based processing wherein concepts of color-gradient and CIEDE2000 color-difference formulas are applied. The technique was implemented in an Android based environment and tested using Accu-Chek active visual test strips along with its corresponding reference color chart. The results of the experiment show that such technique has promising capability to measure BGL in humans. Further, such technique can be also applied for any other visual medical test strips or even for other measurements which are calculated using a color metric.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117127390","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}
Click fraud represents a serious drain on advertising budgets and can seriously harm the viability of the internet advertising market. This paper proposes a novel framework for prediction of click fraud in mobile advertising which consists of feature selection using Recursive Feature Elimination (RFE) and classification through Hellinger Distance Decision Tree (HDDT).RFE is chosen for the feature selection as it has given better results as compared to wrapper approach when evaluated using different classifiers. HDDT is also selected as classifier to deal with class imbalance issue present in the data set. The efficiency of proposed framework is investigated on the data set provided by Buzzcity and compared with J48, Rep Tree, logitboost, and random forest. Results show that accuracy achieved by proposed framework is 64.07 % which is best as compared to existing methods under study.
{"title":"Prediction of click frauds in mobile advertising","authors":"Mayank Taneja, Kavyanshi Garg, Archana Purwar, Samarth Sharma","doi":"10.1109/IC3.2015.7346672","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346672","url":null,"abstract":"Click fraud represents a serious drain on advertising budgets and can seriously harm the viability of the internet advertising market. This paper proposes a novel framework for prediction of click fraud in mobile advertising which consists of feature selection using Recursive Feature Elimination (RFE) and classification through Hellinger Distance Decision Tree (HDDT).RFE is chosen for the feature selection as it has given better results as compared to wrapper approach when evaluated using different classifiers. HDDT is also selected as classifier to deal with class imbalance issue present in the data set. The efficiency of proposed framework is investigated on the data set provided by Buzzcity and compared with J48, Rep Tree, logitboost, and random forest. Results show that accuracy achieved by proposed framework is 64.07 % which is best as compared to existing methods under study.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126121915","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}
Pub Date : 2015-08-20DOI: 10.1109/IC3.2015.7346742
Swaminathan Jayaraman, D. Hari, B. Jayaraman
We present a novel framework for formal verification of run-time behaviour of Java programs. We focus on the class of programs with a repetitive behaviour, such as servers and interactive programs, including programs exhibiting concurrency and non-determinism. The design-time specifications for such programs can be specified as UML-like finite-state diagrams, or Kripke structures, in the terminology of model checking. In order to verify the run-time behavior of a Java program, we extract a state diagram from the execution trace of the Java program and check whether the run-time state diagram is consistent with the design-time diagram. We have implemented this framework as an extension of JIVE (Java Interactive Visualization Environment), a state-of-the-art dynamic analysis and visualization tool which constructs object, sequence, and state diagrams for Java program executions. JIVE is available as an open-source plugin for Eclipse and makes available the execution trace for facilitating analyses of program executions. We have tested our extension on a number of programs, and our experiments show that our methodology is effective in helping close the gap between the design and implementation of Java programs.
{"title":"Consistency of Java run-time behavior with design-time specifications","authors":"Swaminathan Jayaraman, D. Hari, B. Jayaraman","doi":"10.1109/IC3.2015.7346742","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346742","url":null,"abstract":"We present a novel framework for formal verification of run-time behaviour of Java programs. We focus on the class of programs with a repetitive behaviour, such as servers and interactive programs, including programs exhibiting concurrency and non-determinism. The design-time specifications for such programs can be specified as UML-like finite-state diagrams, or Kripke structures, in the terminology of model checking. In order to verify the run-time behavior of a Java program, we extract a state diagram from the execution trace of the Java program and check whether the run-time state diagram is consistent with the design-time diagram. We have implemented this framework as an extension of JIVE (Java Interactive Visualization Environment), a state-of-the-art dynamic analysis and visualization tool which constructs object, sequence, and state diagrams for Java program executions. JIVE is available as an open-source plugin for Eclipse and makes available the execution trace for facilitating analyses of program executions. We have tested our extension on a number of programs, and our experiments show that our methodology is effective in helping close the gap between the design and implementation of Java programs.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124594891","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}
Pub Date : 2015-08-20DOI: 10.1109/IC3.2015.7346662
Harsh M. Vyas, M. SumaS., S. Koolagudi, K. Guruprasad
In this work, an effort has been made to identify the gamakas present in a given piece of Carnatic music clip. Gamakas are the beautification elements used to improve the melody. The identification of gamaka is very important stage in note transcription. In the proposed method, features that correspond to melodic variations such as pitch and energy are used for characterizing the gamakas. The input pitch contour is modelled using Hidden Markov Model with 3 states, namely Attack, Sustain and Decay. These states correspond to ups and downs in the melody of the music. The system is validated using a comprehensive data set consisting 160 songs from 8 different ragas. The average accuracy of 75.86% is achieved using this method.
{"title":"Identifying gamakas in Carnatic music","authors":"Harsh M. Vyas, M. SumaS., S. Koolagudi, K. Guruprasad","doi":"10.1109/IC3.2015.7346662","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346662","url":null,"abstract":"In this work, an effort has been made to identify the gamakas present in a given piece of Carnatic music clip. Gamakas are the beautification elements used to improve the melody. The identification of gamaka is very important stage in note transcription. In the proposed method, features that correspond to melodic variations such as pitch and energy are used for characterizing the gamakas. The input pitch contour is modelled using Hidden Markov Model with 3 states, namely Attack, Sustain and Decay. These states correspond to ups and downs in the melody of the music. The system is validated using a comprehensive data set consisting 160 songs from 8 different ragas. The average accuracy of 75.86% is achieved using this method.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124755597","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}
Pub Date : 2015-08-20DOI: 10.1109/IC3.2015.7346686
Manju Venugopalan, Deepa Gupta
The growing popularity of microblogging websites has transformed these into rich resources for sentiment mining. Even though opinion mining has more than a decade of research to boost about, it is mostly confined to the exploration of formal text patterns like online reviews, news articles etc. Exploration of the challenges offered by informal and crisp microblogging have taken roots but there is scope for a large way ahead. The proposed work aims at developing a hybrid model for sentiment classification that explores the tweet specific features and uses domain independent and domain specific lexicons to offer a domain oriented approach and hence analyze and extract the consumer sentiment towards popular smart phone brands over the past few years. The experiments have proved that the results improve by around 2 points on an average over the unigram baseline.
{"title":"Exploring sentiment analysis on twitter data","authors":"Manju Venugopalan, Deepa Gupta","doi":"10.1109/IC3.2015.7346686","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346686","url":null,"abstract":"The growing popularity of microblogging websites has transformed these into rich resources for sentiment mining. Even though opinion mining has more than a decade of research to boost about, it is mostly confined to the exploration of formal text patterns like online reviews, news articles etc. Exploration of the challenges offered by informal and crisp microblogging have taken roots but there is scope for a large way ahead. The proposed work aims at developing a hybrid model for sentiment classification that explores the tweet specific features and uses domain independent and domain specific lexicons to offer a domain oriented approach and hence analyze and extract the consumer sentiment towards popular smart phone brands over the past few years. The experiments have proved that the results improve by around 2 points on an average over the unigram baseline.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127679952","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}
Pub Date : 2015-08-20DOI: 10.1109/IC3.2015.7346656
Surbhi Kapoor, Chetna Dabas
For a cloud datacenter the biggest issue is how to tackle billions of requests coming dynamically from the end users. To handle such requests efficiently and effectively, there is a need to distribute the load evenly among the cloud nodes. To achieve this goal, various load balancing approaches have been proposed in the past years. Load balancing strategies aim at achieving high user satisfaction by minimizing response time of the tasks and improving resource utilization through even and fair allocation of cloud resources. The traditional Throttled load balancing algorithm is a good approach for load balancing in cloud computing as it distributes the incoming jobs evenly among the VMs. But the major drawback is that this algorithm works well for environments with homogeneous VMS, does not considers the resource specific demands of the tasks and has additional overhead of scanning the entire list of VMs every time a task comes. In this paper, these issues have been addressed by proposing an algorithm Cluster based load balancing which works well in heterogeneous nodes environment, considers resource specific demands of the tasks and reduces scanning overhead by dividing the machines into clusters. Experimental results have shown that our algorithm gives better results in terms of waiting time, execution time, turnaround time and throughput as compared to existing throttled and modified throttled algorithms.
{"title":"Cluster based load balancing in cloud computing","authors":"Surbhi Kapoor, Chetna Dabas","doi":"10.1109/IC3.2015.7346656","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346656","url":null,"abstract":"For a cloud datacenter the biggest issue is how to tackle billions of requests coming dynamically from the end users. To handle such requests efficiently and effectively, there is a need to distribute the load evenly among the cloud nodes. To achieve this goal, various load balancing approaches have been proposed in the past years. Load balancing strategies aim at achieving high user satisfaction by minimizing response time of the tasks and improving resource utilization through even and fair allocation of cloud resources. The traditional Throttled load balancing algorithm is a good approach for load balancing in cloud computing as it distributes the incoming jobs evenly among the VMs. But the major drawback is that this algorithm works well for environments with homogeneous VMS, does not considers the resource specific demands of the tasks and has additional overhead of scanning the entire list of VMs every time a task comes. In this paper, these issues have been addressed by proposing an algorithm Cluster based load balancing which works well in heterogeneous nodes environment, considers resource specific demands of the tasks and reduces scanning overhead by dividing the machines into clusters. Experimental results have shown that our algorithm gives better results in terms of waiting time, execution time, turnaround time and throughput as compared to existing throttled and modified throttled algorithms.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133951619","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}
Pub Date : 2015-08-20DOI: 10.1109/IC3.2015.7346685
D. Gupta, Chand Anand, Tejas Dewan
This paper shows an enhanced heuristic approach of grey wolf optimizer and simulated annealing in order to find optimum solution for Travelling Tournament Problem. In this paper, we tackle the mirrored version of TTP. We use a fast constructive heuristic algorithm to generate schedules. Later we integrate an enhanced heuristic approach of simulated annealing based on prey proximity model of Grey Wolf Optimizer to obtain least cost tournament schedule. We upgrade the position updating step of GWO by using probabilistic methods and hybridize it with SA to solve TTP and avoid getting stuck in local minima. Our proposed hybrid algorithm converges to an optimum solution for TTP. We calculate the overall cost of TTP and compare the performance of our alorithm with other metaheuristic algorithms like MBBO/ESA, BBO/SA, ACO and PSO.
{"title":"Enhanced heuristic approach for Traveling Tournament Problem based on Grey Wolf Optimizer","authors":"D. Gupta, Chand Anand, Tejas Dewan","doi":"10.1109/IC3.2015.7346685","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346685","url":null,"abstract":"This paper shows an enhanced heuristic approach of grey wolf optimizer and simulated annealing in order to find optimum solution for Travelling Tournament Problem. In this paper, we tackle the mirrored version of TTP. We use a fast constructive heuristic algorithm to generate schedules. Later we integrate an enhanced heuristic approach of simulated annealing based on prey proximity model of Grey Wolf Optimizer to obtain least cost tournament schedule. We upgrade the position updating step of GWO by using probabilistic methods and hybridize it with SA to solve TTP and avoid getting stuck in local minima. Our proposed hybrid algorithm converges to an optimum solution for TTP. We calculate the overall cost of TTP and compare the performance of our alorithm with other metaheuristic algorithms like MBBO/ESA, BBO/SA, ACO and PSO.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134343696","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}
Pub Date : 2015-08-20DOI: 10.1109/IC3.2015.7346658
Joydeep Tamuli, Aishwarya Jain, A. V. Dhan, Anupama Bhan, M. Dutta
Inflammation of the conjunctiva and pain and discomfort in the inner surface of the eyelids is referred to as Conjunctivitis. It causes severe pain, burning sensation or in extreme cases blindness of the eye. Normally conjunctivitis is detected by eye specialist doctors and their limited number makes it difficult for everyone to reach them and get themselves diagnosed. This paper describes an automatic efficient image processing based method to identify conjunctivitis infected eye from a normal eye and classify it according to its types. Some statistical and texture features were used and then followed by PCA for extraction of discriminatory features and then classified using supervised learning method such as multi-class SVM and KNN. The intensity of the infected eyes were also calculated using the significant red plane. Plotconfusion was used to calculate the accuracy and a high accuracy was achieved using this method. Also in addition this proposed method is efficient, computationally fast and costs very low.
{"title":"An image processing based method to identify and grade conjunctivitis infected eye according to its types and intensity","authors":"Joydeep Tamuli, Aishwarya Jain, A. V. Dhan, Anupama Bhan, M. Dutta","doi":"10.1109/IC3.2015.7346658","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346658","url":null,"abstract":"Inflammation of the conjunctiva and pain and discomfort in the inner surface of the eyelids is referred to as Conjunctivitis. It causes severe pain, burning sensation or in extreme cases blindness of the eye. Normally conjunctivitis is detected by eye specialist doctors and their limited number makes it difficult for everyone to reach them and get themselves diagnosed. This paper describes an automatic efficient image processing based method to identify conjunctivitis infected eye from a normal eye and classify it according to its types. Some statistical and texture features were used and then followed by PCA for extraction of discriminatory features and then classified using supervised learning method such as multi-class SVM and KNN. The intensity of the infected eyes were also calculated using the significant red plane. Plotconfusion was used to calculate the accuracy and a high accuracy was achieved using this method. Also in addition this proposed method is efficient, computationally fast and costs very low.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127632695","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}
Pub Date : 2015-08-20DOI: 10.1109/IC3.2015.7346741
Deepti Agarwal, S. Sharma, Kavita Pandey
VANET are the systems used to collaborate the wireless devices installed on the vehicles, for transfer of messages. The implementation of algorithms on VANET in actual device is preceded by simulation of the same on a simulating environment like OMNeT++, SUMO, etc. This paper presents a study and implementation of VANET Broadcasting algorithms, and algorithms which are able to solve the problem of broadcast storming. With efficient use of resources, the transmission of signals to the different vehicles have been scalable to be broadcasted using two protocols namely, N-Hops Weighted p-persistence Broadcasting which is able to disseminate the data to different vehicles in all the regions covering the broadcast range. Another algorithm is Street Broadcast Reduction, which covers the area through different roads and effectively send the warning and alert messages to the vehicles, using the distance based schemes. The problems in VANET broadcast has been addressed, and have been implemented using OMNeT++, SUMO and Google Earth.
{"title":"N-Hop broadcast and Street Broadcast Reduction algorithm using OMNeT++ and Google Earth plugin","authors":"Deepti Agarwal, S. Sharma, Kavita Pandey","doi":"10.1109/IC3.2015.7346741","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346741","url":null,"abstract":"VANET are the systems used to collaborate the wireless devices installed on the vehicles, for transfer of messages. The implementation of algorithms on VANET in actual device is preceded by simulation of the same on a simulating environment like OMNeT++, SUMO, etc. This paper presents a study and implementation of VANET Broadcasting algorithms, and algorithms which are able to solve the problem of broadcast storming. With efficient use of resources, the transmission of signals to the different vehicles have been scalable to be broadcasted using two protocols namely, N-Hops Weighted p-persistence Broadcasting which is able to disseminate the data to different vehicles in all the regions covering the broadcast range. Another algorithm is Street Broadcast Reduction, which covers the area through different roads and effectively send the warning and alert messages to the vehicles, using the distance based schemes. The problems in VANET broadcast has been addressed, and have been implemented using OMNeT++, SUMO and Google Earth.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126528403","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}
Pub Date : 2015-08-20DOI: 10.1109/IC3.2015.7346740
Ashish Jain, N. Chaudhari
Computational complexity of order 256n to solve the knapsack cipher 0/255 (or improved knapsack cipher) recently suggested by Pham is optimistic result. In this paper, we systematically analyze the improved knapsack cipher in relation to the complexity claims. During the analysis of the improved knapsack cipher, we examined that the public key size must be large to satisfy the constraint of complexity. Though we chose keys of large sizes, the improved knapsack cipher is not safe and its security is compromised by lattice-based attacks. Furthermore, the cipher lost its practicality, since the use of large size public keys. Hence, we identify a construction of practical knapsack cipher 0/f, characterize its requirements and demonstrate asymptotically, that the computational complexity of the knapsack cipher 0/f and knapsack cipher 0/1 (basic or sum-of-subset cipher) is equal. It is worth pointing out that the proposed knapsack cipher 0/f is a compact and viable option to use as a building block for security purpose in resource-constrained devices such as RFID tags, smart cards and the like.
{"title":"Analysis of the improved knapsack cipher","authors":"Ashish Jain, N. Chaudhari","doi":"10.1109/IC3.2015.7346740","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346740","url":null,"abstract":"Computational complexity of order 256n to solve the knapsack cipher 0/255 (or improved knapsack cipher) recently suggested by Pham is optimistic result. In this paper, we systematically analyze the improved knapsack cipher in relation to the complexity claims. During the analysis of the improved knapsack cipher, we examined that the public key size must be large to satisfy the constraint of complexity. Though we chose keys of large sizes, the improved knapsack cipher is not safe and its security is compromised by lattice-based attacks. Furthermore, the cipher lost its practicality, since the use of large size public keys. Hence, we identify a construction of practical knapsack cipher 0/f, characterize its requirements and demonstrate asymptotically, that the computational complexity of the knapsack cipher 0/f and knapsack cipher 0/1 (basic or sum-of-subset cipher) is equal. It is worth pointing out that the proposed knapsack cipher 0/f is a compact and viable option to use as a building block for security purpose in resource-constrained devices such as RFID tags, smart cards and the like.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121161331","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：