S. A. Mokhtar, Abdulkarem Al-Sharafi, Siti Haryati Shaikh Ali, Abdulaziz Aborujilah
Information and communication technology (ICT) plays a significant role in education. Cloud computing is a relatively new technology in ICT. It has drastically changed the way ICT services are used in organisations. In education sector, many education institutions have started to recognise the usefulness and importance of adopting cloud computing technology, and some have started to adopt the technology in the organisation. There are several issues that must be taken into account when adopting cloud computing. They encompass technological factors, environmental factors and organisational factors. This paper aims to highlights the organisational factors within the context of cloud computing adoption in education, focusing on the e-learning domain area.
{"title":"Organizational Factors in the Adoption of Cloud Computing in E-Learning","authors":"S. A. Mokhtar, Abdulkarem Al-Sharafi, Siti Haryati Shaikh Ali, Abdulaziz Aborujilah","doi":"10.1109/ACSAT.2014.40","DOIUrl":"https://doi.org/10.1109/ACSAT.2014.40","url":null,"abstract":"Information and communication technology (ICT) plays a significant role in education. Cloud computing is a relatively new technology in ICT. It has drastically changed the way ICT services are used in organisations. In education sector, many education institutions have started to recognise the usefulness and importance of adopting cloud computing technology, and some have started to adopt the technology in the organisation. There are several issues that must be taken into account when adopting cloud computing. They encompass technological factors, environmental factors and organisational factors. This paper aims to highlights the organisational factors within the context of cloud computing adoption in education, focusing on the e-learning domain area.","PeriodicalId":137452,"journal":{"name":"2014 3rd International Conference on Advanced Computer Science Applications and Technologies","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131332831","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}
The flooding based Denial-of-service attacks is one of the most common DoS attack targeting the web servers. Availability of the web server under this kind of attacks in danger. This attacks also cause bad influence on the networks bandwidth or in computing resources (CPU, Memory, Storage). Therefore, this paper will focus on studying the effects of (DoS) attacks on CPU power performance and in network band width. So, in this study real flooding attack is implemented in different scenarios in order to evaluate the CPU and bandwidth power performance Finally, the results are presented in all scenarios. Additionally, the most influential factors on a CPU performance and bandwidth power performance are highlighted in comparison method.
{"title":"Detecting TCP SYN Based Flooding Attacks by Analyzing CPU and Network Resources Performance","authors":"Abdulaziz Aborujilah, Shahrulniza Musa, M. Ismail","doi":"10.1109/ACSAT.2014.34","DOIUrl":"https://doi.org/10.1109/ACSAT.2014.34","url":null,"abstract":"The flooding based Denial-of-service attacks is one of the most common DoS attack targeting the web servers. Availability of the web server under this kind of attacks in danger. This attacks also cause bad influence on the networks bandwidth or in computing resources (CPU, Memory, Storage). Therefore, this paper will focus on studying the effects of (DoS) attacks on CPU power performance and in network band width. So, in this study real flooding attack is implemented in different scenarios in order to evaluate the CPU and bandwidth power performance Finally, the results are presented in all scenarios. Additionally, the most influential factors on a CPU performance and bandwidth power performance are highlighted in comparison method.","PeriodicalId":137452,"journal":{"name":"2014 3rd International Conference on Advanced Computer Science Applications and Technologies","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130553926","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}
A. Mabrouk, A. Kobbane, M. El Koutbi, Essaid Sabir
Mobile communication has become the preferred choice of personal communication today. With the rapid proliferation of wireless network technologies, heterogeneous wireless network environments increase more and more. Such environments provide multiple access networks simultaneously for mobile users. Each mobile user wishes to get connected to Internet using the access technology that best suits his needs at any point in time. Always Best Connected is considered as a special concept for mobile users to select their suitable access networks. In this paper, we have presented two scenarios which are based on Always Best Connected concept to provide, for a smart vehicle moving in a road network installed with multiple access technologies, an always best connected service at any point in time. In the first scenario, we assume that the mobile user (vehicle) has complete information on the road network (all access technologies installed in the road network). Whilst the second scenario is the same as the first one except that the mobile user periodically receives a partial information on the road network (only the access technologies installed in the edges which are immediately accessible by mobile user). For both scenarios, we have proposed a graph model to characterize the observed mobility pattern. Also, two algorithms are proposed to find the optimal path that provides always best connected service for vehicles in both scenarios.
{"title":"Providing Always Best Connected Service in VANET with Complete and Partial Information","authors":"A. Mabrouk, A. Kobbane, M. El Koutbi, Essaid Sabir","doi":"10.1109/ACSAT.2014.26","DOIUrl":"https://doi.org/10.1109/ACSAT.2014.26","url":null,"abstract":"Mobile communication has become the preferred choice of personal communication today. With the rapid proliferation of wireless network technologies, heterogeneous wireless network environments increase more and more. Such environments provide multiple access networks simultaneously for mobile users. Each mobile user wishes to get connected to Internet using the access technology that best suits his needs at any point in time. Always Best Connected is considered as a special concept for mobile users to select their suitable access networks. In this paper, we have presented two scenarios which are based on Always Best Connected concept to provide, for a smart vehicle moving in a road network installed with multiple access technologies, an always best connected service at any point in time. In the first scenario, we assume that the mobile user (vehicle) has complete information on the road network (all access technologies installed in the road network). Whilst the second scenario is the same as the first one except that the mobile user periodically receives a partial information on the road network (only the access technologies installed in the edges which are immediately accessible by mobile user). For both scenarios, we have proposed a graph model to characterize the observed mobility pattern. Also, two algorithms are proposed to find the optimal path that provides always best connected service for vehicles in both scenarios.","PeriodicalId":137452,"journal":{"name":"2014 3rd International Conference on Advanced Computer Science Applications and Technologies","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130619574","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}
Afrah Djeddar, H. Bendjenna, A. Amirat, M. Oussalah
Despite the plethora of available mobile applications (apps) with theirs different implementations forms (e.g. Component, service, or app) the user's needs differ from user to another. Moreover, the mobile devices are characterized by heterogeneous software and hardware configurations. Thus, an important challenge in the development of mobile apps is their deployment in the heterogeneous devices available on the market. To tackle these challenges, there is a need for a composition process to reuse existing heterogeneous entities for developing mobile apps according to user's requirements and that the behavior of the desired apps can be customized according to theirs various context information. In this paper we address this issue by proposing context-aware mobile apps composition process based-on existing heterogeneous software entities.
{"title":"Composition Process Based on Heterogeneous Software Entities for Mobile Applications","authors":"Afrah Djeddar, H. Bendjenna, A. Amirat, M. Oussalah","doi":"10.1109/ACSAT.2014.27","DOIUrl":"https://doi.org/10.1109/ACSAT.2014.27","url":null,"abstract":"Despite the plethora of available mobile applications (apps) with theirs different implementations forms (e.g. Component, service, or app) the user's needs differ from user to another. Moreover, the mobile devices are characterized by heterogeneous software and hardware configurations. Thus, an important challenge in the development of mobile apps is their deployment in the heterogeneous devices available on the market. To tackle these challenges, there is a need for a composition process to reuse existing heterogeneous entities for developing mobile apps according to user's requirements and that the behavior of the desired apps can be customized according to theirs various context information. In this paper we address this issue by proposing context-aware mobile apps composition process based-on existing heterogeneous software entities.","PeriodicalId":137452,"journal":{"name":"2014 3rd International Conference on Advanced Computer Science Applications and Technologies","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129630326","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 paper the exploitation of infrastructure and take advantage of communication techniques wired and wireless to help drivers in finding ways does not contain any obstacles and reach to the target with commitment in speed of assessed road. We use Fusion or Polygamy Technology with Fuzzy Logic, Neural Network and Genetic Algorithm for extract Cut-Node (CN). We use Cut-Node (CN) in order to identify obstacles and avoid them such as changes that occur in the lighting, weather conditions, accidents, congestion and maintenance of roads. Cut-Node (CN) useful in understanding the surrounding environment, supporting safe driving, increases the flow and fastest path to arrive at the designated target (end point). Three models have been proposed to extract Cut-Node (CN) as follows: 1) Intuitionistic Fuzzy Set (IFS). 2) The Intuitionistic Fuzzy Set Data Base is representing imprecise data. 3) Intuitionistic Fuzzy Neural Network with Genetic Algorithm (IFNN-GA).
{"title":"Elicit the Best Ways through Identify Congestion Places","authors":"Mohammad Alodat, I. Abdullah","doi":"10.1109/ACSAT.2014.25","DOIUrl":"https://doi.org/10.1109/ACSAT.2014.25","url":null,"abstract":"In this paper the exploitation of infrastructure and take advantage of communication techniques wired and wireless to help drivers in finding ways does not contain any obstacles and reach to the target with commitment in speed of assessed road. We use Fusion or Polygamy Technology with Fuzzy Logic, Neural Network and Genetic Algorithm for extract Cut-Node (CN). We use Cut-Node (CN) in order to identify obstacles and avoid them such as changes that occur in the lighting, weather conditions, accidents, congestion and maintenance of roads. Cut-Node (CN) useful in understanding the surrounding environment, supporting safe driving, increases the flow and fastest path to arrive at the designated target (end point). Three models have been proposed to extract Cut-Node (CN) as follows: 1) Intuitionistic Fuzzy Set (IFS). 2) The Intuitionistic Fuzzy Set Data Base is representing imprecise data. 3) Intuitionistic Fuzzy Neural Network with Genetic Algorithm (IFNN-GA).","PeriodicalId":137452,"journal":{"name":"2014 3rd International Conference on Advanced Computer Science Applications and Technologies","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117201251","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}
Tori connected Torus Network (TTN) is a 2D-torus network of multiple basic modules, where each basic module is a 2D-torus network that are hierarchically interconnected for higher-level networks. The static network performance and dynamic communication performance using wormhole (WH) flow control of TTN has already been studied earlier and shown to be good than that of other networks. In this paper, we evaluate the dynamic communication performance of TTN using the virtual cut-through (VCT) flow control under uniform and non-uniform traffic patterns, and also compare the result with the other networks as well as the wormhole flow control of TTN network. We found that VCT with the non-uniform traffic patterns for TTN yields much better performance than that of 2D Torus, 2D Mesh, TESH, STTN and even better than the WH flow of TTN network in terms of network throughput and latency.
{"title":"Dynamic Communication Performance of TTN with Uniform and Non-uniform Traffic Patterns Using Virtual Cut-Through Flow Control","authors":"Faiz Al Faisal, M. M. Hafizur Rahman, Y. Inoguchi","doi":"10.1109/ACSAT.2014.30","DOIUrl":"https://doi.org/10.1109/ACSAT.2014.30","url":null,"abstract":"Tori connected Torus Network (TTN) is a 2D-torus network of multiple basic modules, where each basic module is a 2D-torus network that are hierarchically interconnected for higher-level networks. The static network performance and dynamic communication performance using wormhole (WH) flow control of TTN has already been studied earlier and shown to be good than that of other networks. In this paper, we evaluate the dynamic communication performance of TTN using the virtual cut-through (VCT) flow control under uniform and non-uniform traffic patterns, and also compare the result with the other networks as well as the wormhole flow control of TTN network. We found that VCT with the non-uniform traffic patterns for TTN yields much better performance than that of 2D Torus, 2D Mesh, TESH, STTN and even better than the WH flow of TTN network in terms of network throughput and latency.","PeriodicalId":137452,"journal":{"name":"2014 3rd International Conference on Advanced Computer Science Applications and Technologies","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125203430","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}
Skyline queries provide a flexible query operator that returns data items (skylines) which are not being dominated by other data items in all dimensions (attributes) of the database. Most of the existing skyline techniques determine the skylines by assuming that the values of dimensions for every data item are available (complete). However, this assumption is not always true particularly for multidimensional database as some values may be missing. The incompleteness of data leads to the loss of the transitivity property of skyline technique and results into failure in test dominance as some data items are incomparable to each other. Furthermore, incompleteness of data influences negatively on the process of finding skylines, leading to high overhead, due to exhaustive pair wise comparisons between the data items. This paper proposed a framework to process skyline queries for incomplete data with the aim of avoiding the issue of cyclic dominance in deriving skylines. The proposed framework for identifying skylines for incomplete data consists of four components, namely: Data Clustering Builder, Group Constructor and Local Skylines Identifier, k-dom Skyline Generator, and Incomplete Skylines Identifier. Including these processes in the proposed framework has optimized the process of identifying skylines in incomplete database by reducing the necessary number of pair wise comparison through eliminating the dominated data items as early as possible before applying the skyline technique.
{"title":"A Framework for Identifying Skylines over Incomplete Data","authors":"A. Alwan, H. Ibrahim, N. Udzir","doi":"10.1109/ACSAT.2014.21","DOIUrl":"https://doi.org/10.1109/ACSAT.2014.21","url":null,"abstract":"Skyline queries provide a flexible query operator that returns data items (skylines) which are not being dominated by other data items in all dimensions (attributes) of the database. Most of the existing skyline techniques determine the skylines by assuming that the values of dimensions for every data item are available (complete). However, this assumption is not always true particularly for multidimensional database as some values may be missing. The incompleteness of data leads to the loss of the transitivity property of skyline technique and results into failure in test dominance as some data items are incomparable to each other. Furthermore, incompleteness of data influences negatively on the process of finding skylines, leading to high overhead, due to exhaustive pair wise comparisons between the data items. This paper proposed a framework to process skyline queries for incomplete data with the aim of avoiding the issue of cyclic dominance in deriving skylines. The proposed framework for identifying skylines for incomplete data consists of four components, namely: Data Clustering Builder, Group Constructor and Local Skylines Identifier, k-dom Skyline Generator, and Incomplete Skylines Identifier. Including these processes in the proposed framework has optimized the process of identifying skylines in incomplete database by reducing the necessary number of pair wise comparison through eliminating the dominated data items as early as possible before applying the skyline technique.","PeriodicalId":137452,"journal":{"name":"2014 3rd International Conference on Advanced Computer Science Applications and Technologies","volume":"34 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121016529","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}
A. A. Mousa, A. Abdalla, Khalid Al Khateeb, Othman Omran Khalifa, Huda Adibah
Route Optimization (RO) refers to any approach that optimizes the transmission of packets between a Mobile Network Node/Mobile Router and a Corresponding Node/Home Agent. RO would mean that a binding between the address of an MNN/MR and the location of the mobile network is registered at the CE/HA. Technically, route optimization mechanism comes up with a complementing solution for the pinball problem by avoiding the MRHA Bidirectional Tunnel(BT) that is to be used. This paper discusses the RO issues for NEMO and more specifically issues of Nested NEMO such astunneling redundant, HA dependency, processing delay, bottleneck, traffic congestion, ER selection, and scalability in the design consideration. In order to address NEMO ROsuboptimal, this work utilizes the NCM protocol plus to PHA. The proposed MANEMO RO scheme is a layer three solution to support RO for mobile networks. Additionally, the paper proposes the design to address Nested NEMO issues in a post disaster scenario by using Proxy Home Agent (PHA) in the infrastructure with using Neighbor Discovery protocol(TDP/NINA) for localizing communications. Thus, thesignaling message flow and the algorithm are written to give proposed scheme more flexibility.
{"title":"Design a New Proposed Route Optimization Scheme Based NEMO-Centric MANEMO (NCM)","authors":"A. A. Mousa, A. Abdalla, Khalid Al Khateeb, Othman Omran Khalifa, Huda Adibah","doi":"10.1109/ACSAT.2014.37","DOIUrl":"https://doi.org/10.1109/ACSAT.2014.37","url":null,"abstract":"Route Optimization (RO) refers to any approach that optimizes the transmission of packets between a Mobile Network Node/Mobile Router and a Corresponding Node/Home Agent. RO would mean that a binding between the address of an MNN/MR and the location of the mobile network is registered at the CE/HA. Technically, route optimization mechanism comes up with a complementing solution for the pinball problem by avoiding the MRHA Bidirectional Tunnel(BT) that is to be used. This paper discusses the RO issues for NEMO and more specifically issues of Nested NEMO such astunneling redundant, HA dependency, processing delay, bottleneck, traffic congestion, ER selection, and scalability in the design consideration. In order to address NEMO ROsuboptimal, this work utilizes the NCM protocol plus to PHA. The proposed MANEMO RO scheme is a layer three solution to support RO for mobile networks. Additionally, the paper proposes the design to address Nested NEMO issues in a post disaster scenario by using Proxy Home Agent (PHA) in the infrastructure with using Neighbor Discovery protocol(TDP/NINA) for localizing communications. Thus, thesignaling message flow and the algorithm are written to give proposed scheme more flexibility.","PeriodicalId":137452,"journal":{"name":"2014 3rd International Conference on Advanced Computer Science Applications and Technologies","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117238025","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}
M. M. Hafizur Rahman, M. Akhand, Y. Miura, Y. Inoguchi
A Hierarchical 3D-Mesh (H3DM) Network is a 2D-mesh network of multiple basic modules (BMs), in which the basic modules are 3D-torus networks that are hierarchically interconnected for higher-level networks. In this paper, we evaluate the dynamic communication performance of a H3DM network under hot-spot traffic pattern using a deadlock-free dimension order routing algorithm with minimum number of virtual channels. We have also evaluated the dynamic communication performance of the mesh and torus networks. It is shown that under most imbalance hot-spot traffic pattern H3DM network yields high throughput and low average transfer time than that of mesh and torus networks, providing better dynamic communication performance compared to those networks.
{"title":"Hot-Spot Traffic Pattern on Hierarchical 3D Mesh Network","authors":"M. M. Hafizur Rahman, M. Akhand, Y. Miura, Y. Inoguchi","doi":"10.1109/ACSAT.2014.17","DOIUrl":"https://doi.org/10.1109/ACSAT.2014.17","url":null,"abstract":"A Hierarchical 3D-Mesh (H3DM) Network is a 2D-mesh network of multiple basic modules (BMs), in which the basic modules are 3D-torus networks that are hierarchically interconnected for higher-level networks. In this paper, we evaluate the dynamic communication performance of a H3DM network under hot-spot traffic pattern using a deadlock-free dimension order routing algorithm with minimum number of virtual channels. We have also evaluated the dynamic communication performance of the mesh and torus networks. It is shown that under most imbalance hot-spot traffic pattern H3DM network yields high throughput and low average transfer time than that of mesh and torus networks, providing better dynamic communication performance compared to those networks.","PeriodicalId":137452,"journal":{"name":"2014 3rd International Conference on Advanced Computer Science Applications and Technologies","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129709929","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}
This paper suggests a new method for hidden secret message text in a RGB 24-bit color image. The positions of hidden text are selected randomly using auto key generator. The auto key is generated by selected three bytes from image each time, and then deposits these pixels to the main components Red, Green and Blue bytes. The values of least significant bits (LSB) from red color bytes are used to configure a binary number. The binary number determines the hidden position of message text bit in either LSB of green or blue color in the selected bytes, depending on specific criteria. After implementing this method on different images, it was founded easy to implement, high security, and difficulty of detection. The values of some metrics used to measure the efficiency of the proposed method are well. Also, there is no difference between the images before and after the information hiding which detect with human eye perception.
{"title":"Hiding Message in Color Image Using Auto Key Generator","authors":"Q. M. Hussein","doi":"10.1109/ACSAT.2014.33","DOIUrl":"https://doi.org/10.1109/ACSAT.2014.33","url":null,"abstract":"This paper suggests a new method for hidden secret message text in a RGB 24-bit color image. The positions of hidden text are selected randomly using auto key generator. The auto key is generated by selected three bytes from image each time, and then deposits these pixels to the main components Red, Green and Blue bytes. The values of least significant bits (LSB) from red color bytes are used to configure a binary number. The binary number determines the hidden position of message text bit in either LSB of green or blue color in the selected bytes, depending on specific criteria. After implementing this method on different images, it was founded easy to implement, high security, and difficulty of detection. The values of some metrics used to measure the efficiency of the proposed method are well. Also, there is no difference between the images before and after the information hiding which detect with human eye perception.","PeriodicalId":137452,"journal":{"name":"2014 3rd International Conference on Advanced Computer Science Applications and Technologies","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128472553","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
扫码关注我们
求助内容：
应助结果提醒方式：