Pub Date : 2015-08-20DOI: 10.1109/IC3.2015.7346735
R. Arora, S. Goel
Since more than a few decades now, Software Configuration Management (SCM) systems have played a key role in orchestrating concurrent activities of collaborative developers. These SCM systems help in maintaining consistency of volatile codebases that are being frequently modified in order to accommodate change. Additionally, various Collaborative Software Development (CSD) tools have been developed to supplement the underlying SCMs, and provide workspace awareness information to software developers. These tools inform developers about possibilities of arising inconsistencies in project codebase due to concurrent activities by collaborative developers on shared artifacts. This paper elaborates on scenarios of collaborative activities of software developers that introduce syntactic and semantic inconsistencies in the project repositories. Furthermore, a discussion on the current state-of-art research in the area of CSD tools is presented, together with their major contributions. The paper identifies, the crucial problem of semantic inconsistencies caused due to behavioral changes on artifacts that has not been sufficiently addressed by existing CSD tools. Finally, a novel method to capture indirect conflicts (syntactic and semantic) is proposed which uses dependency graphs, with proposed additional notations.
{"title":"Investigating syntactic and semantic inconsistencies in Collaborative Software Development","authors":"R. Arora, S. Goel","doi":"10.1109/IC3.2015.7346735","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346735","url":null,"abstract":"Since more than a few decades now, Software Configuration Management (SCM) systems have played a key role in orchestrating concurrent activities of collaborative developers. These SCM systems help in maintaining consistency of volatile codebases that are being frequently modified in order to accommodate change. Additionally, various Collaborative Software Development (CSD) tools have been developed to supplement the underlying SCMs, and provide workspace awareness information to software developers. These tools inform developers about possibilities of arising inconsistencies in project codebase due to concurrent activities by collaborative developers on shared artifacts. This paper elaborates on scenarios of collaborative activities of software developers that introduce syntactic and semantic inconsistencies in the project repositories. Furthermore, a discussion on the current state-of-art research in the area of CSD tools is presented, together with their major contributions. The paper identifies, the crucial problem of semantic inconsistencies caused due to behavioral changes on artifacts that has not been sufficiently addressed by existing CSD tools. Finally, a novel method to capture indirect conflicts (syntactic and semantic) is proposed which uses dependency graphs, with proposed additional notations.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"17 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":"132701123","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.7346709
Gaurav Dubey, Vikram Khurana, Shelly Sachdeva
Database maintenance has become an important issue in today's world. Addition or alteration of any field to an existing database schema cost high to a corporation. Whenever new data types are introduced or existing types are modified in a conventional relational database system, the physical design of the database must be changed accordingly. For this reason, it is desirable that a database should be flexible and allow for modification and addition of new types of data without having to change the physical database schema. The generic model is designed to allow a wide variety of data to be accommodated in a general purpose set of data structures. This generic mechanism for data storage has been used in various information systems such as banking, defense, e-commerce and especially healthcare domain. But, addressing security on generic databases is a challenging task. To the best of our knowledge, applying security on generic database has not been addressed yet. Various cryptographic security techniques, such as hashing algorithms, public and private key algorithms, have already been applied on a database. In this paper, we are proposing an extra layer of security to the existing databases, through Negative Database technique. The advantages of the negative database approach on generic database has been demonstrated and emphasized. Correspondingly, the complexity of the proposed algorithm has been computed.
{"title":"Implementing security technique on generic database","authors":"Gaurav Dubey, Vikram Khurana, Shelly Sachdeva","doi":"10.1109/IC3.2015.7346709","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346709","url":null,"abstract":"Database maintenance has become an important issue in today's world. Addition or alteration of any field to an existing database schema cost high to a corporation. Whenever new data types are introduced or existing types are modified in a conventional relational database system, the physical design of the database must be changed accordingly. For this reason, it is desirable that a database should be flexible and allow for modification and addition of new types of data without having to change the physical database schema. The generic model is designed to allow a wide variety of data to be accommodated in a general purpose set of data structures. This generic mechanism for data storage has been used in various information systems such as banking, defense, e-commerce and especially healthcare domain. But, addressing security on generic databases is a challenging task. To the best of our knowledge, applying security on generic database has not been addressed yet. Various cryptographic security techniques, such as hashing algorithms, public and private key algorithms, have already been applied on a database. In this paper, we are proposing an extra layer of security to the existing databases, through Negative Database technique. The advantages of the negative database approach on generic database has been demonstrated and emphasized. Correspondingly, the complexity of the proposed algorithm has been computed.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"2 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113998850","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.7346710
Jithu Raphel, P. Vinod
The proposed non-signature based system creates a meta feature space for the detection of metamorphic malware samples where three sets of features are extracted from the files: (a) branch opcodes (b) unigrams (c) bigrams. The feature space is initially pruned using Naïve Bayes method. After the rare feature elimination process, the relevant opcodes that are highly contributing towards the target class are selected, thereby forming a relevant feature set. Next phase is to remove the redundant features that are present in the relevant feature set using the Markov Blanket approach. Prominent features extracted are used for generating the training models and unseen instances are tested using the optimal models. Proposed system is capable of detecting the NGVCK viruses and MWORM with an accuracy of 100% using the meta opcode space of 25 features. A promising F1-score of 1.0 was gained and the results demonstrate the efficiency of the proposed metamorphic malware detector.
{"title":"Pruned feature space for metamorphic malware detection using Markov Blanket","authors":"Jithu Raphel, P. Vinod","doi":"10.1109/IC3.2015.7346710","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346710","url":null,"abstract":"The proposed non-signature based system creates a meta feature space for the detection of metamorphic malware samples where three sets of features are extracted from the files: (a) branch opcodes (b) unigrams (c) bigrams. The feature space is initially pruned using Naïve Bayes method. After the rare feature elimination process, the relevant opcodes that are highly contributing towards the target class are selected, thereby forming a relevant feature set. Next phase is to remove the redundant features that are present in the relevant feature set using the Markov Blanket approach. Prominent features extracted are used for generating the training models and unseen instances are tested using the optimal models. Proposed system is capable of detecting the NGVCK viruses and MWORM with an accuracy of 100% using the meta opcode space of 25 features. A promising F1-score of 1.0 was gained and the results demonstrate the efficiency of the proposed metamorphic malware detector.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"4 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":"114008711","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.7346649
R. Kapur
The era of cloud based multimedia applications has lead to a huge increase in the no. of requests on cloud. The increased no. of requests on cloud leads to an increased workload, making workload balancing an important QoS Parameter. Workload Balancing also leads to a judicious use of resources like electricity etc. and thus promotes the concept of Green IT. The paper presents a new Load Balanced Resource Scheduling Algorithm (LBRS) which performs the resource scheduling in a balanced banner. The simulations and results demonstrated in the paper prove that the LBRS algorithm outperforms an existing approach.
{"title":"A workload balanced approach for resource scheduling in cloud computing","authors":"R. Kapur","doi":"10.1109/IC3.2015.7346649","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346649","url":null,"abstract":"The era of cloud based multimedia applications has lead to a huge increase in the no. of requests on cloud. The increased no. of requests on cloud leads to an increased workload, making workload balancing an important QoS Parameter. Workload Balancing also leads to a judicious use of resources like electricity etc. and thus promotes the concept of Green IT. The paper presents a new Load Balanced Resource Scheduling Algorithm (LBRS) which performs the resource scheduling in a balanced banner. The simulations and results demonstrated in the paper prove that the LBRS algorithm outperforms an existing approach.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"602 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":"116338157","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.7346680
P. Pradhan, A. Dwivedi, S. K. Rath
Present day software engineering concept gives emphasis on the use of design patterns for developing software which are recurring in nature. Detection of design pattern is one of the emerging field of Software Reverse Engineering. In this work, an attempt has been made to present an approach for design pattern detection with the help of Graph Isomorphism and Normalized Cross Correlation techniques. In this study, system and design pattern are presented in the form of graphs. The Graph Isomorphism technique finds the pattern subgraph in the system graph and Normalized Cross Correlation provides a way to formulate the percentage existence of the design pattern in the system. An Eclipse Plug-in i.e., ObjectAid is used to extract Unified Modeling Language (UML) class diagrams as well as eXtensible Markup Language (XML) files from the software system and design patterns. An algorithm is proposed to identify relevant information from the XML files. Then Graph Isomorphism and Normalized Cross Correlation techniques are used to find the pattern subgraph and its percentage existence in the system. This approach has been applied on four open source software tools for the evaluation of five design patterns, such as Composite, Facade, Flyweight, State, and Template Method.
{"title":"Detection of design pattern using Graph Isomorphism and Normalized Cross Correlation","authors":"P. Pradhan, A. Dwivedi, S. K. Rath","doi":"10.1109/IC3.2015.7346680","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346680","url":null,"abstract":"Present day software engineering concept gives emphasis on the use of design patterns for developing software which are recurring in nature. Detection of design pattern is one of the emerging field of Software Reverse Engineering. In this work, an attempt has been made to present an approach for design pattern detection with the help of Graph Isomorphism and Normalized Cross Correlation techniques. In this study, system and design pattern are presented in the form of graphs. The Graph Isomorphism technique finds the pattern subgraph in the system graph and Normalized Cross Correlation provides a way to formulate the percentage existence of the design pattern in the system. An Eclipse Plug-in i.e., ObjectAid is used to extract Unified Modeling Language (UML) class diagrams as well as eXtensible Markup Language (XML) files from the software system and design patterns. An algorithm is proposed to identify relevant information from the XML files. Then Graph Isomorphism and Normalized Cross Correlation techniques are used to find the pattern subgraph and its percentage existence in the system. This approach has been applied on four open source software tools for the evaluation of five design patterns, such as Composite, Facade, Flyweight, State, and Template Method.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"50 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":"128337200","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.7346724
Sunil Kumar, B. Raj
This paper presents the analytical potential modeling of Double Gate (DG) Tunnel Field Effect Transistor (TFET) at 50 nm channel length. In this model approach the channel potential is sum of a long channel potential and a short channel perturbation along with the whole structure rather than just the Si/SiO2 interface or the channel centre. For the validation of our analytical modeling approach we compared our result with reported data which verify our proposed design.
{"title":"Modeling of DG-Tunnel FET for low power VLSI circuit design","authors":"Sunil Kumar, B. Raj","doi":"10.1109/IC3.2015.7346724","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346724","url":null,"abstract":"This paper presents the analytical potential modeling of Double Gate (DG) Tunnel Field Effect Transistor (TFET) at 50 nm channel length. In this model approach the channel potential is sum of a long channel potential and a short channel perturbation along with the whole structure rather than just the Si/SiO2 interface or the channel centre. For the validation of our analytical modeling approach we compared our result with reported data which verify our proposed design.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"22 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":"133737484","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.7346663
D. Saxena, Shilpi Saxena
Cloud computing has become buzzword today. Here, dynamically scalable services and virtualized resources are provided over the internet. Cloud provides following types of services: Software-as-a-Service(SaaS), Platform-as-a-Service(PaaS) and Infrastructure-as-a-service(IaaS). This paper has prime focus on IaaS clouds which offer virtual pool of infinite, heterogeneous resources to users, that can be access on demand. The very objective of this paper is to dynamically optimize task scheduling at system level as well as user level. This paper relates advanced heuristic optimization technique i.e. Particle Swarm Optimization (PSO) which performs better computational over other evolutionary algorithm and optimization technique. In proposed algorithm, group of tasks are represented as particles, where each particle tries to reach its best position in the swarm (collection of all groups of task available for scheduling). Direction and magnitude of velocity can be performed in either of two ways: deadline based or cost based velocity updation, which altogether contributes the particle to reach its local maxima, finally reach its global maxima. This means all the available tasks are efficiently scheduled to the very best of its optimization. We recompile the cloudsim and simulate the proposed algorithm and results of this algorithm are compared with sequential task scheduling. The experimental results indicates that proposed algorithm has higher accuracy in terms of least execution time and at task execution at lower cost that considers heterogeneous resources and elasticity of IaaS clouds that can be dynamically acquired on pay-per-use basis. This algorithm is not only beneficial to user and service provider, but also provides better efficiency i.e. benefit at system level.
{"title":"Highly advanced cloudlet scheduling algorithm based on Particle Swarm Optimization","authors":"D. Saxena, Shilpi Saxena","doi":"10.1109/IC3.2015.7346663","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346663","url":null,"abstract":"Cloud computing has become buzzword today. Here, dynamically scalable services and virtualized resources are provided over the internet. Cloud provides following types of services: Software-as-a-Service(SaaS), Platform-as-a-Service(PaaS) and Infrastructure-as-a-service(IaaS). This paper has prime focus on IaaS clouds which offer virtual pool of infinite, heterogeneous resources to users, that can be access on demand. The very objective of this paper is to dynamically optimize task scheduling at system level as well as user level. This paper relates advanced heuristic optimization technique i.e. Particle Swarm Optimization (PSO) which performs better computational over other evolutionary algorithm and optimization technique. In proposed algorithm, group of tasks are represented as particles, where each particle tries to reach its best position in the swarm (collection of all groups of task available for scheduling). Direction and magnitude of velocity can be performed in either of two ways: deadline based or cost based velocity updation, which altogether contributes the particle to reach its local maxima, finally reach its global maxima. This means all the available tasks are efficiently scheduled to the very best of its optimization. We recompile the cloudsim and simulate the proposed algorithm and results of this algorithm are compared with sequential task scheduling. The experimental results indicates that proposed algorithm has higher accuracy in terms of least execution time and at task execution at lower cost that considers heterogeneous resources and elasticity of IaaS clouds that can be dynamically acquired on pay-per-use basis. This algorithm is not only beneficial to user and service provider, but also provides better efficiency i.e. benefit at system level.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"274 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":"133831494","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.7346733
Anuj Chaudhary, Deepkumar Kagathara, Vibha Patel
We present a new parallel approach of Needleman-Wunsch algorithm for global sequence alignment. This approach uses skewing transformation for traversal and calculation of the dynamic programming matrix. We compare the execution time of sequential CPU based implementation with two parallel GPU based implementations: Single-kernel invocation with lock-free block synchronization and multi-kernel invocation at block-synchronization points. Both the GPU based implementations gave upto 6 times performance improvement over the sequential CPU based implementation.
{"title":"A GPU based implementation of Needleman-Wunsch algorithm using skewing transformation","authors":"Anuj Chaudhary, Deepkumar Kagathara, Vibha Patel","doi":"10.1109/IC3.2015.7346733","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346733","url":null,"abstract":"We present a new parallel approach of Needleman-Wunsch algorithm for global sequence alignment. This approach uses skewing transformation for traversal and calculation of the dynamic programming matrix. We compare the execution time of sequential CPU based implementation with two parallel GPU based implementations: Single-kernel invocation with lock-free block synchronization and multi-kernel invocation at block-synchronization points. Both the GPU based implementations gave upto 6 times performance improvement over the sequential CPU based implementation.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"4 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":"129363450","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.7346715
Anil Kumar, R. Kala
Using manipulators to draw artistic figures is a benchmark problem in robotics. In this paper we describe a 3-link planar manipulator which draws artistic shapes or geometric shapes on a canvas. We first take a snapshot of the shape to draw from the camera and process it for finding the outer boundary or edges. The edges are mapped onto the drawing canvas. The edges are converted from Cartesian coordinate space to the configuration space of the manipulator. The joint trajectories so generated are passed to the controller as a trajectory input, which draws the shape using the end-effector or a marker in our case. Our manipulator is able to draw many shapes with high precision and speed.
{"title":"Geometric shape drawing using a 3 link planar manipulator","authors":"Anil Kumar, R. Kala","doi":"10.1109/IC3.2015.7346715","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346715","url":null,"abstract":"Using manipulators to draw artistic figures is a benchmark problem in robotics. In this paper we describe a 3-link planar manipulator which draws artistic shapes or geometric shapes on a canvas. We first take a snapshot of the shape to draw from the camera and process it for finding the outer boundary or edges. The edges are mapped onto the drawing canvas. The edges are converted from Cartesian coordinate space to the configuration space of the manipulator. The joint trajectories so generated are passed to the controller as a trajectory input, which draws the shape using the end-effector or a marker in our case. Our manipulator is able to draw many shapes with high precision and speed.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"33 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":"116090369","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.7346738
Bhoopal Rao Gangadari, S. Ahamed
Substitution Boxes play a vital role in the Rijndael algorithm of modern block ciphers. The security and efficiency of these ciphers mainly depend upon the algebraic construction of their Substitution Boxes. In this paper, the algebraic construction of the Substitution Boxes for the AES algorithm is analyzed with different irreducible polynomials. This paper emphasizes on the study of the ways of constructing the Substitution Boxes and the other important feature of a Substitution Box is how secure it is cryptographically. The cryptographic properties namely correlation immunity bias, strict avalanche criteria, non-linearity and entropy are used to evaluate the level of security for Substitution Boxes. The results show that the other irreducible polynomial equation offer better level of security compared to that of standard polynomial equation used in Advanced Encryption Standard algorithm. Moreover, the Substitution Box used in AES can be constructed with different irreducible polynomial equations.
{"title":"Analysis and algebraic construction of S-Box for AES algorithm using irreducible polynomials","authors":"Bhoopal Rao Gangadari, S. Ahamed","doi":"10.1109/IC3.2015.7346738","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346738","url":null,"abstract":"Substitution Boxes play a vital role in the Rijndael algorithm of modern block ciphers. The security and efficiency of these ciphers mainly depend upon the algebraic construction of their Substitution Boxes. In this paper, the algebraic construction of the Substitution Boxes for the AES algorithm is analyzed with different irreducible polynomials. This paper emphasizes on the study of the ways of constructing the Substitution Boxes and the other important feature of a Substitution Box is how secure it is cryptographically. The cryptographic properties namely correlation immunity bias, strict avalanche criteria, non-linearity and entropy are used to evaluate the level of security for Substitution Boxes. The results show that the other irreducible polynomial equation offer better level of security compared to that of standard polynomial equation used in Advanced Encryption Standard algorithm. Moreover, the Substitution Box used in AES can be constructed with different irreducible polynomial equations.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"8 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":"122166050","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
扫码关注我们
求助内容：
应助结果提醒方式：