Pub Date : 2016-10-01DOI: 10.1109/CIST.2016.7805079
Khalid A. Al-Afandy, El-Sayed M. El-Rabaie, O. Faragallah, Ahmed Elmhalawy, Ghada M. El-Banby
A high security data hiding approach using image cropping and Least Significant Bit (LSB) steganography is proposed. The predefined certain secret coordinate crops are extracted from the cover image. The secret text message is divided into parts with the same image crops. Each part of the secret text message is embedded into an image crop with secret sequence using LSB approach. The embedding is done using the cover image of three color channels. The stego image is given by reassembling the image and the stego crops. A detailed comparative study is performed between the proposed approach and the other state-of-the-art approaches. This comparison is based on visualization to detect any degradation in stego image, difficulty of extracting the embedded data by any unauthorized viewer, Peak Signal-to-Noise Ratio (PSNR) of stego image, and the embedding algorithm CPU time. Experimental results shows that the proposed approach is more secure compared with the other traditional approaches.
{"title":"High security data hiding using image cropping and LSB least significant bit steganography","authors":"Khalid A. Al-Afandy, El-Sayed M. El-Rabaie, O. Faragallah, Ahmed Elmhalawy, Ghada M. El-Banby","doi":"10.1109/CIST.2016.7805079","DOIUrl":"https://doi.org/10.1109/CIST.2016.7805079","url":null,"abstract":"A high security data hiding approach using image cropping and Least Significant Bit (LSB) steganography is proposed. The predefined certain secret coordinate crops are extracted from the cover image. The secret text message is divided into parts with the same image crops. Each part of the secret text message is embedded into an image crop with secret sequence using LSB approach. The embedding is done using the cover image of three color channels. The stego image is given by reassembling the image and the stego crops. A detailed comparative study is performed between the proposed approach and the other state-of-the-art approaches. This comparison is based on visualization to detect any degradation in stego image, difficulty of extracting the embedded data by any unauthorized viewer, Peak Signal-to-Noise Ratio (PSNR) of stego image, and the embedding algorithm CPU time. Experimental results shows that the proposed approach is more secure compared with the other traditional approaches.","PeriodicalId":196827,"journal":{"name":"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126634070","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 : 2016-10-01DOI: 10.1109/CIST.2016.7804990
Derkaoui Orkia, A. Lehireche
Max-cut problem is one of many NP-hard graph theory problems which attracted many researchers over the years. Maximum cuts are useful items including theoretical physics and electronics. But they are best known for algorithmic problem of finding a maximum cutting, commonly called MAXCUT, a relatively well-studied problem, particularly in the context of the approximation. Various heuristics, or combination of optimization and heuristic methods have been developed to solve this problem. Among them is the efficient algorithm of Goemans and Williamson. Their algorithm combines Semidefinite programming and a rounding procedure to produce an approximate solution to the max-cut problem. Semidefinite Programming (SDP) is currently the most sophisticated area of Conic Programming that is polynomially solvable. The SDP problem is solved with interior point methods. In parallel, the development of efficient SDP solvers, based on interior point algorithms, also contributed to the success of this method. In this paper we use a new variant of the solver CSDP (C library for semidfinite programming) to resolve this problem. It is based on a Majorize-Minimize line search algorithm for barrier function optimization. A tangent majorant function is built to approximate a scalar criterion containing a barrier function. The comparison of the results obtained with the classic CSDP and our new variant is promising.
{"title":"Solving the max-cut problem using semidefinite optimization","authors":"Derkaoui Orkia, A. Lehireche","doi":"10.1109/CIST.2016.7804990","DOIUrl":"https://doi.org/10.1109/CIST.2016.7804990","url":null,"abstract":"Max-cut problem is one of many NP-hard graph theory problems which attracted many researchers over the years. Maximum cuts are useful items including theoretical physics and electronics. But they are best known for algorithmic problem of finding a maximum cutting, commonly called MAXCUT, a relatively well-studied problem, particularly in the context of the approximation. Various heuristics, or combination of optimization and heuristic methods have been developed to solve this problem. Among them is the efficient algorithm of Goemans and Williamson. Their algorithm combines Semidefinite programming and a rounding procedure to produce an approximate solution to the max-cut problem. Semidefinite Programming (SDP) is currently the most sophisticated area of Conic Programming that is polynomially solvable. The SDP problem is solved with interior point methods. In parallel, the development of efficient SDP solvers, based on interior point algorithms, also contributed to the success of this method. In this paper we use a new variant of the solver CSDP (C library for semidfinite programming) to resolve this problem. It is based on a Majorize-Minimize line search algorithm for barrier function optimization. A tangent majorant function is built to approximate a scalar criterion containing a barrier function. The comparison of the results obtained with the classic CSDP and our new variant is promising.","PeriodicalId":196827,"journal":{"name":"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123288759","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 : 2016-10-01DOI: 10.1109/CIST.2016.7804989
Abdelmajid Bousselham, O. Bouattane, M. Youssfi, A. Raihani
The aim of this paper is to present a new approach for improving deformable models and especially the Level Set Method (LSM) for segmentation and extraction of brain tumors in MRI (Magnetic Resonance Imaging) with more accuracy, the contribution of this work is to exploit thermal behavior of brain tumors for correcting level set contours. Human Body temperature distribution is an indicator of health condition, the brain tumor cells generate more heat than normal brain cells due to their higher metabolism and their vascular dilation. Heat distribution in human body is modeled using Pennes BioHeat Transfer Equation (PBHTE) solved by Finite Volume Method (FVM), and with the inverse analysis using Genetic Algorithm (GA) we will estimate the size and location of brain tumor, with this way Level Set Method extracts tumors contours with more accuracy and efficiency. To our knowledge, this is the first approach which introduces thermal analysis to improve the accuracy of segmentation and extraction of tumors in MRI images.
{"title":"Toward an efficient brain tumor extraction using level set method and pennes bioheat equation","authors":"Abdelmajid Bousselham, O. Bouattane, M. Youssfi, A. Raihani","doi":"10.1109/CIST.2016.7804989","DOIUrl":"https://doi.org/10.1109/CIST.2016.7804989","url":null,"abstract":"The aim of this paper is to present a new approach for improving deformable models and especially the Level Set Method (LSM) for segmentation and extraction of brain tumors in MRI (Magnetic Resonance Imaging) with more accuracy, the contribution of this work is to exploit thermal behavior of brain tumors for correcting level set contours. Human Body temperature distribution is an indicator of health condition, the brain tumor cells generate more heat than normal brain cells due to their higher metabolism and their vascular dilation. Heat distribution in human body is modeled using Pennes BioHeat Transfer Equation (PBHTE) solved by Finite Volume Method (FVM), and with the inverse analysis using Genetic Algorithm (GA) we will estimate the size and location of brain tumor, with this way Level Set Method extracts tumors contours with more accuracy and efficiency. To our knowledge, this is the first approach which introduces thermal analysis to improve the accuracy of segmentation and extraction of tumors in MRI images.","PeriodicalId":196827,"journal":{"name":"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122216417","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 : 2016-10-01DOI: 10.1109/CIST.2016.7805094
M. Oualla, A. Sadiq
In our previous work, we have proposed a new approach to detect rotated object at distinct angles using the ViolaJones detector. This approach consists in feeding the groups of Haar features presented by Viola & Jones, Lienhart and others by other features which are rotated by any angle. In this paper we have extended this set of features by others called normal and rotated asymmetric Haar features. To concretize our method, we test our algorithm on two databases (Umist and CMU-PIE), containing a set of faces attributed to many variations in scale, location, orientation (in-plane rotation), pose (out-of-plane rotation), facial expression, lighting conditions, occlusions, etc.
{"title":"Rotated asymetrique haar features for face detection","authors":"M. Oualla, A. Sadiq","doi":"10.1109/CIST.2016.7805094","DOIUrl":"https://doi.org/10.1109/CIST.2016.7805094","url":null,"abstract":"In our previous work, we have proposed a new approach to detect rotated object at distinct angles using the ViolaJones detector. This approach consists in feeding the groups of Haar features presented by Viola & Jones, Lienhart and others by other features which are rotated by any angle. In this paper we have extended this set of features by others called normal and rotated asymmetric Haar features. To concretize our method, we test our algorithm on two databases (Umist and CMU-PIE), containing a set of faces attributed to many variations in scale, location, orientation (in-plane rotation), pose (out-of-plane rotation), facial expression, lighting conditions, occlusions, etc.","PeriodicalId":196827,"journal":{"name":"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125721565","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 : 2016-10-01DOI: 10.1109/CIST.2016.7804961
Amina El Ouazzani, Sara Rhazlane, Nouria Harbi, Hassan Badir
Respect for privacy and data confidentiality in a company are two fundamentals that must be protected. However, a Data Warehouse can be used as a very powerful mechanism for discovering crucial information, hence the importance of implementing security measures which guarantee the data confidentiality by establishing an access control policy. In this direction, several propositions were made, however, none is considered as a standard of access management to data warehouses. In this article, we will present our approach that allows first to exploit the permissions defined in the data sources in order to help the administrator to define access permissions to the data warehouse, and then our system will automatically generate the sensitivity level of each data warehouse element according to the permissions granted to an object in the data warehouse.
{"title":"Dynamic management of data warehouse security levels based on user profiles","authors":"Amina El Ouazzani, Sara Rhazlane, Nouria Harbi, Hassan Badir","doi":"10.1109/CIST.2016.7804961","DOIUrl":"https://doi.org/10.1109/CIST.2016.7804961","url":null,"abstract":"Respect for privacy and data confidentiality in a company are two fundamentals that must be protected. However, a Data Warehouse can be used as a very powerful mechanism for discovering crucial information, hence the importance of implementing security measures which guarantee the data confidentiality by establishing an access control policy. In this direction, several propositions were made, however, none is considered as a standard of access management to data warehouses. In this article, we will present our approach that allows first to exploit the permissions defined in the data sources in order to help the administrator to define access permissions to the data warehouse, and then our system will automatically generate the sensitivity level of each data warehouse element according to the permissions granted to an object in the data warehouse.","PeriodicalId":196827,"journal":{"name":"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122676809","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}
In this contribution we illustrate the methodology and the results of an experiment we conducted by applying Distributional Semantics Models to the analysis of the Holy Quran. Our aim was to gather information on the potential differences in meanings that the same words might take on when used in Modern Standard Arabic w.r.t. their usage in the Quran. To do so we used the Penn Arabic Treebank as a contrastive corpus.
{"title":"An application of distributional semantics for the analysis of the Holy Quran","authors":"Giulia Benotto, Emiliano Giovannetti, Ouafae Nahli","doi":"10.1109/CIST.2016.7805074","DOIUrl":"https://doi.org/10.1109/CIST.2016.7805074","url":null,"abstract":"In this contribution we illustrate the methodology and the results of an experiment we conducted by applying Distributional Semantics Models to the analysis of the Holy Quran. Our aim was to gather information on the potential differences in meanings that the same words might take on when used in Modern Standard Arabic w.r.t. their usage in the Quran. To do so we used the Penn Arabic Treebank as a contrastive corpus.","PeriodicalId":196827,"journal":{"name":"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)","volume":"505 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134387710","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 : 2016-10-01DOI: 10.1109/CIST.2016.7805065
Mustapha Khalfi, Ouafae Nahli, A. Zarghili
In order to enrich the digital content of Classical Arabic, we aim to propose and represent the Arabic dictionary “'Al-Qamiis Al-Muhit” in the standard format LEMON. Printed transition to digital format requires various steps of work. This article describes the procedures that we followed to convert the dictionary in digitized and encoded format to apply automatic extractions and get the Lemon format used in semantic web. Furthermore, due to Arabic dictionary complexity, formalize lexical and semantic information involves morphosyntactic and derivational knowledge that we try to explain.
{"title":"Classical dictionary Al-Qamus in lemon","authors":"Mustapha Khalfi, Ouafae Nahli, A. Zarghili","doi":"10.1109/CIST.2016.7805065","DOIUrl":"https://doi.org/10.1109/CIST.2016.7805065","url":null,"abstract":"In order to enrich the digital content of Classical Arabic, we aim to propose and represent the Arabic dictionary “'Al-Qamiis Al-Muhit” in the standard format LEMON. Printed transition to digital format requires various steps of work. This article describes the procedures that we followed to convert the dictionary in digitized and encoded format to apply automatic extractions and get the Lemon format used in semantic web. Furthermore, due to Arabic dictionary complexity, formalize lexical and semantic information involves morphosyntactic and derivational knowledge that we try to explain.","PeriodicalId":196827,"journal":{"name":"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134432364","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 : 2016-10-01DOI: 10.1109/CIST.2016.7805035
C. Baidada, A. Jakimi
To fully understand the behavior of a program, it is important to have automatic techniques that generate UML (Unified Modeling Language) models representing the behavior of the system. Reverse engineering techniques, either through dynamic analysis of the running application or static analysis of the source code, are used to help gain this understanding. Each type of technique has its limitations. The major limitation of dynamic analysis is the need of a system expert user who knows the different behaviors of the system. Static analysis has also limits especially with dynamic links and polymorphism states. In this paper, we propose an approach to automatically extract UML sequence diagrams from object-oriented programming languages. Our approach combines dynamic and static analyses to get the best of both approaches. Our method uses static analysis to identify all different system entries values that can be used to guide the dynamic analysis.
{"title":"Towards new hybrid approach of the reverse engineering of UML sequence diagram","authors":"C. Baidada, A. Jakimi","doi":"10.1109/CIST.2016.7805035","DOIUrl":"https://doi.org/10.1109/CIST.2016.7805035","url":null,"abstract":"To fully understand the behavior of a program, it is important to have automatic techniques that generate UML (Unified Modeling Language) models representing the behavior of the system. Reverse engineering techniques, either through dynamic analysis of the running application or static analysis of the source code, are used to help gain this understanding. Each type of technique has its limitations. The major limitation of dynamic analysis is the need of a system expert user who knows the different behaviors of the system. Static analysis has also limits especially with dynamic links and polymorphism states. In this paper, we propose an approach to automatically extract UML sequence diagrams from object-oriented programming languages. Our approach combines dynamic and static analyses to get the best of both approaches. Our method uses static analysis to identify all different system entries values that can be used to guide the dynamic analysis.","PeriodicalId":196827,"journal":{"name":"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115549729","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 : 2016-10-01DOI: 10.1109/CIST.2016.7805028
Ilhame El Farissi, Ilham Slimani, S. Achchab
Through the literature, authors give a considerable attention to game theory because of its wide range of applications in various fields including economics, political science, psychology or biology. The aim of this case study is to employ game theoretic approach to model information sharing as a coordination mechanism in a basic two-echelon supply chain composed of a single retailer and a single supplier. This paper is the sequel of previous works; where demand is forecasted based on historical data of a supermarket in Morocco using the Multi Layer Perceptron structure of the artificial neural networks. Nevertheless, this work focuses on the implementation of the obtained forecasting results in the studied system modeled as a game of two players with asymmetric and imperfect information, in order to find the equilibrium of the game that guaranties maximum payoff for both players. In fact, this is what game theory is all about.
{"title":"Coordination by sharing demand forecasts in a supply chain using game theoretic approach","authors":"Ilhame El Farissi, Ilham Slimani, S. Achchab","doi":"10.1109/CIST.2016.7805028","DOIUrl":"https://doi.org/10.1109/CIST.2016.7805028","url":null,"abstract":"Through the literature, authors give a considerable attention to game theory because of its wide range of applications in various fields including economics, political science, psychology or biology. The aim of this case study is to employ game theoretic approach to model information sharing as a coordination mechanism in a basic two-echelon supply chain composed of a single retailer and a single supplier. This paper is the sequel of previous works; where demand is forecasted based on historical data of a supermarket in Morocco using the Multi Layer Perceptron structure of the artificial neural networks. Nevertheless, this work focuses on the implementation of the obtained forecasting results in the studied system modeled as a game of two players with asymmetric and imperfect information, in order to find the equilibrium of the game that guaranties maximum payoff for both players. In fact, this is what game theory is all about.","PeriodicalId":196827,"journal":{"name":"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)","volume":"8 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114120873","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 : 2016-10-01DOI: 10.1109/CIST.2016.7805015
Soufiane Oukili, S. Bri, A. V. S. Kumar
Smart City is becoming a commonly-used term to describe the concept of utilizing information and communication technologies (ICT) to enhance urban services and improve the quality of life for citizens. All communications should be fast and properly protected against unauthorized eavesdropping, interception, and modification. Therefore high speed and strong cryptography is required. Advanced Encryption Standard (AES) is the most widely and secure symmetric key encryption algorithms today. S-box substitution is the only non-linear step in this algorithm. It is one of the most complicated and costly part of the system. In this article, we present high speed efficient S-box AES architecture using combinational logic. We have used 5-stage pipeline design in order to increase the speed and the maximum operation frequency. Therefore registers are inserted in optimal placements. The implementation has been successfully done by virtex-6 (xc6vlx240t) FPGA device using Xilinx ISE 14.7. Our proposed design achieves a frequency of 842.744 MHz and occupied 20 slices, whereas the highest operation frequency reported in the literature is 696.37 MHz using 32 slices.
智慧城市正在成为一个常用术语，用来描述利用信息和通信技术(ICT)增强城市服务和提高市民生活质量的概念。所有的通信都应该快速和适当地防止未经授权的窃听、拦截和修改。因此，需要高速和强密码。高级加密标准(AES)是目前应用最广泛、最安全的对称密钥加密算法。s盒替换是该算法中唯一的非线性步骤。它是系统中最复杂和最昂贵的部分之一。在本文中，我们采用组合逻辑提出了高速高效的S-box AES架构。为了提高速度和最大运行频率，我们采用了5级管道设计。因此，寄存器被插入到最佳位置。采用Xilinx ISE 14.7，采用virtex-6 (xc6vlx240t) FPGA器件成功实现。我们提出的设计实现了842.744 MHz的频率，占用了20个片，而文献中报道的最高工作频率是696.37 MHz，占用了32个片。
{"title":"High speed efficient FPGA implementation of pipelined AES S-Box","authors":"Soufiane Oukili, S. Bri, A. V. S. Kumar","doi":"10.1109/CIST.2016.7805015","DOIUrl":"https://doi.org/10.1109/CIST.2016.7805015","url":null,"abstract":"Smart City is becoming a commonly-used term to describe the concept of utilizing information and communication technologies (ICT) to enhance urban services and improve the quality of life for citizens. All communications should be fast and properly protected against unauthorized eavesdropping, interception, and modification. Therefore high speed and strong cryptography is required. Advanced Encryption Standard (AES) is the most widely and secure symmetric key encryption algorithms today. S-box substitution is the only non-linear step in this algorithm. It is one of the most complicated and costly part of the system. In this article, we present high speed efficient S-box AES architecture using combinational logic. We have used 5-stage pipeline design in order to increase the speed and the maximum operation frequency. Therefore registers are inserted in optimal placements. The implementation has been successfully done by virtex-6 (xc6vlx240t) FPGA device using Xilinx ISE 14.7. Our proposed design achieves a frequency of 842.744 MHz and occupied 20 slices, whereas the highest operation frequency reported in the literature is 696.37 MHz using 32 slices.","PeriodicalId":196827,"journal":{"name":"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114293834","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
扫码关注我们
求助内容：
应助结果提醒方式：