Pub Date : 2019-12-01DOI: 10.1109/CAS47993.2019.9075669
Nooralhuda waheed Aziz, S. N. Alsaad, Haider kadhum Hmood
The growing use of MANETs and its vulnerability to attacks due to its fundamental characteristics make secure routing one of the most considerable challenges. In this paper, a new security scheme for mobile ad hoc networks (MANETs) is presented. The proposed scheme used Trivium lightweight stream cipher algorithm in combination with HMAC to secure the routing control packets. This paper compares the performance of the AODV after implementing the security scheme in terms of throughput, delay sum (end-to-end), jitter sum (end-to-end) and packet loss ratio. The proposed scheme shows better performance than original AODV under blackhole attack.
{"title":"Implementation of Lightweight Stream Cipher in AODV Routing Protocol for MANET","authors":"Nooralhuda waheed Aziz, S. N. Alsaad, Haider kadhum Hmood","doi":"10.1109/CAS47993.2019.9075669","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075669","url":null,"abstract":"The growing use of MANETs and its vulnerability to attacks due to its fundamental characteristics make secure routing one of the most considerable challenges. In this paper, a new security scheme for mobile ad hoc networks (MANETs) is presented. The proposed scheme used Trivium lightweight stream cipher algorithm in combination with HMAC to secure the routing control packets. This paper compares the performance of the AODV after implementing the security scheme in terms of throughput, delay sum (end-to-end), jitter sum (end-to-end) and packet loss ratio. The proposed scheme shows better performance than original AODV under blackhole attack.","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127689623","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 : 2019-12-01DOI: 10.1109/CAS47993.2019.9075731
Naeem Howrie Ghayad, Ekhlas Abbas Albahrani
Random numbers are utilised principally to create random strings or secure secret keys. The key is a very important part of encryption and depends on the strength and security in the encryption algorithm. Random number generators have used in a computer simulation, cryptography, statistical modelling, randomised design, and other areas where the production of an unexpected result is desirable. This paper aims to provide designing a new random key generator form on a concatenation between Two- Dimensional Hénon map and Two-Dimensional rational Map. The basic process of the proposed generator is to convert the output of the two chaotic maps into 64-bit numbers and to merge them with the XOR operation and other operations. The key resulted random sequences are studied by the NIST test group and also using the traditional statistical methods.
{"title":"A Combination of Two-Dimensional Hénon Map and Two-Dimensional Rational Map as Key Number Generator","authors":"Naeem Howrie Ghayad, Ekhlas Abbas Albahrani","doi":"10.1109/CAS47993.2019.9075731","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075731","url":null,"abstract":"Random numbers are utilised principally to create random strings or secure secret keys. The key is a very important part of encryption and depends on the strength and security in the encryption algorithm. Random number generators have used in a computer simulation, cryptography, statistical modelling, randomised design, and other areas where the production of an unexpected result is desirable. This paper aims to provide designing a new random key generator form on a concatenation between Two- Dimensional Hénon map and Two-Dimensional rational Map. The basic process of the proposed generator is to convert the output of the two chaotic maps into 64-bit numbers and to merge them with the XOR operation and other operations. The key resulted random sequences are studied by the NIST test group and also using the traditional statistical methods.","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129940422","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 : 2019-12-01DOI: 10.1109/CAS47993.2019.9075466
S. Abbas, Israa M. Khanjar
Wireless sensor network (WSN) is a set of small sensor nodes with a limited amount of energy that is randomly deployed in an area of interest to transmit massive data. One of the main objectives of designing wireless sensor network is to make data transmission effective to increase network longevity and avoid premature death of nodes through energy management methods. In this paper, an energy-efficient routing scheme for WSN is proposed based on fuzzy logic for selecting a cluster head (CH), Node remaining energy and a distance of the Node to the base station (BS). The distance to the cluster head is taken into account as the inputs to be fed into the fuzzy inference system to determine the cluster heads. We also suggested an approach to managing the data transmission in a wireless sensor network to decrease the overall energy consumed; thus, extending the network lifetime. The performance of the proposed approach is evaluated using MATLAB simulation tool and compared with the LEACH protocol. Simulation results illustrated that the proposed protocol works better than LEACH regarding energy consumption and extending the network lifetime.
{"title":"Managing Data Transmission To Improve Lifetime of Wireless Sensor Network","authors":"S. Abbas, Israa M. Khanjar","doi":"10.1109/CAS47993.2019.9075466","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075466","url":null,"abstract":"Wireless sensor network (WSN) is a set of small sensor nodes with a limited amount of energy that is randomly deployed in an area of interest to transmit massive data. One of the main objectives of designing wireless sensor network is to make data transmission effective to increase network longevity and avoid premature death of nodes through energy management methods. In this paper, an energy-efficient routing scheme for WSN is proposed based on fuzzy logic for selecting a cluster head (CH), Node remaining energy and a distance of the Node to the base station (BS). The distance to the cluster head is taken into account as the inputs to be fed into the fuzzy inference system to determine the cluster heads. We also suggested an approach to managing the data transmission in a wireless sensor network to decrease the overall energy consumed; thus, extending the network lifetime. The performance of the proposed approach is evaluated using MATLAB simulation tool and compared with the LEACH protocol. Simulation results illustrated that the proposed protocol works better than LEACH regarding energy consumption and extending the network lifetime.","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131734064","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 : 2019-12-01DOI: 10.1109/CAS47993.2019.9075714
S. Sadkhan, Lafta Akeel A. Lafta
This paper, discuss raptor code implementation using a microcontroller. The work considers raptor code constructed from serial concatenation between two codes; these two codes are error-correcting. The first code is the low-density parity-check code LDPC code, and the second is the Luby transform code LT code. This work focus on compatibility concept of serially concatenated codes. The compatibility between two codes considers the matching of the code rate between two serially concatenated codes. The work discusses multiple cases of code rates with different modulation schemes. The simulation of each case of serial concatenation investigated and analyses using MATLAB. The simulation results show that raptor code provides excellent performance of Bit error rate BER vs SNR through AWGN channel. This work also introduces the raptor code implementation using a microcontroller. The implementation includes both raptor code system transmitter and receiver. The implementation uses a bit flipping decoding algorithm in the system receiver. The raptor code implementation tested in both transmitter and receiver using random input data; the decoding process provides output precisely the same as the input message without errors.
{"title":"A Proposed Implementation of Raptor Code using a Microcontroller","authors":"S. Sadkhan, Lafta Akeel A. Lafta","doi":"10.1109/CAS47993.2019.9075714","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075714","url":null,"abstract":"This paper, discuss raptor code implementation using a microcontroller. The work considers raptor code constructed from serial concatenation between two codes; these two codes are error-correcting. The first code is the low-density parity-check code LDPC code, and the second is the Luby transform code LT code. This work focus on compatibility concept of serially concatenated codes. The compatibility between two codes considers the matching of the code rate between two serially concatenated codes. The work discusses multiple cases of code rates with different modulation schemes. The simulation of each case of serial concatenation investigated and analyses using MATLAB. The simulation results show that raptor code provides excellent performance of Bit error rate BER vs SNR through AWGN channel. This work also introduces the raptor code implementation using a microcontroller. The implementation includes both raptor code system transmitter and receiver. The implementation uses a bit flipping decoding algorithm in the system receiver. The raptor code implementation tested in both transmitter and receiver using random input data; the decoding process provides output precisely the same as the input message without errors.","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127671313","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 : 2019-12-01DOI: 10.1109/CAS47993.2019.9075758
A. A. Hussein, R. A. Abd Khalid
There is no adopt that WSN affects strongly different applications and technologies, but with time a rapid changing is raised in networks and communication field developments. Therefore, many constraints are shows in WSN, one of these constraints and the most affected one is energy consumption; thus, as an inevitable result, these constraints should be overcome. Improvement of routing protocols in WSN can handle these constraints proficiently. In this paper, DDIEEPB and DDIEEPB-ACO (Double chain Double sink node Improved Energy Efficient PEGASIS protocol) using ACO (Ant Colony Optimization algorithm) is proposed. Simulation in Matlab proves that compared with the core protocol PEGASIS and the supported protocol IEEPB, DDIEEPB and DDIEEPB-ACO reduces the energy dissipation, enhance node survival rate, and prolong the network life cycle. The proposed protocols show good scalability, and it is suitable for the large-scale network.
{"title":"An Improved Energy Efficient Double Chain-based Routing Protocol using ACO","authors":"A. A. Hussein, R. A. Abd Khalid","doi":"10.1109/CAS47993.2019.9075758","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075758","url":null,"abstract":"There is no adopt that WSN affects strongly different applications and technologies, but with time a rapid changing is raised in networks and communication field developments. Therefore, many constraints are shows in WSN, one of these constraints and the most affected one is energy consumption; thus, as an inevitable result, these constraints should be overcome. Improvement of routing protocols in WSN can handle these constraints proficiently. In this paper, DDIEEPB and DDIEEPB-ACO (Double chain Double sink node Improved Energy Efficient PEGASIS protocol) using ACO (Ant Colony Optimization algorithm) is proposed. Simulation in Matlab proves that compared with the core protocol PEGASIS and the supported protocol IEEPB, DDIEEPB and DDIEEPB-ACO reduces the energy dissipation, enhance node survival rate, and prolong the network life cycle. The proposed protocols show good scalability, and it is suitable for the large-scale network.","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126683553","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 : 2019-12-01DOI: 10.1109/CAS47993.2019.9075492
Ammar Mohammed Saeed Ali, A. Farhan
QR code has emerged as strong platforms, and powerful for a large-scale field of scientific and industrial processes.it can execute an essential part in addressing the subject of authentication. QR codes are applied in domains that affect the transfer of text information, and these include-mail messages, phone numbers, hyperlinks or another text file, This pursuit has thus been helpful in our knowledge towards obtaining an adequate and inexpensive method that does not require a high level of training. A key aspect of this work is thus to propose a new method to succeed in the deficiencies of the limited size of the traditional QR code. It relies on the features of the Shannon-Fano encoding algorithm to decrease the size of the input data and the principles of the XOR function. The main structure of this paper can be summarised in the following sections. First, it deals with the handling of an authentication system. The second section deals with the enhancement of the QR code to promote the data storage capacity. The last section of this paper deals with the display of the experiment's results and discusses. The suggested algorithm was explained in the schemes of several aspects, such as the secrecy aspect, the durability aspect, the complexity aspect, and the storage capacity. In this work, the proposed QR code does not reproduce the configuration or structure of the QR code. Indeed, the experimental results of this paper produced better findings of a great deal of the previous work.
{"title":"A New Approach For Expansion the Throughput Capacity of the Quick Response Code","authors":"Ammar Mohammed Saeed Ali, A. Farhan","doi":"10.1109/CAS47993.2019.9075492","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075492","url":null,"abstract":"QR code has emerged as strong platforms, and powerful for a large-scale field of scientific and industrial processes.it can execute an essential part in addressing the subject of authentication. QR codes are applied in domains that affect the transfer of text information, and these include-mail messages, phone numbers, hyperlinks or another text file, This pursuit has thus been helpful in our knowledge towards obtaining an adequate and inexpensive method that does not require a high level of training. A key aspect of this work is thus to propose a new method to succeed in the deficiencies of the limited size of the traditional QR code. It relies on the features of the Shannon-Fano encoding algorithm to decrease the size of the input data and the principles of the XOR function. The main structure of this paper can be summarised in the following sections. First, it deals with the handling of an authentication system. The second section deals with the enhancement of the QR code to promote the data storage capacity. The last section of this paper deals with the display of the experiment's results and discusses. The suggested algorithm was explained in the schemes of several aspects, such as the secrecy aspect, the durability aspect, the complexity aspect, and the storage capacity. In this work, the proposed QR code does not reproduce the configuration or structure of the QR code. Indeed, the experimental results of this paper produced better findings of a great deal of the previous work.","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121846315","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 : 2019-12-01DOI: 10.1109/CAS47993.2019.9075699
Younis A. Sabawi
This work aims to construct a posteriori error bounds for semidiscrete semilinear parabolic problems in terms of $L$∞ (H1) norm. The curtail idea is to adapt the elliptic reconstruction technique introduced by Makridakis and Nochetto [8], this allows us to use error estimators derived for elliptic problems in order to obtain parabolic estimators that are of optimal order in space and time for non-Lipschitz nonlinearities, using relevant Sobolev Imbedding through continuation argument. These error bounds are subsequently used to reduce the computational of the scheme.
{"title":"A Posteriori $L_{infty}(H^{1})$ Error Bound in Finite Element Approximation of Semdiscrete Semilinear Parabolic Problems","authors":"Younis A. Sabawi","doi":"10.1109/CAS47993.2019.9075699","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075699","url":null,"abstract":"This work aims to construct a posteriori error bounds for semidiscrete semilinear parabolic problems in terms of $L$∞ (H1) norm. The curtail idea is to adapt the elliptic reconstruction technique introduced by Makridakis and Nochetto [8], this allows us to use error estimators derived for elliptic problems in order to obtain parabolic estimators that are of optimal order in space and time for non-Lipschitz nonlinearities, using relevant Sobolev Imbedding through continuation argument. These error bounds are subsequently used to reduce the computational of the scheme.","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123298408","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 : 2019-12-01DOI: 10.1109/CAS47993.2019.9075490
Eman L. Mohaisen, R. S. Mohammed
Information Security has still the aim of many agencies and organisations. They have great attention to cryptosystems to ensure the security of their information. So, scientists and researchers had proposed many cryptosystems and improve their performance via new methods and techniques. Most recent studies depended on the chaotic map with cipher systems which had gained most researchers to improve its security and robustness. The continued studies had mentioned several methods to strength these chaotic based ciphers and the randomness of its keystream generation. Some of the studies had proposed successful cipher techniques while others had not or advised further improvement. Another side, this paper tests chaotic maps which had used in the cipher algorithms to evaluate its randomness. In general, this paper gives a review of recent stream cipher based on chaotic maps. It also shows the randomness evaluation of chaotic maps. The survey recommended that Chen map is the most random method.
{"title":"Stream Cipher Based on Chaotic Maps","authors":"Eman L. Mohaisen, R. S. Mohammed","doi":"10.1109/CAS47993.2019.9075490","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075490","url":null,"abstract":"Information Security has still the aim of many agencies and organisations. They have great attention to cryptosystems to ensure the security of their information. So, scientists and researchers had proposed many cryptosystems and improve their performance via new methods and techniques. Most recent studies depended on the chaotic map with cipher systems which had gained most researchers to improve its security and robustness. The continued studies had mentioned several methods to strength these chaotic based ciphers and the randomness of its keystream generation. Some of the studies had proposed successful cipher techniques while others had not or advised further improvement. Another side, this paper tests chaotic maps which had used in the cipher algorithms to evaluate its randomness. In general, this paper gives a review of recent stream cipher based on chaotic maps. It also shows the randomness evaluation of chaotic maps. The survey recommended that Chen map is the most random method.","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134152282","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 : 2019-12-01DOI: 10.1109/CAS47993.2019.9075650
K. Jasim, A. Sadiq, Hasanen S. Abdullah
Argument mining processes in the legal domain it is aiming to detect and extract the premises, claims and their relations automatically from unstructured legal texts to provide structured data that can be processable by argumentation models. This paper presents a framework to detect and identify the components of arguments in texts of Arabic legal documents. The framework proposes a computational model adopts the supervised learning that integrates an annotated Arabic Legal Text corpus (ALTC), it is a collection of Iraq's Federal Court of Cassation decision documents with different binary classifiers based on relevant features to detect and identify the components of arguments from legal decisions texts as a final goal. The results of the framework experiments are promising, especially this paper is the first in argumentation mining processing at the level of the Arabic texts.
{"title":"A Framework for Detection and Identification the Components of Arguments in Arabic Legal Texts","authors":"K. Jasim, A. Sadiq, Hasanen S. Abdullah","doi":"10.1109/CAS47993.2019.9075650","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075650","url":null,"abstract":"Argument mining processes in the legal domain it is aiming to detect and extract the premises, claims and their relations automatically from unstructured legal texts to provide structured data that can be processable by argumentation models. This paper presents a framework to detect and identify the components of arguments in texts of Arabic legal documents. The framework proposes a computational model adopts the supervised learning that integrates an annotated Arabic Legal Text corpus (ALTC), it is a collection of Iraq's Federal Court of Cassation decision documents with different binary classifiers based on relevant features to detect and identify the components of arguments from legal decisions texts as a final goal. The results of the framework experiments are promising, especially this paper is the first in argumentation mining processing at the level of the Arabic texts.","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116482927","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 : 2019-12-01DOI: 10.1109/CAS47993.2019.9075670
Rasha M. Mohsin, Rasha I. Ahmed, Rusul Yaqub, Sura Ethar
The rapid development of technology by using the internet as a medium to transfer many types of data has led to the appearance of new problems, such as intrusion, hacking and other problems and providing the security for the progress using these algorithms. The Diffie-hillman algorithm is one of the key exchange protocols that used for the security of information, but by the passing time, the change of security progress led to the occurrence of many problems due to the using Diffie-Hellman protocol in key exchange such as Man-in-the-Middle attack and Discrete logarithm attack. So, to solve these problems and to obtain better security, it needs to generate a random colour image(NxN) for each encryption, then uses an image generated to extract keys by applying the XOR function.
{"title":"A new technique for Diffie-hillman key exchange protocol security using random image generation","authors":"Rasha M. Mohsin, Rasha I. Ahmed, Rusul Yaqub, Sura Ethar","doi":"10.1109/CAS47993.2019.9075670","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075670","url":null,"abstract":"The rapid development of technology by using the internet as a medium to transfer many types of data has led to the appearance of new problems, such as intrusion, hacking and other problems and providing the security for the progress using these algorithms. The Diffie-hillman algorithm is one of the key exchange protocols that used for the security of information, but by the passing time, the change of security progress led to the occurrence of many problems due to the using Diffie-Hellman protocol in key exchange such as Man-in-the-Middle attack and Discrete logarithm attack. So, to solve these problems and to obtain better security, it needs to generate a random colour image(NxN) for each encryption, then uses an image generated to extract keys by applying the XOR function.","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"351 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133134188","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
扫码关注我们
求助内容：
应助结果提醒方式：