{"title":"Text Cryptography via Special Polynomial Technique","authors":"","doi":"10.31642/jokmc/2018/090103","DOIUrl":"https://doi.org/10.31642/jokmc/2018/090103","url":null,"abstract":"","PeriodicalId":115908,"journal":{"name":"Journal of Kufa for Mathematics and Computer","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130477243","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":"Suggest a method for exchanging information in ad hoc networks","authors":"","doi":"10.31642/jokmc/2018/090101","DOIUrl":"https://doi.org/10.31642/jokmc/2018/090101","url":null,"abstract":"","PeriodicalId":115908,"journal":{"name":"Journal of Kufa for Mathematics and Computer","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116993005","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":"The Cyclic Decomposition of cf(Q_28×C_p)/ R ̅(Q_28×C_p)","authors":"","doi":"10.31642/jokmc/2018/090105","DOIUrl":"https://doi.org/10.31642/jokmc/2018/090105","url":null,"abstract":"","PeriodicalId":115908,"journal":{"name":"Journal of Kufa for Mathematics and Computer","volume":"99 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113990330","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":"A New Approach for Solving Multi Products Transportation Problem","authors":"Anwar Nsaif Jasim, Kadhim B. S. Aljanabi","doi":"10.31642/jokmc/2018/070201","DOIUrl":"https://doi.org/10.31642/jokmc/2018/070201","url":null,"abstract":"— The problem of transportation is studied in many areas, most importantly in the field of logistics and \u0000operations management. The distribution problem of goods and commodities from sources to destinations is an \u0000important problem where many methods have been used to obtain its optimum solution, which represents the \u0000minimum cost of distribution the goods from sources to destinations. Generally, the transportation classical cost of \u0000one unit of a good is depending on the source and the destination. In this paper, we suggest an approach to obtain a \u0000solution to the transportation problem consisting of two products or more and then by using the modified Kruskal’s \u0000algorithm we find the minimum feasible solution.","PeriodicalId":115908,"journal":{"name":"Journal of Kufa for Mathematics and Computer","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126634862","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":"Applications of Wavelets for BVPs and Signal Processing","authors":"Z. Alabacy","doi":"10.31642/jokmc/2018/070203","DOIUrl":"https://doi.org/10.31642/jokmc/2018/070203","url":null,"abstract":"The transfer of information using the signal needs speed, which leads to the compression of the information. \u0000It is only possible through the process of using a mathematical technique at work. \u0000To demonstrate an increase in theory efficiency, it was used in signal processing, compression, and good results. In \u0000section 4 Matrix was used because M=3 was taken, where six functions were obtained, when these functions \u0000were integrated, the operations matrix of integration was added, which was added to solve Boundary Value \u0000Problems (BVPs) numerically. In addition to solving problems numerically, using the proposed technique, which is \u0000signal processing, to demonstrate the efficiency of the proposed theory as indicated in section 2, wavelets are built on \u0000the dependence of the four effects . In addition, the number of equations obtained is calculated based on the \u0000value of where six functions are obtained and the greater value of is obtained More \u0000functions, leading to greater accuracy in obtaining the best results.","PeriodicalId":115908,"journal":{"name":"Journal of Kufa for Mathematics and Computer","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128967112","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":"A Multiplicative-Additive Chaotic-Address Steganography","authors":"Haneen H. Alwan, Zahir M. Hussain","doi":"10.31642/jokmc/2018/070204","DOIUrl":"https://doi.org/10.31642/jokmc/2018/070204","url":null,"abstract":"In this study, Multiple-Chaotic maps were merged by using multiplicative-additive form to generate the \u0000chaotic sequences which are used to track the addresses of shuffled bits in steganography. Three techniques are \u0000introduced for image steganography in the spatial domain. The first system is based on the well-known LSB \u0000technique, the second system is based on looking for the identical bits between the secret message and the cover \u0000image and the third system is based on the concept of LSB substitution, it is employed the mapping of secret data bits \u0000with cover pixel bits. It was tested and evaluated security levels for the proposed techniques by using the Peak \u0000Signal-to-Noise Ratio (PSNR), Mean Square Error (MSE), histogram analysis and correlative analysis and tested the \u0000Chaotic sequences generated by using correlation, Lypaunov exponents, Poincaré section and 0-1Test. The results \u0000show that the proposed methods perform better than existed systems.","PeriodicalId":115908,"journal":{"name":"Journal of Kufa for Mathematics and Computer","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114842560","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":"Simulate the processing of data loss in sensor networks by proposing a high speed encryption mechanism","authors":"N. Jarah","doi":"10.31642/jokmc/2018/070202","DOIUrl":"https://doi.org/10.31642/jokmc/2018/070202","url":null,"abstract":"Prepare network sensor as a context to achieve network community everywhere , it has made \u0000technological innovations sensor smaller and more efficient to use in the discovery of the ocean and gain valuable \u0000information, it can be as simple as a temperature gauge or as complicated as if used in military and dangerous areas \u0000In order to transmit information safely and without any loss, it is necessary to study a dedicated processing \u0000mechanism for calculating the encryption taking into account the reduction of power consumption of the sensor node. \u0000the network has been simulated using QualNet","PeriodicalId":115908,"journal":{"name":"Journal of Kufa for Mathematics and Computer","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114880574","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":"Survey on Modern Cryptography","authors":"Mustafa Abd Zaid, Soukaena Hassan","doi":"10.31642/jokmc/2018/070101","DOIUrl":"https://doi.org/10.31642/jokmc/2018/070101","url":null,"abstract":"Security is one of the significant difficulties that individuals are confronting when the information exchanged over the internet in today's world. Cryptography is the way to achieve security of network or data by hiding the important information from unauthorized individuals. Encryption is a mechanism of converting plain-text into cipher-text in order to be unreadable by unwanted people. In this review, we explain some important cryptography primitives ( symmetric and asymmetric cryptography algorithms) with examples for each type. Comparative study is making among this cryptography primitives according to many parameters such as structure, speed, block size and others parameters.","PeriodicalId":115908,"journal":{"name":"Journal of Kufa for Mathematics and Computer","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124084081","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":"ZT1 spaces and semi-ZT1 spaces","authors":"","doi":"10.31642/jokmc/2018/080202","DOIUrl":"https://doi.org/10.31642/jokmc/2018/080202","url":null,"abstract":"","PeriodicalId":115908,"journal":{"name":"Journal of Kufa for Mathematics and Computer","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131008742","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":"Certain Types of Regular and T3 Spaces","authors":"","doi":"10.31642/jokmc/2018/080201","DOIUrl":"https://doi.org/10.31642/jokmc/2018/080201","url":null,"abstract":"","PeriodicalId":115908,"journal":{"name":"Journal of Kufa for Mathematics and Computer","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124228929","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号
