Pub Date : 2014-10-02DOI: 10.1109/I4CT.2014.6914202
Suleman Khan, Ejaz Ahmad, M. Shiraz, A. Gani, Ainuddin Wahid Abdul Wahab, M. Bagiwa
Mobile cloud computing (MCC) is fast becoming one of the most essential research topics for distributed resource networks. Users can easily access cloud while offloading their mobile applications from anywhere anytime. Being easy to access, intruder attacks mobile networks to acquire credential from mobile applications inside and outside the cloud computing. To investigate intruder's attacks, digital investigator has to identify the root cause of the attack. However, investigating MCC infrastructure is difficult due to its characteristics of virtualization, dispersion of data, multi tenancy, interoperability, and mobility. In this paper, we present an overview of MCC and digital forensics, focusing on its key aspects and significant forensic challenges faced by digital investigators in MCC. The purpose of this paper is to provide a comprehensive understanding about forensic research challenges and re-direct researchers towards new research areas.
{"title":"Forensic challenges in mobile cloud computing","authors":"Suleman Khan, Ejaz Ahmad, M. Shiraz, A. Gani, Ainuddin Wahid Abdul Wahab, M. Bagiwa","doi":"10.1109/I4CT.2014.6914202","DOIUrl":"https://doi.org/10.1109/I4CT.2014.6914202","url":null,"abstract":"Mobile cloud computing (MCC) is fast becoming one of the most essential research topics for distributed resource networks. Users can easily access cloud while offloading their mobile applications from anywhere anytime. Being easy to access, intruder attacks mobile networks to acquire credential from mobile applications inside and outside the cloud computing. To investigate intruder's attacks, digital investigator has to identify the root cause of the attack. However, investigating MCC infrastructure is difficult due to its characteristics of virtualization, dispersion of data, multi tenancy, interoperability, and mobility. In this paper, we present an overview of MCC and digital forensics, focusing on its key aspects and significant forensic challenges faced by digital investigators in MCC. The purpose of this paper is to provide a comprehensive understanding about forensic research challenges and re-direct researchers towards new research areas.","PeriodicalId":356190,"journal":{"name":"2014 International Conference on Computer, Communications, and Control Technology (I4CT)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132171536","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 : 2014-10-02DOI: 10.1109/I4CT.2014.6914183
A. Azizan, Zainab Binti Abu Bakar, S. Noah
Users normally facing difficulties to expresses their information needs into a query format that the search system can use to process. Therefore users frequently modify their query with intention to retrieve better results. The goal of this experiment is to compare the precision of the retrieved results by employing domain ontology to reformulate the user query. We proposed to reformulate the query (initially in natural language) by replacing it with the terms retrieved from ontology. Then we improve the approach by combining the terms from ontology with keyword/s extracted from the initial user's natural language query. Precision measure had been conducted for six queries and the results showed that the idea of combining ontology terms with keyword from query gave a promising result. It achieved higher precision in comparison when using ontology terms alone. This experimental result indicates that query reformulation is more efficient when ontology term/s combined with key element from the user's query.
{"title":"Analysis of retrieval result on ontology-based query reformulation","authors":"A. Azizan, Zainab Binti Abu Bakar, S. Noah","doi":"10.1109/I4CT.2014.6914183","DOIUrl":"https://doi.org/10.1109/I4CT.2014.6914183","url":null,"abstract":"Users normally facing difficulties to expresses their information needs into a query format that the search system can use to process. Therefore users frequently modify their query with intention to retrieve better results. The goal of this experiment is to compare the precision of the retrieved results by employing domain ontology to reformulate the user query. We proposed to reformulate the query (initially in natural language) by replacing it with the terms retrieved from ontology. Then we improve the approach by combining the terms from ontology with keyword/s extracted from the initial user's natural language query. Precision measure had been conducted for six queries and the results showed that the idea of combining ontology terms with keyword from query gave a promising result. It achieved higher precision in comparison when using ontology terms alone. This experimental result indicates that query reformulation is more efficient when ontology term/s combined with key element from the user's query.","PeriodicalId":356190,"journal":{"name":"2014 International Conference on Computer, Communications, and Control Technology (I4CT)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122545064","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 : 2014-10-02DOI: 10.1109/I4CT.2014.6914156
Norzilah Musa, S. Z. Abidin, N. Omar
In collaborative workspaces, users of a group communicate with other group members through information artefacts in their activities. While they are working, they can create additional small groups for inter and intra communications based on their preferences. Hence, at any specific time, a collaborative user is associated with more than one group and activity for single and multi-dimensional communication. The relationships between users, groups and activities are very complex and become a barrier to any group activities in having seamless communications. In this paper, we identify important features for single dimension and multi-dimensional communications in five domains of collaborative applications. Then, we analyze the important factors for designing mechanism to support the multi-dimensional communication based on user preference. The findings emphasize eight crucial parameters for a multi-dimensional communication in collaborative workspaces. Thus, the user-based multi-dimensional communication is significant in promoting flexible coordinating mechanism for group activities.
{"title":"Enhancing group activities with multidimensional communication in collaborative workspace","authors":"Norzilah Musa, S. Z. Abidin, N. Omar","doi":"10.1109/I4CT.2014.6914156","DOIUrl":"https://doi.org/10.1109/I4CT.2014.6914156","url":null,"abstract":"In collaborative workspaces, users of a group communicate with other group members through information artefacts in their activities. While they are working, they can create additional small groups for inter and intra communications based on their preferences. Hence, at any specific time, a collaborative user is associated with more than one group and activity for single and multi-dimensional communication. The relationships between users, groups and activities are very complex and become a barrier to any group activities in having seamless communications. In this paper, we identify important features for single dimension and multi-dimensional communications in five domains of collaborative applications. Then, we analyze the important factors for designing mechanism to support the multi-dimensional communication based on user preference. The findings emphasize eight crucial parameters for a multi-dimensional communication in collaborative workspaces. Thus, the user-based multi-dimensional communication is significant in promoting flexible coordinating mechanism for group activities.","PeriodicalId":356190,"journal":{"name":"2014 International Conference on Computer, Communications, and Control Technology (I4CT)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123199718","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 : 2014-10-02DOI: 10.1109/I4CT.2014.6914136
A. Saaidah, M. Z. Jali, M. F. Marhusin, Hussein Abdel-jaber
In this study, the discrete-time performance of BLUE algorithms under bursty and correlated traffics is analyzed using two-state Markov-modulated Bernoulli arrival process (BLUE-MMBP-2). A two-dimensional discrete-time Markov chain is used to model the BLUE algorithm for two traffic classes, in which each dimension corresponds to a traffic class and the parameters of that traffic class. The MMBP is used to replace the conventional and widely-used Bernoulli process (BP) in evaluating and proposing analytical models based on the BLUE algorithm. The BP captures neither the traffic correlation nor the burstiness. The proposed approach is simulated, and the obtained results are compared with that of the BLUE-BP, which can modulate a single traffic class only. The comparison is performed in terms of mean queue length (mql), average queuing delay (D), throughput, packet loss, and dropping probability (DP). The results show that during congestion, particularly heavy congestion under bursty and correlated traffics, the BLUE-MMBP-2 algorithm provides better mql, D, and DP than the BLUE-BP.
{"title":"Markov-modulated Bernoulli-based performance analysis for BLUE algorithm under bursty and correlated traffics","authors":"A. Saaidah, M. Z. Jali, M. F. Marhusin, Hussein Abdel-jaber","doi":"10.1109/I4CT.2014.6914136","DOIUrl":"https://doi.org/10.1109/I4CT.2014.6914136","url":null,"abstract":"In this study, the discrete-time performance of BLUE algorithms under bursty and correlated traffics is analyzed using two-state Markov-modulated Bernoulli arrival process (BLUE-MMBP-2). A two-dimensional discrete-time Markov chain is used to model the BLUE algorithm for two traffic classes, in which each dimension corresponds to a traffic class and the parameters of that traffic class. The MMBP is used to replace the conventional and widely-used Bernoulli process (BP) in evaluating and proposing analytical models based on the BLUE algorithm. The BP captures neither the traffic correlation nor the burstiness. The proposed approach is simulated, and the obtained results are compared with that of the BLUE-BP, which can modulate a single traffic class only. The comparison is performed in terms of mean queue length (mql), average queuing delay (D), throughput, packet loss, and dropping probability (DP). The results show that during congestion, particularly heavy congestion under bursty and correlated traffics, the BLUE-MMBP-2 algorithm provides better mql, D, and DP than the BLUE-BP.","PeriodicalId":356190,"journal":{"name":"2014 International Conference on Computer, Communications, and Control Technology (I4CT)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130802215","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 : 2014-10-02DOI: 10.1109/I4CT.2014.6914173
Alquine Roy F. Taculin, Denmar M. Abuhan, J. Cruz, M. L. Santos, Renato V. Crisostomo
Previous studies on keystroke dynamics confirmed that the use of biometric technologies provides a significantly high level of reliability especially in situations where security is paramount. Most of these studies use genetic algorithms and k-nearest neighbor as their model of computation. In this paper, we explore an algorithmic solution based on an alternative model patterned after the process of chemical reactions of molecules. We invited several respondents to participate in our testing. Multiple keystroke samples were taken from each respondent and their keystroke values were stored in our databank. Samples collected in this paper were modeled using periodic tables and molecular bonding of keystrokes as data representations. In performing the computation, a molecular algorithm was introduced. A molecular bonding was constructed to stimulate chemical reactions such as synthesis, decomposition and displacement. These molecular reactions enhance the pattern matching process of a keystroke against the collection of samples. Experiments show that the algorithm demonstrates 92% correctness in authenticating a keystroke pattern, while it can fairly recognize impostors during the identification process.
{"title":"Using molecular algorithm in keystroke dynamics","authors":"Alquine Roy F. Taculin, Denmar M. Abuhan, J. Cruz, M. L. Santos, Renato V. Crisostomo","doi":"10.1109/I4CT.2014.6914173","DOIUrl":"https://doi.org/10.1109/I4CT.2014.6914173","url":null,"abstract":"Previous studies on keystroke dynamics confirmed that the use of biometric technologies provides a significantly high level of reliability especially in situations where security is paramount. Most of these studies use genetic algorithms and k-nearest neighbor as their model of computation. In this paper, we explore an algorithmic solution based on an alternative model patterned after the process of chemical reactions of molecules. We invited several respondents to participate in our testing. Multiple keystroke samples were taken from each respondent and their keystroke values were stored in our databank. Samples collected in this paper were modeled using periodic tables and molecular bonding of keystrokes as data representations. In performing the computation, a molecular algorithm was introduced. A molecular bonding was constructed to stimulate chemical reactions such as synthesis, decomposition and displacement. These molecular reactions enhance the pattern matching process of a keystroke against the collection of samples. Experiments show that the algorithm demonstrates 92% correctness in authenticating a keystroke pattern, while it can fairly recognize impostors during the identification process.","PeriodicalId":356190,"journal":{"name":"2014 International Conference on Computer, Communications, and Control Technology (I4CT)","volume":"41 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128483605","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 : 2014-10-02DOI: 10.1109/I4CT.2014.6914155
S. Ahmed, M. Hasan, F. Subhan
Networked controlled systems comprise a team of dynamic systems which are linked together through a shared networked. From control systems perspective, the introduction of a shared networked brings its own challenges such as packet dropouts, time delays and clock synchronization. A popular application of networked controlled systems is to consider a team of collaborative mobile robots. Networked controlled robots involve a team of mobile robots working together with each other to accomplish a specific task. Each individual mobile robot has finite battery sources, which must be efficiently utilized. The efficient utilization of battery sources limits the communication capabilities of the robots. Furthermore, a shared network among the networked robots introduces time delays in the data received. This paper presents the design of an optimal ℋ∞ filter to minimize the effects of time delays in the received data. A numerical example is presented to demonstrate the effectiveness of the proposed approach.
{"title":"ℋ∞ filtering for networked controlled systems","authors":"S. Ahmed, M. Hasan, F. Subhan","doi":"10.1109/I4CT.2014.6914155","DOIUrl":"https://doi.org/10.1109/I4CT.2014.6914155","url":null,"abstract":"Networked controlled systems comprise a team of dynamic systems which are linked together through a shared networked. From control systems perspective, the introduction of a shared networked brings its own challenges such as packet dropouts, time delays and clock synchronization. A popular application of networked controlled systems is to consider a team of collaborative mobile robots. Networked controlled robots involve a team of mobile robots working together with each other to accomplish a specific task. Each individual mobile robot has finite battery sources, which must be efficiently utilized. The efficient utilization of battery sources limits the communication capabilities of the robots. Furthermore, a shared network among the networked robots introduces time delays in the data received. This paper presents the design of an optimal ℋ∞ filter to minimize the effects of time delays in the received data. A numerical example is presented to demonstrate the effectiveness of the proposed approach.","PeriodicalId":356190,"journal":{"name":"2014 International Conference on Computer, Communications, and Control Technology (I4CT)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126580363","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 : 2014-10-02DOI: 10.1109/I4CT.2014.6914192
N. Arshad, S. Yaacob, S. Ibrahim, M. S. Razalli
Realization of crossovers is always a problem in the design of microwave integrated circuits. In many cases, when a high isolation between crossing strips is required in a rather large frequency band, it is preferable to avoid a trivial separation of the strips by a dielectric layer. This paper focuses on designing and developing a wideband 0 dB coupler on planar microstrip. in In this paper, the proposed 0 dB coupler is designed using square patch with slotted lines. To compare the performances of the proposed design, a conventional 0 dB coupler using double section branch line coupler is presented as well. A substrate Rogers RO4003C with dielectric constant of 3.38 and thickness of 0.508 mm at center frequency 2.4 GHz are used in both designs. They are compared in terms of the size, and their s-parameter performance. Both couplers developed with the aid of design tool CST Microwave Studio and fabricated using microstrip technology.
{"title":"0 dB coupler employing slot technique on planar microstrip","authors":"N. Arshad, S. Yaacob, S. Ibrahim, M. S. Razalli","doi":"10.1109/I4CT.2014.6914192","DOIUrl":"https://doi.org/10.1109/I4CT.2014.6914192","url":null,"abstract":"Realization of crossovers is always a problem in the design of microwave integrated circuits. In many cases, when a high isolation between crossing strips is required in a rather large frequency band, it is preferable to avoid a trivial separation of the strips by a dielectric layer. This paper focuses on designing and developing a wideband 0 dB coupler on planar microstrip. in In this paper, the proposed 0 dB coupler is designed using square patch with slotted lines. To compare the performances of the proposed design, a conventional 0 dB coupler using double section branch line coupler is presented as well. A substrate Rogers RO4003C with dielectric constant of 3.38 and thickness of 0.508 mm at center frequency 2.4 GHz are used in both designs. They are compared in terms of the size, and their s-parameter performance. Both couplers developed with the aid of design tool CST Microwave Studio and fabricated using microstrip technology.","PeriodicalId":356190,"journal":{"name":"2014 International Conference on Computer, Communications, and Control Technology (I4CT)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122871690","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 : 2014-10-02DOI: 10.1109/I4CT.2014.6914194
M. Abdullah, B. Das, N. S. Mohd Shah
In this paper the chromatic dispersion is reduced for enhancement in the performance of optical communication system. For this an analog test signal is generated and converted into digital domain and modulated with 16 QAM by gray code mapping. Through Split Step Fourier technique the signal is propagated in the optical fiber link for 15 km of simulated distance. At the end of this distance the chromatic dispersion is observed and to reduce Chromatic Dispersion (CD) signal is converted in electrical form at end of optical fiber link. Digital Signal Processing techniques are applied on dispersed signal to reduce the CD. Analysis is based on Bit Error Rate that are compared before and after the induction of chromatic dispersion. In this research CD is reduced electronically so it will save the requirement of optical amplifiers.
{"title":"DSP techniques for reducing chromatic dispersion in optical communication systems","authors":"M. Abdullah, B. Das, N. S. Mohd Shah","doi":"10.1109/I4CT.2014.6914194","DOIUrl":"https://doi.org/10.1109/I4CT.2014.6914194","url":null,"abstract":"In this paper the chromatic dispersion is reduced for enhancement in the performance of optical communication system. For this an analog test signal is generated and converted into digital domain and modulated with 16 QAM by gray code mapping. Through Split Step Fourier technique the signal is propagated in the optical fiber link for 15 km of simulated distance. At the end of this distance the chromatic dispersion is observed and to reduce Chromatic Dispersion (CD) signal is converted in electrical form at end of optical fiber link. Digital Signal Processing techniques are applied on dispersed signal to reduce the CD. Analysis is based on Bit Error Rate that are compared before and after the induction of chromatic dispersion. In this research CD is reduced electronically so it will save the requirement of optical amplifiers.","PeriodicalId":356190,"journal":{"name":"2014 International Conference on Computer, Communications, and Control Technology (I4CT)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124855567","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 : 2014-10-02DOI: 10.1109/I4CT.2014.6914205
Mohammadfazel Anjomshoa, M. Salleh, M. Kermani
The advantages of using virtualization can be impaired if it can not deliver sufficient performance. Running applications in virtualized environment incur performance overheads regarding to the virtualization functionalities like initialization virtual machine image, the booting time of virtual machine, starting, pausing and turning off the virtual machine. Virtualization functionality has implication on the host performance and when it is mixed with volunteer computing in order to undertake the execution of jobs, it becomes a serious challenge as volunteer computing aims to use public dedicated resources in an efficient manner to maximize the work done. In order to adopt virtualization technology in volunteer computing, the performance impact of virtualization on volunteer computing middleware needs to be distinguished. In this paper, we experimentally evaluate the virtualization functionalities overhead by comparing the job application execution in two scenarios: 1) executing job application in a virtualized environment by using vboxwrapper (The latest BOINC virtualization approach) and 2) executing job application directly on the host OS. Based on the result, virtualization fashion imposed up to 5 minutes pre-execution overhead when three jobs performed in parallel. The storage overhead ranged from 13% to 26%, depending on the number of jobs that are executing in parallel. This amount of overhead for memory ranged from 6.5% to 20%.
{"title":"The cost of virtualization implementation in volunteer computing","authors":"Mohammadfazel Anjomshoa, M. Salleh, M. Kermani","doi":"10.1109/I4CT.2014.6914205","DOIUrl":"https://doi.org/10.1109/I4CT.2014.6914205","url":null,"abstract":"The advantages of using virtualization can be impaired if it can not deliver sufficient performance. Running applications in virtualized environment incur performance overheads regarding to the virtualization functionalities like initialization virtual machine image, the booting time of virtual machine, starting, pausing and turning off the virtual machine. Virtualization functionality has implication on the host performance and when it is mixed with volunteer computing in order to undertake the execution of jobs, it becomes a serious challenge as volunteer computing aims to use public dedicated resources in an efficient manner to maximize the work done. In order to adopt virtualization technology in volunteer computing, the performance impact of virtualization on volunteer computing middleware needs to be distinguished. In this paper, we experimentally evaluate the virtualization functionalities overhead by comparing the job application execution in two scenarios: 1) executing job application in a virtualized environment by using vboxwrapper (The latest BOINC virtualization approach) and 2) executing job application directly on the host OS. Based on the result, virtualization fashion imposed up to 5 minutes pre-execution overhead when three jobs performed in parallel. The storage overhead ranged from 13% to 26%, depending on the number of jobs that are executing in parallel. This amount of overhead for memory ranged from 6.5% to 20%.","PeriodicalId":356190,"journal":{"name":"2014 International Conference on Computer, Communications, and Control Technology (I4CT)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124938820","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 : 2014-10-02DOI: 10.1109/I4CT.2014.6914206
Kamsiah Mohamed, Mohd Nazran Mohammed Pauzi, Fakariah Hani Hj Mohd Ali, Suriyani Ariffin, Nurul Huda Nik Zulkipli
In the field of cryptography, the substitution box (S-box) becomes the most widely used ciphers. The process of creating new and powerful S-boxes never end. Various methods are proposed to make the S-box becomes strongest and hard to attack. The strength or weakness of S-box will be determined through the analysis of S-box properties. However, the analysis of the properties of the S-box in block ciphers is still lacking because there is no specific guidelines and technique based on S-box properties. Hence, the cipher is easier to attack by an adversary if the S-box properties are not robust. The purpose of this paper is to describe and review of the S-box properties in block ciphers. As a result, for future work, a new model for analysis S-box properties will be proposed. The model can be used to analysis the properties to determine the strength and weakness of any S-boxes.
{"title":"Study of S-box properties in block cipher","authors":"Kamsiah Mohamed, Mohd Nazran Mohammed Pauzi, Fakariah Hani Hj Mohd Ali, Suriyani Ariffin, Nurul Huda Nik Zulkipli","doi":"10.1109/I4CT.2014.6914206","DOIUrl":"https://doi.org/10.1109/I4CT.2014.6914206","url":null,"abstract":"In the field of cryptography, the substitution box (S-box) becomes the most widely used ciphers. The process of creating new and powerful S-boxes never end. Various methods are proposed to make the S-box becomes strongest and hard to attack. The strength or weakness of S-box will be determined through the analysis of S-box properties. However, the analysis of the properties of the S-box in block ciphers is still lacking because there is no specific guidelines and technique based on S-box properties. Hence, the cipher is easier to attack by an adversary if the S-box properties are not robust. The purpose of this paper is to describe and review of the S-box properties in block ciphers. As a result, for future work, a new model for analysis S-box properties will be proposed. The model can be used to analysis the properties to determine the strength and weakness of any S-boxes.","PeriodicalId":356190,"journal":{"name":"2014 International Conference on Computer, Communications, and Control Technology (I4CT)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129180937","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
扫码关注我们
求助内容：
应助结果提醒方式：