The elliptical curve system has received great interest in the science of security systems, and this has a great number of advantages. When linked with chaotic systems, it gave a broad comprehensiveness in the science of finding common keys between the two parties or in a system as a server that distributes the common keys among the participants in the distress. The proposed algorithm reduces processor load, reduces power consumption, increases processing speed, enhances storage efficiency , requires smaller certificates, and is good at saving bandwidth. Where ECC gives high-level arithmetic operations ECC is an algebraic structure in wide areas for a large number of points and any point in the Cartesian coordinates, as well as for a number of prime numbers generated from the chaotic three-dimensional system using the multiplication and addition algorithm of the elliptical curved system. This paper suggested a new event in the implementation method: the inputs to the elements of the controlling parameters and the initial conditions of the symmetric chaotic functions produce an ECC by a secret shared key between two parties or a number of parties participating in the group, and all these points of the share keys lie on the points of the curve. and this key technology is available for authentication, confidentiality, and non-repudiation.
{"title":"Protocol Built by Chaotic Map and Elliptic Curve Cryptography for Key Exchange","authors":"Dr. Abdul-Wahab Sami Ibrahim, Majed Ismael Sameer","doi":"10.7753/ijcatr1205.1003","DOIUrl":"https://doi.org/10.7753/ijcatr1205.1003","url":null,"abstract":"The elliptical curve system has received great interest in the science of security systems, and this has a great number of advantages. When linked with chaotic systems, it gave a broad comprehensiveness in the science of finding common keys between the two parties or in a system as a server that distributes the common keys among the participants in the distress. The proposed algorithm reduces processor load, reduces power consumption, increases processing speed, enhances storage efficiency , requires smaller certificates, and is good at saving bandwidth. Where ECC gives high-level arithmetic operations ECC is an algebraic structure in wide areas for a large number of points and any point in the Cartesian coordinates, as well as for a number of prime numbers generated from the chaotic three-dimensional system using the multiplication and addition algorithm of the elliptical curved system. This paper suggested a new event in the implementation method: the inputs to the elements of the controlling parameters and the initial conditions of the symmetric chaotic functions produce an ECC by a secret shared key between two parties or a number of parties participating in the group, and all these points of the share keys lie on the points of the curve. and this key technology is available for authentication, confidentiality, and non-repudiation.","PeriodicalId":104117,"journal":{"name":"International Journal of Computer Applications Technology and Research","volume":"170 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126423296","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 : 2023-04-27DOI: 10.7753/10.7753/ijcatr1205.1002
Dr. Abdul-Wahab Sami Ibrahim, Majed Ismael Sameer
In order to reach the level of security between the two parties or a group of parties in the communication channel, the inputs of the protocol algorithm must be characterized by the sensitivity of the initial parameters and conditions involved in the chaotic functions with great ability to change in any very slight manipulation of the inputs by the attacker or intruder because there will be Much of the fundamental change in the values of the shared keys of the two parties or participants in the system, as well as the prime numbers and primitive roots, is hidden rather than public. Use the magic square system algorithm to find the magic constant from the values of the Defy protocol algorithm with the chaotic values of three dimensions, and this magic constant will give us the long values of the shared keys between the parties participating in the group or the server used to distribute the shared keys to the parties, ensuring that this protocol is not attacked by a third party trying to enter the communication channel. The performance of the algorithm was analyzed by conducting and measuring the efficiency of protocol implementation, analyzing key length and sensitivity, and finding the speed of algorithm performance within the acceptable range of the number of participants in the system. A protocol algorithm in Matlab R2013b was used to implement the algorithm and perform the analyses.
{"title":"Protocol Build by the Chaotic Map and Magic Square for Exchange Key Share","authors":"Dr. Abdul-Wahab Sami Ibrahim, Majed Ismael Sameer","doi":"10.7753/10.7753/ijcatr1205.1002","DOIUrl":"https://doi.org/10.7753/10.7753/ijcatr1205.1002","url":null,"abstract":"In order to reach the level of security between the two parties or a group of parties in the communication channel, the inputs of the protocol algorithm must be characterized by the sensitivity of the initial parameters and conditions involved in the chaotic functions with great ability to change in any very slight manipulation of the inputs by the attacker or intruder because there will be Much of the fundamental change in the values of the shared keys of the two parties or participants in the system, as well as the prime numbers and primitive roots, is hidden rather than public. Use the magic square system algorithm to find the magic constant from the values of the Defy protocol algorithm with the chaotic values of three dimensions, and this magic constant will give us the long values of the shared keys between the parties participating in the group or the server used to distribute the shared keys to the parties, ensuring that this protocol is not attacked by a third party trying to enter the communication channel. The performance of the algorithm was analyzed by conducting and measuring the efficiency of protocol implementation, analyzing key length and sensitivity, and finding the speed of algorithm performance within the acceptable range of the number of participants in the system. A protocol algorithm in Matlab R2013b was used to implement the algorithm and perform the analyses.","PeriodicalId":104117,"journal":{"name":"International Journal of Computer Applications Technology and Research","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125884353","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}
Aiming at the data bit width conversion module used in PCIE4.0 physical coding layer, this paper designs a backwards compatibility-capable implementation method, which combines the version below backwards compatibility 4.0. According to the data bit width selection signal BusWidth of MAC layer in PCIE protocol, the current running speed of PCIE is selected. So as to select the form of bit width conversion. The designed PCIE internal strobe signal is 32 bits wide, and the correctness of its coding operation mode is verified by using the description language of Verilog hardware and the joint simulation form of Verdi and VCS.
{"title":"Design of Bit Width Converter Based on PCIE4.0","authors":"Linjun Liu, Hai Nie, Weiwei Ling","doi":"10.7753/ijcatr1205.1001","DOIUrl":"https://doi.org/10.7753/ijcatr1205.1001","url":null,"abstract":"Aiming at the data bit width conversion module used in PCIE4.0 physical coding layer, this paper designs a backwards compatibility-capable implementation method, which combines the version below backwards compatibility 4.0. According to the data bit width selection signal BusWidth of MAC layer in PCIE protocol, the current running speed of PCIE is selected. So as to select the form of bit width conversion. The designed PCIE internal strobe signal is 32 bits wide, and the correctness of its coding operation mode is verified by using the description language of Verilog hardware and the joint simulation form of Verdi and VCS.","PeriodicalId":104117,"journal":{"name":"International Journal of Computer Applications Technology and Research","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132817638","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}
Mobile nodes in military environments like a field of battle or a hostile region ar seemingly to suffer from intermittent network property and frequent partitions. Disruption-tolerant network (DTN) technologieshave become eminent solutions that enable wireless devices carried by troopers to speak with one another and access the guidance or command faithfully by exploiting secondary storage nodes.a number of the foremost difficult problems during this state of affairs ar the social control of authorization policiesand also the policies update for secure information retrieval. Ciphertextpolicy attribute-based secret writing (CP-ABE) could be a promising cryptologic resolution to the access management problems. However, the matter of applying CP-ABE in suburbanised DTNs introduces many security and privacy challenges with respect to the issued fromtotally different authorities. during this paper, we have a tendencyto propose secure information retrieval theme victimization CP-ABE for suburbanised DTNs wherever multiple key authorities manage their attributes severally. we have a tendency to demonstrate a way to apply the projected mechanism and with efficiency manage confidential information distributed within the disruption-tolerant military network. Keyworsds: DTNDisruption tolerant network, CP-ABECipher text-Policy Attribute-Based Encryption, IBEIdentity Based Encryption2 PC-Protocol To Protocol, PKI-Public Key Infrastructure, ACG-Access Control Gadgets , DBDHDecision Bilinear Diffie Hellman assumption, KGC-Key Generative Center. International Journal of Computer Applications Technology and Research Volume 4– Issue 5, 368 373, 2015, ISSN:2319–8656 www.ijcat.com 369 I.INTRODUCTION In several military network troopers is briefly disconnected by jam,environmental. Disruptiontolerant network (DTN) technologies have become successful solutions that enable nodes to speak with one another in these extreme networking access services specified knowledge access policies are outlined over user attributes or roles that are managed by disruption-tolerant military network, a commander might store a counseling at a 1” United Nations agency are taking part in “Region two.” during this case, it's an inexpensive assumption that multiple key authorities are possible to manage their own dynamic attributes for troopers in their deployed regions or echelons, (ABE) [11]–[14] could be a promising approach that fulfills the wants forsecure knowledge retrieval in DTNs. ABE options a mechanism that allows associate degree access management over encrypted knowledge exploitation access policies and ascribed attributes among personal keys and ciphertexts. Especially, ciphertext-policy ABE (CPABE) provides a scalable method of encrypting knowledge specified the encryptor defines the attribute set that the decryptor must possess so as to de-crypt the ciphertext [13].. However, the matter of applying the ABE to DTNs introduces many security their associated attributes at some pu
{"title":"Military Networks by Disruption Tolerant Network Technology","authors":"K. Srikanth","doi":"10.7753/ijcatr0405.1007","DOIUrl":"https://doi.org/10.7753/ijcatr0405.1007","url":null,"abstract":"Mobile nodes in military environments like a field of battle or a hostile region ar seemingly to suffer from intermittent network property and frequent partitions. Disruption-tolerant network (DTN) technologieshave become eminent solutions that enable wireless devices carried by troopers to speak with one another and access the guidance or command faithfully by exploiting secondary storage nodes.a number of the foremost difficult problems during this state of affairs ar the social control of authorization policiesand also the policies update for secure information retrieval. Ciphertextpolicy attribute-based secret writing (CP-ABE) could be a promising cryptologic resolution to the access management problems. However, the matter of applying CP-ABE in suburbanised DTNs introduces many security and privacy challenges with respect to the issued fromtotally different authorities. during this paper, we have a tendencyto propose secure information retrieval theme victimization CP-ABE for suburbanised DTNs wherever multiple key authorities manage their attributes severally. we have a tendency to demonstrate a way to apply the projected mechanism and with efficiency manage confidential information distributed within the disruption-tolerant military network. Keyworsds: DTNDisruption tolerant network, CP-ABECipher text-Policy Attribute-Based Encryption, IBEIdentity Based Encryption2 PC-Protocol To Protocol, PKI-Public Key Infrastructure, ACG-Access Control Gadgets , DBDHDecision Bilinear Diffie Hellman assumption, KGC-Key Generative Center. International Journal of Computer Applications Technology and Research Volume 4– Issue 5, 368 373, 2015, ISSN:2319–8656 www.ijcat.com 369 I.INTRODUCTION In several military network troopers is briefly disconnected by jam,environmental. Disruptiontolerant network (DTN) technologies have become successful solutions that enable nodes to speak with one another in these extreme networking access services specified knowledge access policies are outlined over user attributes or roles that are managed by disruption-tolerant military network, a commander might store a counseling at a 1” United Nations agency are taking part in “Region two.” during this case, it's an inexpensive assumption that multiple key authorities are possible to manage their own dynamic attributes for troopers in their deployed regions or echelons, (ABE) [11]–[14] could be a promising approach that fulfills the wants forsecure knowledge retrieval in DTNs. ABE options a mechanism that allows associate degree access management over encrypted knowledge exploitation access policies and ascribed attributes among personal keys and ciphertexts. Especially, ciphertext-policy ABE (CPABE) provides a scalable method of encrypting knowledge specified the encryptor defines the attribute set that the decryptor must possess so as to de-crypt the ciphertext [13].. However, the matter of applying the ABE to DTNs introduces many security their associated attributes at some pu","PeriodicalId":104117,"journal":{"name":"International Journal of Computer Applications Technology and Research","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132021805","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}
{"title":"Analysis of Comparison of Fuzzy Knn, C4.5 Algorithm, and Naïve Bayes Classification Method for Diabetes Mellitus Diagnosis","authors":"","doi":"10.7753/ijcatr0708.1010","DOIUrl":"https://doi.org/10.7753/ijcatr0708.1010","url":null,"abstract":"","PeriodicalId":104117,"journal":{"name":"International Journal of Computer Applications Technology and Research","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115471641","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}
{"title":"Assessment of the Efficiency of Customer Order Management System: A Case Study of Sambajo General Enterprises Jigawa State, Nigeria","authors":"","doi":"10.7753/ijcatr0708.1004","DOIUrl":"https://doi.org/10.7753/ijcatr0708.1004","url":null,"abstract":"","PeriodicalId":104117,"journal":{"name":"International Journal of Computer Applications Technology and Research","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123235490","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}
{"title":"Moore’s Law Effect on Transistors Evolution","authors":"","doi":"10.7753/ijcatr0507.1014","DOIUrl":"https://doi.org/10.7753/ijcatr0507.1014","url":null,"abstract":"","PeriodicalId":104117,"journal":{"name":"International Journal of Computer Applications Technology and Research","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123955776","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}
One of the core quality assurance feature which combines fault prevention and fault detection, is often known as testability approach also. There are many assessment techniques and quantification method evolved for software testability prediction which actually identifies testability weakness or factors to further help reduce test effort. This paper examines all those measurement techniques that are being proposed for software testability assessment at various phases of object oriented software development life cycle. The aim is to find the best metrics suit for software quality improvisation through software testability support. The ultimate objective is to establish the ground work for finding ways reduce the testing effort by improvising software testability and its assessment using well planned guidelines for object-oriented software development with the help of suitable metrics.
{"title":"Object Oriented Software Testability (OOST) Metrics Analysis","authors":"P. Suri","doi":"10.7753/ijcatr0405.1006","DOIUrl":"https://doi.org/10.7753/ijcatr0405.1006","url":null,"abstract":"One of the core quality assurance feature which combines fault prevention and fault detection, is often known as testability approach also. There are many assessment techniques and quantification method evolved for software testability prediction which actually identifies testability weakness or factors to further help reduce test effort. This paper examines all those measurement techniques that are being proposed for software testability assessment at various phases of object oriented software development life cycle. The aim is to find the best metrics suit for software quality improvisation through software testability support. The ultimate objective is to establish the ground work for finding ways reduce the testing effort by improvising software testability and its assessment using well planned guidelines for object-oriented software development with the help of suitable metrics.","PeriodicalId":104117,"journal":{"name":"International Journal of Computer Applications Technology and Research","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115252129","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}
Software test-case generation is the process of identifying a set of test cases. It is necessary to generate the test sequence that satisfies the testing criteria. For solving this kind of difficult problem there were a lot of research works, which have been done in the past. The length of the test sequence plays an important role in software testing. The length of test sequence decides whether the sufficient testing is carried or not. Many existing test sequence generation techniques uses genetic algorithm for test-case generation in software testing. The Genetic Algorithm (GA) is an optimization heuristic technique that is implemented through evolution and fitness function. It generates new test cases from the existing test sequence. Further to improve the existing techniques, a new technique is proposed in this paper which combines the tabu search algorithm and the genetic algorithm. The hybrid technique combines the strength of the two meta-heuristic methods and produces efficient testcase sequence.
{"title":"Test-Case Optimization Using Genetic and Tabu Search Algorithm in Structural Testing","authors":"T. B. Miranda, M. Dhivya, K. Sathyamoorthy","doi":"10.7753/ijcatr0405.1005","DOIUrl":"https://doi.org/10.7753/ijcatr0405.1005","url":null,"abstract":"Software test-case generation is the process of identifying a set of test cases. It is necessary to generate the test sequence that satisfies the testing criteria. For solving this kind of difficult problem there were a lot of research works, which have been done in the past. The length of the test sequence plays an important role in software testing. The length of test sequence decides whether the sufficient testing is carried or not. Many existing test sequence generation techniques uses genetic algorithm for test-case generation in software testing. The Genetic Algorithm (GA) is an optimization heuristic technique that is implemented through evolution and fitness function. It generates new test cases from the existing test sequence. Further to improve the existing techniques, a new technique is proposed in this paper which combines the tabu search algorithm and the genetic algorithm. The hybrid technique combines the strength of the two meta-heuristic methods and produces efficient testcase sequence.","PeriodicalId":104117,"journal":{"name":"International Journal of Computer Applications Technology and Research","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114639301","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}
Comparison between RISC and CISC in the language of computer architecture for research is not very simple because a lot of researcher worked on RISC and CISC Architectures. Both these architecture differ substantially in terms of their underlying platforms and hardware architectures. The type of chips used differs a lot and there exists too many variants as well. This paper gives us the architectural comparison between RISC and CISC architectures. Also, we provide their advantages performance point of view and share our idea to the new researchers.
{"title":"Comparative Study of RISC AND CISC Architectures","authors":"Shahzeb, Naveed Hussain, Amanulllah, Furqan Ahmad, Salman Khan","doi":"10.7753/ijcatr0507.1015","DOIUrl":"https://doi.org/10.7753/ijcatr0507.1015","url":null,"abstract":"Comparison between RISC and CISC in the language of computer architecture for research is not very simple because a lot of researcher worked on RISC and CISC Architectures. Both these architecture differ substantially in terms of their underlying platforms and hardware architectures. The type of chips used differs a lot and there exists too many variants as well. This paper gives us the architectural comparison between RISC and CISC architectures. Also, we provide their advantages performance point of view and share our idea to the new researchers.","PeriodicalId":104117,"journal":{"name":"International Journal of Computer Applications Technology and Research","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116272272","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
扫码关注我们
求助内容：
应助结果提醒方式：