Abid Abdellah, Hicham Rrghout, Mourad Kattass, A. Jarjar, Abdellhamid Benazzi
This paper introduces a novel approach to encrypt color images, utilizing multiple chaotic maps and working with any size pixel blocks. The encryption procedure commences by converting the original image into a vector, which is then divided into equal dimension subblocks. These blocks undergo a new Vigenère transformation, employing two large dynamic substitution tables interconnected by an enhanced Hill operation using a large invertible matrix generated from a pseudo-random table, controlled by another binary dynamics table. Additionally, the truncated block undergoes the same encryption process using another pseudo-random invertible matrix. To evaluate the effectiveness and resilience of our algorithm, we conducted numerous simulations on randomly selected images of varying sizes and formats from diverse databases.
{"title":"big S-Boxes for Deeply Improved Hill Image Coding","authors":"Abid Abdellah, Hicham Rrghout, Mourad Kattass, A. Jarjar, Abdellhamid Benazzi","doi":"10.47679/ijasca.v3i1.42","DOIUrl":"https://doi.org/10.47679/ijasca.v3i1.42","url":null,"abstract":"This paper introduces a novel approach to encrypt color images, utilizing multiple chaotic maps and working with any size pixel blocks. The encryption procedure commences by converting the original image into a vector, which is then divided into equal dimension subblocks. These blocks undergo a new Vigenère transformation, employing two large dynamic substitution tables interconnected by an enhanced Hill operation using a large invertible matrix generated from a pseudo-random table, controlled by another binary dynamics table. Additionally, the truncated block undergoes the same encryption process using another pseudo-random invertible matrix. To evaluate the effectiveness and resilience of our algorithm, we conducted numerous simulations on randomly selected images of varying sizes and formats from diverse databases.","PeriodicalId":507177,"journal":{"name":"International Journal of Advanced Science and Computer Applications","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139282902","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}
When building sequential algorithms for problems on the graphic network, the algorithms themselves are not only very complex but the complexity of the algorithms also is very big. Thus, sequential algorithms must be parralled to share work and reduce computation time. For above reasons, it is crucial to build parallelization of algorithms in extended graph to find the shortest path. Therefore, a study of algorithm finding the shortest path from a source node to all nodes in the MapReduce architectures is essential to deal with many real problems with huge input data in our daily life. MapReduce architectures processes on (Key, Value) pairs are independent between processes, so multiple processes can be assigned to execute simultaneously on the Hodoop system to reduce calculation time
{"title":"The MapReduce based approach to improve the all-pair shortest path computation","authors":"Lau Nguyen Dinh","doi":"10.47679/ijasca.v3i1.44","DOIUrl":"https://doi.org/10.47679/ijasca.v3i1.44","url":null,"abstract":"When building sequential algorithms for problems on the graphic network, the algorithms themselves are not only very complex but the complexity of the algorithms also is very big. Thus, sequential algorithms must be parralled to share work and reduce computation time. For above reasons, it is crucial to build parallelization of algorithms in extended graph to find the shortest path. Therefore, a study of algorithm finding the shortest path from a source node to all nodes in the MapReduce architectures is essential to deal with many real problems with huge input data in our daily life. MapReduce architectures processes on (Key, Value) pairs are independent between processes, so multiple processes can be assigned to execute simultaneously on the Hodoop system to reduce calculation time","PeriodicalId":507177,"journal":{"name":"International Journal of Advanced Science and Computer Applications","volume":"64 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139282590","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}
Alsadig Abdallah, A. Talib, M. Ibrahim, E. AbdElgader
The volume of Big Data produced from various sources is always growing. Such vast amounts of data cannot be stored using conventional techniques. As a result, the majority of businesses have switched to using cloud storage as a substitute for storing Big Data. Cloud storage has made great progress, but there are still several problems, such security worries. This article examines Big Data, its difficulties, and many security concerns from the perspectives of various encryption approaches. Additionally, it presents various views to address these issues and suggests a new classification of Big Data security difficulties
{"title":"Systematic Review from Different Encryption Techniques Perspectives","authors":"Alsadig Abdallah, A. Talib, M. Ibrahim, E. AbdElgader","doi":"10.47679/ijasca.v3i1.46","DOIUrl":"https://doi.org/10.47679/ijasca.v3i1.46","url":null,"abstract":"The volume of Big Data produced from various sources is always growing. Such vast amounts of data cannot be stored using conventional techniques. As a result, the majority of businesses have switched to using cloud storage as a substitute for storing Big Data. Cloud storage has made great progress, but there are still several problems, such security worries. This article examines Big Data, its difficulties, and many security concerns from the perspectives of various encryption approaches. Additionally, it presents various views to address these issues and suggests a new classification of Big Data security difficulties","PeriodicalId":507177,"journal":{"name":"International Journal of Advanced Science and Computer Applications","volume":"2 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139283013","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
扫码关注我们
求助内容：
应助结果提醒方式：