CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: encryption and decryption</title> <meta name="description" content="Search results for: encryption and decryption"> <meta name="keywords" content="encryption and decryption"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="encryption and decryption" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="encryption and decryption"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 183</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: encryption and decryption</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">183</span> An Algorithm Based on the Nonlinear Filter Generator for Speech Encryption</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Belmeguenai">A. Belmeguenai</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20Mansouri"> K. Mansouri</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20Djemili"> R. Djemili</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This work present a new algorithm based on the nonlinear filter generator for speech encryption and decryption. The proposed algorithm consists on the use a linear feedback shift register (LFSR) whose polynomial is primitive and nonlinear Boolean function. The purpose of this system is to construct Keystream with good statistical properties, but also easily computable on a machine with limited capacity calculated. This proposed speech encryption scheme is very simple, highly efficient, and fast to implement the speech encryption and decryption. We conclude the paper by showing that this system can resist certain known attacks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20filter%20generator" title="nonlinear filter generator">nonlinear filter generator</a>, <a href="https://publications.waset.org/abstracts/search?q=stream%20ciphers" title=" stream ciphers"> stream ciphers</a>, <a href="https://publications.waset.org/abstracts/search?q=speech%20encryption" title=" speech encryption"> speech encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=security%20analysis" title=" security analysis"> security analysis</a> </p> <a href="https://publications.waset.org/abstracts/39095/an-algorithm-based-on-the-nonlinear-filter-generator-for-speech-encryption" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/39095.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">296</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">182</span> A Comparative Analysis of Asymmetric Encryption Schemes on Android Messaging Service</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mabrouka%20Algherinai">Mabrouka Algherinai</a>, <a href="https://publications.waset.org/abstracts/search?q=Fatma%20Karkouri"> Fatma Karkouri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Today, Short Message Service (SMS) is an important means of communication. SMS is not only used in informal environment for communication and transaction, but it is also used in formal environments such as institutions, organizations, companies, and business world as a tool for communication and transactions. Therefore, there is a need to secure the information that is being transmitted through this medium to ensure security of information both in transit and at rest. But, encryption has been identified as a means to provide security to SMS messages in transit and at rest. Several past researches have proposed and developed several encryption algorithms for SMS and Information Security. This research aims at comparing the performance of common Asymmetric encryption algorithms on SMS security. The research employs the use of three algorithms, namely RSA, McEliece, and RABIN. Several experiments were performed on SMS of various sizes on android mobile device. The experimental results show that each of the three techniques has different key generation, encryption, and decryption times. The efficiency of an algorithm is determined by the time that it takes for encryption, decryption, and key generation. The best algorithm can be chosen based on the least time required for encryption. The obtained results show the least time when McEliece size 4096 is used. RABIN size 4096 gives most time for encryption and so it is the least effective algorithm when considering encryption. Also, the research shows that McEliece size 2048 has the least time for key generation, and hence, it is the best algorithm as relating to key generation. The result of the algorithms also shows that RSA size 1024 is the most preferable algorithm in terms of decryption as it gives the least time for decryption. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=SMS" title="SMS">SMS</a>, <a href="https://publications.waset.org/abstracts/search?q=RSA" title=" RSA"> RSA</a>, <a href="https://publications.waset.org/abstracts/search?q=McEliece" title=" McEliece"> McEliece</a>, <a href="https://publications.waset.org/abstracts/search?q=RABIN" title=" RABIN"> RABIN</a> </p> <a href="https://publications.waset.org/abstracts/97665/a-comparative-analysis-of-asymmetric-encryption-schemes-on-android-messaging-service" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/97665.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">163</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">181</span> Evolutionary Methods in Cryptography </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wafa%20Slaibi%20Alsharafat">Wafa Slaibi Alsharafat</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Genetic algorithms (GA) are random algorithms as random numbers that are generated during the operation of the algorithm determine what happens. This means that if GA is applied twice to optimize exactly the same problem it might produces two different answers. In this project, we propose an evolutionary algorithm and Genetic Algorithm (GA) to be implemented in symmetric encryption and decryption. Here, user's message and user secret information (key) which represent plain text to be transferred into cipher text. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=GA" title="GA">GA</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=decryption" title=" decryption"> decryption</a>, <a href="https://publications.waset.org/abstracts/search?q=crossover" title=" crossover"> crossover</a> </p> <a href="https://publications.waset.org/abstracts/21507/evolutionary-methods-in-cryptography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21507.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">445</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">180</span> Implementation of Achterbahn-128 for Images Encryption and Decryption</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aissa%20Belmeguenai">Aissa Belmeguenai</a>, <a href="https://publications.waset.org/abstracts/search?q=Khaled%20Mansouri"> Khaled Mansouri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this work, an efficient implementation of Achterbahn-128 for images encryption and decryption was introduced. The implementation for this simulated project is written by MATLAB.7.5. At first two different original images are used for validate the proposed design. Then our developed program was used to transform the original images data into image digits file. Finally, we used our implemented program to encrypt and decrypt images data. Several tests are done for proving the design performance including visual tests and security analysis; we discuss the security analysis of the proposed image encryption scheme including some important ones like key sensitivity analysis, key space analysis, and statistical attacks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Achterbahn-128" title="Achterbahn-128">Achterbahn-128</a>, <a href="https://publications.waset.org/abstracts/search?q=stream%20cipher" title=" stream cipher"> stream cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20encryption" title=" image encryption"> image encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=security%20analysis" title=" security analysis"> security analysis</a> </p> <a href="https://publications.waset.org/abstracts/20401/implementation-of-achterbahn-128-for-images-encryption-and-decryption" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20401.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">532</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">179</span> DCT and Stream Ciphers for Improved Image Encryption Mechanism </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=T.%20R.%20Sharika">T. R. Sharika</a>, <a href="https://publications.waset.org/abstracts/search?q=Ashwini%20Kumar"> Ashwini Kumar</a>, <a href="https://publications.waset.org/abstracts/search?q=Kamal%20Bijlani"> Kamal Bijlani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Encryption is the process of converting crucial information’s unreadable to unauthorized persons. Image security is an important type of encryption that secures all type of images from cryptanalysis. A stream cipher is a fast symmetric key algorithm which is used to convert plaintext to cipher text. In this paper we are proposing an image encryption algorithm with Discrete Cosine Transform and Stream Ciphers that can improve compression of images and enhanced security. The paper also explains the use of a shuffling algorithm for enhancing securing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=decryption" title="decryption">decryption</a>, <a href="https://publications.waset.org/abstracts/search?q=DCT" title=" DCT"> DCT</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=RC4%20cipher" title=" RC4 cipher"> RC4 cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=stream%20cipher" title=" stream cipher"> stream cipher</a> </p> <a href="https://publications.waset.org/abstracts/32780/dct-and-stream-ciphers-for-improved-image-encryption-mechanism" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32780.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">361</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">178</span> Symmetric Arabic Language Encryption Technique Based on Modified Playfair Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fairouz%20Beggas">Fairouz Beggas</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Due to the large number of exchanges in the networks, the security of communications is essential. Most ways of keeping communication secure rely on encryption. In this work, a symmetric encryption technique is offered to encrypt and decrypt simple Arabic scripts based on a multi-level security. A proposed technique uses an idea of Playfair encryption with a larger table size and an additional layer of encryption to ensure more security. The idea of the proposed algorithm aims to generate a dynamic table that depends on a secret key. The same secret key is also used to create other secret keys to over-encrypt the plaintext in three steps. The obtained results show that the proposed algorithm is faster in terms of encryption/decryption speed and can resist to many types of attacks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=arabic%20data" title="arabic data">arabic data</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=playfair" title=" playfair"> playfair</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric%20algorithm" title=" symmetric algorithm"> symmetric algorithm</a> </p> <a href="https://publications.waset.org/abstracts/159982/symmetric-arabic-language-encryption-technique-based-on-modified-playfair-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/159982.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">87</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">177</span> Image Encryption Using Eureqa to Generate an Automated Mathematical Key</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Halima%20Adel%20Halim%20Shnishah">Halima Adel Halim Shnishah</a>, <a href="https://publications.waset.org/abstracts/search?q=David%20Mulvaney"> David Mulvaney</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Applying traditional symmetric cryptography algorithms while computing encryption and decryption provides immunity to secret keys against different attacks. One of the popular techniques generating automated secret keys is evolutionary computing by using Eureqa API tool, which got attention in 2013. In this paper, we are generating automated secret keys for image encryption and decryption using Eureqa API (tool which is used in evolutionary computing technique). Eureqa API models pseudo-random input data obtained from a suitable source to generate secret keys. The validation of generated secret keys is investigated by performing various statistical tests (histogram, chi-square, correlation of two adjacent pixels, correlation between original and encrypted images, entropy and key sensitivity). Experimental results obtained from methods including histogram analysis, correlation coefficient, entropy and key sensitivity, show that the proposed image encryption algorithms are secure and reliable, with the potential to be adapted for secure image communication applications. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=image%20encryption%20algorithms" title="image encryption algorithms">image encryption algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=Eureqa" title=" Eureqa"> Eureqa</a>, <a href="https://publications.waset.org/abstracts/search?q=statistical%20measurements" title=" statistical measurements"> statistical measurements</a>, <a href="https://publications.waset.org/abstracts/search?q=automated%20key%20generation" title=" automated key generation"> automated key generation</a> </p> <a href="https://publications.waset.org/abstracts/79042/image-encryption-using-eureqa-to-generate-an-automated-mathematical-key" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/79042.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">482</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">176</span> Red Green Blue Image Encryption Based on Paillier Cryptographic System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mamadou%20I.%20Wade">Mamadou I. Wade</a>, <a href="https://publications.waset.org/abstracts/search?q=Henry%20C.%20Ogworonjo"> Henry C. Ogworonjo</a>, <a href="https://publications.waset.org/abstracts/search?q=Madiha%20Gul"> Madiha Gul</a>, <a href="https://publications.waset.org/abstracts/search?q=Mandoye%20Ndoye"> Mandoye Ndoye</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Chouikha"> Mohamed Chouikha</a>, <a href="https://publications.waset.org/abstracts/search?q=Wayne%20Patterson"> Wayne Patterson</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we present a novel application of the Paillier cryptographic system to the encryption of RGB (Red Green Blue) images. In this method, an RGB image is first separated into its constituent channel images, and the Paillier encryption function is applied to each of the channels pixel intensity values. Next, the encrypted image is combined and compressed if necessary before being transmitted through an unsecured communication channel. The transmitted image is subsequently recovered by a decryption process. We performed a series of security and performance analyses to the recovered images in order to verify their robustness to security attack. The results show that the proposed image encryption scheme produces highly secured encrypted images. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=image%20encryption" title="image encryption">image encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=Paillier%20cryptographic%20system" title=" Paillier cryptographic system"> Paillier cryptographic system</a>, <a href="https://publications.waset.org/abstracts/search?q=RBG%20image%20encryption" title=" RBG image encryption"> RBG image encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=Paillier" title=" Paillier"> Paillier</a> </p> <a href="https://publications.waset.org/abstracts/79232/red-green-blue-image-encryption-based-on-paillier-cryptographic-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/79232.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">238</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">175</span> Quantum Dots with Microwave Propagation in Future Quantum Internet Protocol for Mobile Telephony</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20B.%20R.%20Hazarika">A. B. R. Hazarika</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the present paper, Quantum dots of ZnS are used to study the faster microwave propagation in space and on earth which will be difficult to bypass as quantum key encryption-decryption is difficult to decode. The present study deals with Quantum internet protocol which is much faster, safer and secure in microwave propagation than the present Internet Protocol v6, which forms the aspect of our study. Assimilation of hardware, Quantum dots with Quantum protocol theory beautifies the aspect of the study. So far to author’s best knowledge, the study on mobile telephony with Quantum dots long-term evolution (QDLTE) has not been studied earlier, which forms the aspect of the study found that the Bitrate comes out to be 102.4 Gbps. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=encryption" title="encryption">encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=decryption" title=" decryption"> decryption</a>, <a href="https://publications.waset.org/abstracts/search?q=internet%20protocol" title=" internet protocol"> internet protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=microwave" title=" microwave"> microwave</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20telephony" title=" mobile telephony"> mobile telephony</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20key%20encryption" title=" quantum key encryption"> quantum key encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20dots" title=" quantum dots"> quantum dots</a> </p> <a href="https://publications.waset.org/abstracts/89901/quantum-dots-with-microwave-propagation-in-future-quantum-internet-protocol-for-mobile-telephony" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/89901.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">173</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">174</span> Secure Transfer of Medical Images Using Hybrid Encryption</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Boukhatem%20Mohamed%20Belkaid">Boukhatem Mohamed Belkaid</a>, <a href="https://publications.waset.org/abstracts/search?q=Lahdi%20Mourad"> Lahdi Mourad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose a new encryption system for security issues medical images. The hybrid encryption scheme is based on AES and RSA algorithms to validate the three security services are authentication, integrity, and confidentiality. Privacy is ensured by AES, authenticity is ensured by the RSA algorithm. Integrity is assured by the basic function of the correlation between adjacent pixels. Our system generates a unique password every new session of encryption, that will be used to encrypt each frame of the medical image basis to strengthen and ensure his safety. Several metrics have been used for various tests of our analysis. For the integrity test, we noticed the efficiencies of our system and how the imprint cryptographic changes at reception if a change affects the image in the transmission channel. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=AES" title="AES">AES</a>, <a href="https://publications.waset.org/abstracts/search?q=RSA" title=" RSA"> RSA</a>, <a href="https://publications.waset.org/abstracts/search?q=integrity" title=" integrity"> integrity</a>, <a href="https://publications.waset.org/abstracts/search?q=confidentiality" title=" confidentiality"> confidentiality</a>, <a href="https://publications.waset.org/abstracts/search?q=authentication" title=" authentication"> authentication</a>, <a href="https://publications.waset.org/abstracts/search?q=medical%20images" title=" medical images"> medical images</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=decryption" title=" decryption"> decryption</a>, <a href="https://publications.waset.org/abstracts/search?q=key" title=" key"> key</a>, <a href="https://publications.waset.org/abstracts/search?q=correlation" title=" correlation"> correlation</a> </p> <a href="https://publications.waset.org/abstracts/16664/secure-transfer-of-medical-images-using-hybrid-encryption" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16664.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">443</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">173</span> Secure Transfer of Medical Images Using Hybrid Encryption Authentication, Confidentiality, Integrity</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Boukhatem%20Mohammed%20Belkaid">Boukhatem Mohammed Belkaid</a>, <a href="https://publications.waset.org/abstracts/search?q=Lahdir%20Mourad"> Lahdir Mourad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose a new encryption system for security issues medical images. The hybrid encryption scheme is based on AES and RSA algorithms to validate the three security services are authentication, integrity, and confidentiality. Privacy is ensured by AES, authenticity is ensured by the RSA algorithm. Integrity is assured by the basic function of the correlation between adjacent pixels. Our system generates a unique password every new session of encryption, that will be used to encrypt each frame of the medical image basis to strengthen and ensure his safety. Several metrics have been used for various tests of our analysis. For the integrity test, we noticed the efficiencies of our system and how the imprint cryptographic changes at reception if a change affects the image in the transmission channel. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=AES" title="AES">AES</a>, <a href="https://publications.waset.org/abstracts/search?q=RSA" title=" RSA"> RSA</a>, <a href="https://publications.waset.org/abstracts/search?q=integrity" title=" integrity"> integrity</a>, <a href="https://publications.waset.org/abstracts/search?q=confidentiality" title=" confidentiality"> confidentiality</a>, <a href="https://publications.waset.org/abstracts/search?q=authentication" title=" authentication"> authentication</a>, <a href="https://publications.waset.org/abstracts/search?q=medical%20images" title=" medical images"> medical images</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=decryption" title=" decryption"> decryption</a>, <a href="https://publications.waset.org/abstracts/search?q=key" title=" key"> key</a>, <a href="https://publications.waset.org/abstracts/search?q=correlation" title=" correlation"> correlation</a> </p> <a href="https://publications.waset.org/abstracts/17879/secure-transfer-of-medical-images-using-hybrid-encryption-authentication-confidentiality-integrity" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17879.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">540</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">172</span> Secret Sharing in Visual Cryptography Using NVSS and Data Hiding Techniques</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Misha%20Alexander">Misha Alexander</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20B.%20Waykar"> S. B. Waykar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Visual Cryptography is a special unbreakable encryption technique that transforms the secret image into random noisy pixels. These shares are transmitted over the network and because of its noisy texture it attracts the hackers. To address this issue a Natural Visual Secret Sharing Scheme (NVSS) was introduced that uses natural shares either in digital or printed form to generate the noisy secret share. This scheme greatly reduces the transmission risk but causes distortion in the retrieved secret image through variation in settings and properties of digital devices used to capture the natural image during encryption / decryption phase. This paper proposes a new NVSS scheme that extracts the secret key from randomly selected unaltered multiple natural images. To further improve the security of the shares data hiding techniques such as Steganography and Alpha channel watermarking are proposed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=decryption" title="decryption">decryption</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=natural%20visual%20secret%20sharing" title=" natural visual secret sharing"> natural visual secret sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=natural%20images" title=" natural images"> natural images</a>, <a href="https://publications.waset.org/abstracts/search?q=noisy%20share" title=" noisy share"> noisy share</a>, <a href="https://publications.waset.org/abstracts/search?q=pixel%20swapping" title=" pixel swapping"> pixel swapping</a> </p> <a href="https://publications.waset.org/abstracts/33268/secret-sharing-in-visual-cryptography-using-nvss-and-data-hiding-techniques" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33268.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">404</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">171</span> An Efficient Discrete Chaos in Generalized Logistic Maps with Applications in Image Encryption </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ashish%20Ashish">Ashish Ashish</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the last few decades, the discrete chaos of difference equations has gained a massive attention of academicians and scholars due to its tremendous applications in each and every branch of science, such as cryptography, traffic control models, secure communications, weather forecasting, and engineering. In this article, a generalized logistic discrete map is established and discrete chaos is reported through period doubling bifurcation, period three orbit and Lyapunov exponent. It is interesting to see that the generalized logistic map exhibits superior chaos due to the presence of an extra degree of freedom of an ordered parameter. The period doubling bifurcation and Lyapunov exponent are demonstrated for some particular values of parameter and the discrete chaos is determined in the sense of Devaney's definition of chaos theoretically as well as numerically. Moreover, the study discusses an extended chaos based image encryption and decryption scheme in cryptography using this novel system. Surprisingly, a larger key space for coding and more sensitive dependence on initial conditions are examined for encryption and decryption of text messages, images and videos which secure the system strongly from external cyber attacks, coding attacks, statistic attacks and differential attacks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=chaos" title="chaos">chaos</a>, <a href="https://publications.waset.org/abstracts/search?q=period-doubling" title=" period-doubling"> period-doubling</a>, <a href="https://publications.waset.org/abstracts/search?q=logistic%20map" title=" logistic map"> logistic map</a>, <a href="https://publications.waset.org/abstracts/search?q=Lyapunov%20exponent" title=" Lyapunov exponent"> Lyapunov exponent</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20encryption" title=" image encryption"> image encryption</a> </p> <a href="https://publications.waset.org/abstracts/112408/an-efficient-discrete-chaos-in-generalized-logistic-maps-with-applications-in-image-encryption" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/112408.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">151</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">170</span> MSG Image Encryption Based on AES and RSA Algorithms "MSG Image Security"</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Boukhatem%20Mohammed%20Belkaid">Boukhatem Mohammed Belkaid</a>, <a href="https://publications.waset.org/abstracts/search?q=Lahdir%20Mourad"> Lahdir Mourad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose a new encryption system for security issues meteorological images from Meteosat Second Generation (MSG), which generates 12 images every 15 minutes. The hybrid encryption scheme is based on AES and RSA algorithms to validate the three security services are authentication, integrity and confidentiality. Privacy is ensured by AES, authenticity is ensured by the RSA algorithm. Integrity is assured by the basic function of the correlation between adjacent pixels. Our system generates a unique password every 15 minutes that will be used to encrypt each frame of the MSG meteorological basis to strengthen and ensure his safety. Several metrics have been used for various tests of our analysis. For the integrity test, we noticed the efficiencies of our system and how the imprint cryptographic changes at reception if a change affects the image in the transmission channel. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=AES" title="AES">AES</a>, <a href="https://publications.waset.org/abstracts/search?q=RSA" title=" RSA"> RSA</a>, <a href="https://publications.waset.org/abstracts/search?q=integrity" title=" integrity"> integrity</a>, <a href="https://publications.waset.org/abstracts/search?q=confidentiality" title=" confidentiality"> confidentiality</a>, <a href="https://publications.waset.org/abstracts/search?q=authentication" title=" authentication"> authentication</a>, <a href="https://publications.waset.org/abstracts/search?q=satellite%20MSG" title=" satellite MSG"> satellite MSG</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=decryption" title=" decryption"> decryption</a>, <a href="https://publications.waset.org/abstracts/search?q=key" title=" key"> key</a>, <a href="https://publications.waset.org/abstracts/search?q=correlation" title=" correlation"> correlation</a> </p> <a href="https://publications.waset.org/abstracts/16590/msg-image-encryption-based-on-aes-and-rsa-algorithms-msg-image-security" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16590.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">382</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">169</span> Fingerprint Image Encryption Using a 2D Chaotic Map and Elliptic Curve Cryptography</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=D.%20M.%20S.%20Bandara">D. M. S. Bandara</a>, <a href="https://publications.waset.org/abstracts/search?q=Yunqi%20Lei"> Yunqi Lei</a>, <a href="https://publications.waset.org/abstracts/search?q=Ye%20Luo"> Ye Luo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Fingerprints are suitable as long-term markers of human identity since they provide detailed and unique individual features which are difficult to alter and durable over life time. In this paper, we propose an algorithm to encrypt and decrypt fingerprint images by using a specially designed Elliptic Curve Cryptography (ECC) procedure based on block ciphers. In addition, to increase the confusing effect of fingerprint encryption, we also utilize a chaotic-behaved method called Arnold Cat Map (ACM) for a 2D scrambling of pixel locations in our method. Experimental results are carried out with various types of efficiency and security analyses. As a result, we demonstrate that the proposed fingerprint encryption/decryption algorithm is advantageous in several different aspects including efficiency, security and flexibility. In particular, using this algorithm, we achieve a margin of about 0.1% in the test of Number of Pixel Changing Rate (NPCR) values comparing to the-state-of-the-art performances. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=arnold%20cat%20map" title="arnold cat map">arnold cat map</a>, <a href="https://publications.waset.org/abstracts/search?q=biometric%20encryption" title=" biometric encryption"> biometric encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=block%20cipher" title=" block cipher"> block cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=elliptic%20curve%20cryptography" title=" elliptic curve cryptography"> elliptic curve cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=fingerprint%20encryption" title=" fingerprint encryption"> fingerprint encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=Koblitz%E2%80%99s%20%20encoding" title=" Koblitz’s encoding"> Koblitz’s encoding</a> </p> <a href="https://publications.waset.org/abstracts/96251/fingerprint-image-encryption-using-a-2d-chaotic-map-and-elliptic-curve-cryptography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/96251.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">204</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">168</span> FPGA Implementation of RSA Encryption Algorithm for E-Passport Application</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Khaled%20Shehata">Khaled Shehata</a>, <a href="https://publications.waset.org/abstracts/search?q=Hanady%20Hussien"> Hanady Hussien</a>, <a href="https://publications.waset.org/abstracts/search?q=Sara%20Yehia"> Sara Yehia</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Securing the data stored on E-passport is a very important issue. RSA encryption algorithm is suitable for such application with low data size. In this paper the design and implementation of 1024 bit-key RSA encryption and decryption module on an FPGA is presented. The module is verified through comparing the result with that obtained from MATLAB tools. The design runs at a frequency of 36.3 MHz on Virtex-5 Xilinx FPGA. The key size is designed to be 1024-bit to achieve high security for the passport information. The whole design is achieved through VHDL design entry which makes it a portable design and can be directed to any hardware platform. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=RSA" title="RSA">RSA</a>, <a href="https://publications.waset.org/abstracts/search?q=VHDL" title=" VHDL"> VHDL</a>, <a href="https://publications.waset.org/abstracts/search?q=FPGA" title=" FPGA"> FPGA</a>, <a href="https://publications.waset.org/abstracts/search?q=modular%20multiplication" title=" modular multiplication"> modular multiplication</a>, <a href="https://publications.waset.org/abstracts/search?q=modular%20exponential" title=" modular exponential"> modular exponential</a> </p> <a href="https://publications.waset.org/abstracts/4249/fpga-implementation-of-rsa-encryption-algorithm-for-e-passport-application" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/4249.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">389</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">167</span> Modification Encryption Time and Permutation in Advanced Encryption Standard Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dalal%20N.%20Hammod">Dalal N. Hammod</a>, <a href="https://publications.waset.org/abstracts/search?q=Ekhlas%20K.%20Gbashi"> Ekhlas K. Gbashi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Today, cryptography is used in many applications to achieve high security in data transmission and in real-time communications. AES has long gained global acceptance and is used for securing sensitive data in various industries but has suffered from slow processing and take a large time to transfer data. This paper suggests a method to enhance Advance Encryption Standard (AES) Algorithm based on time and permutation. The suggested method (MAES) is based on modifying the SubByte and ShiftRrows in the encryption part and modification the InvSubByte and InvShiftRows in the decryption part. After the implementation of the proposal and testing the results, the Modified AES achieved good results in accomplishing the communication with high performance criteria in terms of randomness, encryption time, storage space, and avalanche effects. The proposed method has good randomness to ciphertext because this method passed NIST statistical tests against attacks; also, (MAES) reduced the encryption time by (10 %) than the time of the original AES; therefore, the modified AES is faster than the original AES. Also, the proposed method showed good results in memory utilization where the value is (54.36) for the MAES, but the value for the original AES is (66.23). Also, the avalanche effects used for calculating diffusion property are (52.08%) for the modified AES and (51.82%) percentage for the original AES. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=modified%20AES" title="modified AES">modified AES</a>, <a href="https://publications.waset.org/abstracts/search?q=randomness%20test" title=" randomness test"> randomness test</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption%20time" title=" encryption time"> encryption time</a>, <a href="https://publications.waset.org/abstracts/search?q=avalanche%20effects" title=" avalanche effects"> avalanche effects</a> </p> <a href="https://publications.waset.org/abstracts/139308/modification-encryption-time-and-permutation-in-advanced-encryption-standard-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/139308.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">247</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">166</span> Security Analysis and Implementation of Achterbahn-128 for Images Encryption</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aissa%20Belmeguenai">Aissa Belmeguenai</a>, <a href="https://publications.waset.org/abstracts/search?q=Oulaya%20Berrak"> Oulaya Berrak</a>, <a href="https://publications.waset.org/abstracts/search?q=Khaled%20Mansouri"> Khaled Mansouri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this work, efficiency implementation and security evaluation of the keystream generator of Achterbahn-128 for images encryption and decryption was introduced. The implementation for this simulated project is written with MATLAB.7.5. First of all, two different original images are used to validate the proposed design. The developed program is used to transform the original images data into digital image file. Finally, the proposed program is implemented to encrypt and decrypt images data. Several tests are done to prove the design performance, including visual tests and security evaluation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Achterbahn-128" title="Achterbahn-128">Achterbahn-128</a>, <a href="https://publications.waset.org/abstracts/search?q=keystream%20generator" title=" keystream generator"> keystream generator</a>, <a href="https://publications.waset.org/abstracts/search?q=stream%20cipher" title=" stream cipher"> stream cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20encryption" title=" image encryption"> image encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=security%20analysis" title=" security analysis"> security analysis</a> </p> <a href="https://publications.waset.org/abstracts/38107/security-analysis-and-implementation-of-achterbahn-128-for-images-encryption" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/38107.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">314</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">165</span> Overcoming 4-to-1 Decryption Failure of the Rabin Cryptosystem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20Rezal%20Kamel%20Ariffin">Muhammad Rezal Kamel Ariffin</a>, <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20Asyraf%20Asbullah"> Muhammad Asyraf Asbullah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The square root modulo problem is a known primitive in designing an asymmetric cryptosystem. It was first attempted by Rabin. Decryption failure of the Rabin cryptosystem caused by the 4-to-1 decryption output is overcome efficiently in this work. The proposed scheme to overcome the decryption failure issue (known as the AAβ-cryptosystem) is constructed using a simple mathematical structure, it has low computational requirements and would enable communication devices with low computing power to deploy secure communication procedures efficiently. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rabin%20cryptosystem" title="Rabin cryptosystem">Rabin cryptosystem</a>, <a href="https://publications.waset.org/abstracts/search?q=4-to-1%20decryption%20failure" title=" 4-to-1 decryption failure"> 4-to-1 decryption failure</a>, <a href="https://publications.waset.org/abstracts/search?q=square%20root%20modulo%20problem" title=" square root modulo problem"> square root modulo problem</a>, <a href="https://publications.waset.org/abstracts/search?q=integer%20factorization%20problem" title=" integer factorization problem"> integer factorization problem</a> </p> <a href="https://publications.waset.org/abstracts/21804/overcoming-4-to-1-decryption-failure-of-the-rabin-cryptosystem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21804.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">475</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">164</span> Maintaining User-Level Security in Short Message Service</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=T.%20Arudchelvam">T. Arudchelvam</a>, <a href="https://publications.waset.org/abstracts/search?q=W.%20W.%20E.%20N.%20Fernando"> W. W. E. N. Fernando</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Mobile phone has become as an essential thing in our life. Therefore, security is the most important thing to be considered in mobile communication. Short message service is the cheapest way of communication via the mobile phones. Therefore, security is very important in the short message service as well. This paper presents a method to maintain the security at user level. Different types of encryption methods are used to implement the user level security in mobile phones. Caesar cipher, Rail Fence, Vigenere cipher and RSA are used as encryption methods in this work. Caesar cipher and the Rail Fence methods are enhanced and implemented. The beauty in this work is that the user can select the encryption method and the key. Therefore, by changing the encryption method and the key time to time, the user can ensure the security of messages. By this work, while users can safely send/receive messages, they can save their information from unauthorised and unwanted people in their own mobile phone as well. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=SMS" title="SMS">SMS</a>, <a href="https://publications.waset.org/abstracts/search?q=user%20level%20security" title=" user level security"> user level security</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=decryption" title=" decryption"> decryption</a>, <a href="https://publications.waset.org/abstracts/search?q=short%20message%20service" title=" short message service"> short message service</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20communication" title=" mobile communication"> mobile communication</a> </p> <a href="https://publications.waset.org/abstracts/49955/maintaining-user-level-security-in-short-message-service" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/49955.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">396</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">163</span> Anti-Forensic Countermeasure: An Examination and Analysis Extended Procedure for Information Hiding of Android SMS Encryption Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ariq%20Bani%20Hardi">Ariq Bani Hardi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Empowerment of smartphone technology is growing very rapidly in various fields of science. One of the mobile operating systems that dominate the smartphone market today is Android by Google. Unfortunately, the expansion of mobile technology is misused by criminals to hide the information that they store or exchange with each other. It makes law enforcement more difficult to prove crimes committed in the judicial process (anti-forensic). One of technique that used to hide the information is encryption, such as the usages of SMS encryption applications. A Mobile Forensic Examiner or an investigator should prepare a countermeasure technique if he finds such things during the investigation process. This paper will discuss an extension procedure if the investigator found unreadable SMS in android evidence because of encryption. To define the extended procedure, we create and analyzing a dataset of android SMS encryption application. The dataset was grouped by application characteristics related to communication permissions, as well as the availability of source code and the documentation of encryption scheme. Permissions indicate the possibility of how applications exchange the data and keys. Availability of the source code and the encryption scheme documentation can show what the cryptographic algorithm specification is used, how long the key length, how the process of key generation, key exchanges, encryption/decryption is done, and other related information. The output of this paper is an extended or alternative procedure for examination and analysis process of android digital forensic. It can be used to help the investigators while they got a confused cause of SMS encryption during examining and analyzing. What steps should the investigator take, so they still have a chance to discover the encrypted SMS in android evidence? <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=anti-forensic%20countermeasure" title="anti-forensic countermeasure">anti-forensic countermeasure</a>, <a href="https://publications.waset.org/abstracts/search?q=SMS%20encryption%20android" title=" SMS encryption android"> SMS encryption android</a>, <a href="https://publications.waset.org/abstracts/search?q=examination%20and%20analysis" title=" examination and analysis"> examination and analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=digital%20forensic" title=" digital forensic"> digital forensic</a> </p> <a href="https://publications.waset.org/abstracts/95008/anti-forensic-countermeasure-an-examination-and-analysis-extended-procedure-for-information-hiding-of-android-sms-encryption-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/95008.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">127</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">162</span> Development of Enhanced Data Encryption Standard</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Benjamin%20Okike">Benjamin Okike</a> </p> <p class="card-text"><strong>Abstract:</strong></p> There is a need to hide information along the superhighway. Today, information relating to the survival of individuals, organizations, or government agencies is transmitted from one point to another. Adversaries are always on the watch along the superhighway to intercept any information that would enable them to inflict psychological ‘injuries’ to their victims. But with information encryption, this can be prevented completely or at worst reduced to the barest minimum. There is no doubt that so many encryption techniques have been proposed, and some of them are already being implemented. However, adversaries always discover loopholes on them to perpetuate their evil plans. In this work, we propose the enhanced data encryption standard (EDES) that would deploy randomly generated numbers as an encryption method. Each time encryption is to be carried out, a new set of random numbers would be generated, thereby making it almost impossible for cryptanalysts to decrypt any information encrypted with this newly proposed method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=encryption" title="encryption">encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=enhanced%20data%20encryption" title=" enhanced data encryption"> enhanced data encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption%20techniques" title=" encryption techniques"> encryption techniques</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20security" title=" information security"> information security</a> </p> <a href="https://publications.waset.org/abstracts/131071/development-of-enhanced-data-encryption-standard" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/131071.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">150</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">161</span> Robust Image Design Based Steganographic System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sadiq%20J.%20Abou-Loukh">Sadiq J. Abou-Loukh</a>, <a href="https://publications.waset.org/abstracts/search?q=Hanan%20M.%20Habbi"> Hanan M. Habbi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a steganography to hide the transmitted information without excite suspicious and also illustrates the level of secrecy that can be increased by using cryptography techniques. The proposed system has been implemented firstly by encrypted image file one time pad key and secondly encrypted message that hidden to perform encryption followed by image embedding. Then the new image file will be created from the original image by using four triangles operation, the new image is processed by one of two image processing techniques. The proposed two processing techniques are thresholding and differential predictive coding (DPC). Afterwards, encryption or decryption keys are generated by functional key generator. The generator key is used one time only. Encrypted text will be hidden in the places that are not used for image processing and key generation system has high embedding rate (0.1875 character/pixel) for true color image (24 bit depth). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=encryption" title="encryption">encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=thresholding" title=" thresholding"> thresholding</a>, <a href="https://publications.waset.org/abstracts/search?q=differential%0D%0Apredictive%20coding" title=" differential predictive coding"> differential predictive coding</a>, <a href="https://publications.waset.org/abstracts/search?q=four%20triangles%20operation" title=" four triangles operation "> four triangles operation </a> </p> <a href="https://publications.waset.org/abstracts/16654/robust-image-design-based-steganographic-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16654.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">493</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">160</span> Deployment of Matrix Transpose in Digital Image Encryption</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Okike%20Benjamin">Okike Benjamin</a>, <a href="https://publications.waset.org/abstracts/search?q=Garba%20E%20J.%20D."> Garba E J. D.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Encryption is used to conceal information from prying eyes. Presently, information and data encryption are common due to the volume of data and information in transit across the globe on daily basis. Image encryption is yet to receive the attention of the researchers as deserved. In other words, video and multimedia documents are exposed to unauthorized accessors. The authors propose image encryption using matrix transpose. An algorithm that would allow image encryption is developed. In this proposed image encryption technique, the image to be encrypted is split into parts based on the image size. Each part is encrypted separately using matrix transpose. The actual encryption is on the picture elements (pixel) that make up the image. After encrypting each part of the image, the positions of the encrypted images are swapped before transmission of the image can take place. Swapping the positions of the images is carried out to make the encrypted image more robust for any cryptanalyst to decrypt. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=image%20encryption" title="image encryption">image encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=matrices" title=" matrices"> matrices</a>, <a href="https://publications.waset.org/abstracts/search?q=pixel" title=" pixel"> pixel</a>, <a href="https://publications.waset.org/abstracts/search?q=matrix%20transpose" title=" matrix transpose "> matrix transpose </a> </p> <a href="https://publications.waset.org/abstracts/48717/deployment-of-matrix-transpose-in-digital-image-encryption" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/48717.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">421</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">159</span> Reversible Information Hitting in Encrypted JPEG Bitstream by LSB Based on Inherent Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vaibhav%20Barve">Vaibhav Barve</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Reversible information hiding has drawn a lot of interest as of late. Being reversible, we can restore unique computerized data totally. It is a plan where mystery data is put away in digital media like image, video, audio to maintain a strategic distance from unapproved access and security reason. By and large JPEG bit stream is utilized to store this key data, first JPEG bit stream is encrypted into all around sorted out structure and then this secret information or key data is implanted into this encrypted region by marginally changing the JPEG bit stream. Valuable pixels suitable for information implanting are computed and as indicated by this key subtle elements are implanted. In our proposed framework we are utilizing RC4 algorithm for encrypting JPEG bit stream. Encryption key is acknowledged by framework user which, likewise, will be used at the time of decryption. We are executing enhanced least significant bit supplanting steganography by utilizing genetic algorithm. At first, the quantity of bits that must be installed in a guaranteed coefficient is versatile. By utilizing proper parameters, we can get high capacity while ensuring high security. We are utilizing logistic map for shuffling of bits and utilization GA (Genetic Algorithm) to find right parameters for the logistic map. Information embedding key is utilized at the time of information embedding. By utilizing precise picture encryption and information embedding key, the beneficiary can, without much of a stretch, concentrate the incorporated secure data and totally recoup the first picture and also the original secret information. At the point when the embedding key is truant, the first picture can be recouped pretty nearly with sufficient quality without getting the embedding key of interest. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=data%20embedding" title="data embedding">data embedding</a>, <a href="https://publications.waset.org/abstracts/search?q=decryption" title=" decryption"> decryption</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=reversible%20data%20hiding" title=" reversible data hiding"> reversible data hiding</a>, <a href="https://publications.waset.org/abstracts/search?q=steganography" title=" steganography"> steganography</a> </p> <a href="https://publications.waset.org/abstracts/32863/reversible-information-hitting-in-encrypted-jpeg-bitstream-by-lsb-based-on-inherent-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32863.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">288</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">158</span> Encryption Image via Mutual Singular Value Decomposition</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Adil%20Al-Rammahi">Adil Al-Rammahi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Image or document encryption is needed through e- government data base. Really in this paper we introduce two matrices images, one is the public, and the second is the secret (original). The analyses of each matrix is achieved using the transformation of singular values decomposition. So each matrix is transformed or analyzed to three matrices say row orthogonal basis, column orthogonal basis, and spectral diagonal basis. Product of the two row basis is calculated. Similarly the product of the two column basis is achieved. Finally we transform or save the files of public, row product and column product. In decryption stage, the original image is deduced by mutual method of the three public files. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=image%20cryptography" title="image cryptography">image cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=singular%20values%20decomposition" title=" singular values decomposition"> singular values decomposition</a> </p> <a href="https://publications.waset.org/abstracts/13714/encryption-image-via-mutual-singular-value-decomposition" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13714.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">436</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">157</span> On Dynamic Chaotic S-BOX Based Advanced Encryption Standard Algorithm for Image Encryption</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ajish%20Sreedharan">Ajish Sreedharan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Security in transmission and storage of digital images has its importance in today’s image communications and confidential video conferencing. Due to the increasing use of images in industrial process, it is essential to protect the confidential image data from unauthorized access. Advanced Encryption Standard (AES) is a well known block cipher that has several advantages in data encryption. However, it is not suitable for real-time applications. This paper presents modifications to the Advanced Encryption Standard to reflect a high level security and better image encryption. The modifications are done by adjusting the ShiftRow Transformation and using On Dynamic chaotic S-BOX. In AES the Substitute bytes, Shift row and Mix columns by themselves would provide no security because they do not use the key. In Dynamic chaotic S-BOX Based AES the Substitute bytes provide security because the S-Box is constructed from the key. Experimental results verify and prove that the proposed modification to image cryptosystem is highly secure from the cryptographic viewpoint. The results also prove that with a comparison to original AES encryption algorithm the modified algorithm gives better encryption results in terms of security against statistical attacks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=advanced%20encryption%20standard%20%28AES%29" title="advanced encryption standard (AES)">advanced encryption standard (AES)</a>, <a href="https://publications.waset.org/abstracts/search?q=on%20dynamic%20chaotic%20S-BOX" title=" on dynamic chaotic S-BOX"> on dynamic chaotic S-BOX</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20encryption" title=" image encryption"> image encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=security%20analysis" title=" security analysis"> security analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=ShiftRow%20transformation" title=" ShiftRow transformation"> ShiftRow transformation</a> </p> <a href="https://publications.waset.org/abstracts/16549/on-dynamic-chaotic-s-box-based-advanced-encryption-standard-algorithm-for-image-encryption" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16549.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">437</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">156</span> An Attack on the Lucas Based El-Gamal Cryptosystem in the Elliptic Curve Group Over Finite Field Using Greater Common Divisor</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lee%20Feng%20Koo">Lee Feng Koo</a>, <a href="https://publications.waset.org/abstracts/search?q=Tze%20Jin%20Wong"> Tze Jin Wong</a>, <a href="https://publications.waset.org/abstracts/search?q=Pang%20Hung%20Yiu"> Pang Hung Yiu</a>, <a href="https://publications.waset.org/abstracts/search?q=Nik%20Mohd%20Asri%20Nik%20Long"> Nik Mohd Asri Nik Long</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Greater common divisor (GCD) attack is an attack that relies on the polynomial structure of the cryptosystem. This attack required two plaintexts differ from a fixed number and encrypted under same modulus. This paper reports a security reaction of Lucas Based El-Gamal Cryptosystem in the Elliptic Curve group over finite field under GCD attack. Lucas Based El-Gamal Cryptosystem in the Elliptic Curve group over finite field was exposed mathematically to the GCD attack using GCD and Dickson polynomial. The result shows that the cryptanalyst is able to get the plaintext without decryption by using GCD attack. Thus, the study concluded that it is highly perilous when two plaintexts have a slight difference from a fixed number in the same Elliptic curve group over finite field. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=decryption" title="decryption">decryption</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=elliptic%20curve" title=" elliptic curve"> elliptic curve</a>, <a href="https://publications.waset.org/abstracts/search?q=greater%20common%20divisor" title=" greater common divisor"> greater common divisor</a> </p> <a href="https://publications.waset.org/abstracts/97382/an-attack-on-the-lucas-based-el-gamal-cryptosystem-in-the-elliptic-curve-group-over-finite-field-using-greater-common-divisor" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/97382.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">256</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">155</span> Improving Cheon-Kim-Kim-Song (CKKS) Performance with Vector Computation and GPU Acceleration</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Smaran%20Manchala">Smaran Manchala</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Homomorphic Encryption (HE) enables computations on encrypted data without requiring decryption, mitigating data vulnerability during processing. Usable Fully Homomorphic Encryption (FHE) could revolutionize secure data operations across cloud computing, AI training, and healthcare, providing both privacy and functionality, however, the computational inefficiency of schemes like Cheon-Kim-Kim-Song (CKKS) hinders their widespread practical use. This study focuses on optimizing CKKS for faster matrix operations through the implementation of vector computation parallelization and GPU acceleration. The variable effects of vector parallelization on GPUs were explored, recognizing that while parallelization typically accelerates operations, it could introduce overhead that results in slower runtimes, especially in smaller, less computationally demanding operations. To assess performance, two neural network models, MLPN and CNN—were tested on the MNIST dataset using both ARM and x86-64 architectures, with CNN chosen for its higher computational demands. Each test was repeated 1,000 times, and outliers were removed via Z-score analysis to measure the effect of vector parallelization on CKKS performance. Model accuracy was also evaluated under CKKS encryption to ensure optimizations did not compromise results. According to the results of the trail runs, applying vector parallelization had a 2.63X efficiency increase overall with a 1.83X performance increase for x86-64 over ARM architecture. Overall, these results suggest that the application of vector parallelization in tandem with GPU acceleration significantly improves the efficiency of CKKS even while accounting for vector parallelization overhead, providing impact in future zero trust operations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CKKS%20scheme" title="CKKS scheme">CKKS scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=runtime%20efficiency" title=" runtime efficiency"> runtime efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=fully%20homomorphic%20encryption%20%28FHE%29" title=" fully homomorphic encryption (FHE)"> fully homomorphic encryption (FHE)</a>, <a href="https://publications.waset.org/abstracts/search?q=GPU%20acceleration" title=" GPU acceleration"> GPU acceleration</a>, <a href="https://publications.waset.org/abstracts/search?q=vector%20parallelization" title=" vector parallelization"> vector parallelization</a> </p> <a href="https://publications.waset.org/abstracts/192456/improving-cheon-kim-kim-song-ckks-performance-with-vector-computation-and-gpu-acceleration" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/192456.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">23</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">154</span> Secure Image Encryption via Enhanced Fractional Order Chaotic Map</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ismail%20Haddad">Ismail Haddad</a>, <a href="https://publications.waset.org/abstracts/search?q=Djamel%20Herbadji"> Djamel Herbadji</a>, <a href="https://publications.waset.org/abstracts/search?q=Aissa%20Belmeguenai"> Aissa Belmeguenai</a>, <a href="https://publications.waset.org/abstracts/search?q=Selma%20Boumerdassi"> Selma Boumerdassi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> in this paper, we provide a novel approach for image encryption that employs the Fibonacci matrix and an enhanced fractional order chaotic map. The enhanced map overcomes the drawbacks of the classical map, especially the limited chaotic range and non-uniform distribution of chaotic sequences, resulting in a larger encryption key space. As a result, this strategy improves the encryption system's security. Our experimental results demonstrate that our proposed algorithm effectively encrypts grayscale images with exceptional efficiency. Furthermore, our technique is resistant to a wide range of potential attacks, including statistical and entropy attacks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=image%20encryption" title="image encryption">image encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=logistic%20map" title=" logistic map"> logistic map</a>, <a href="https://publications.waset.org/abstracts/search?q=fibonacci%20matrix" title=" fibonacci matrix"> fibonacci matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=grayscale%20images" title=" grayscale images"> grayscale images</a> </p> <a href="https://publications.waset.org/abstracts/167150/secure-image-encryption-via-enhanced-fractional-order-chaotic-map" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/167150.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">317</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=encryption%20and%20decryption&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=encryption%20and%20decryption&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=encryption%20and%20decryption&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=encryption%20and%20decryption&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=encryption%20and%20decryption&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=encryption%20and%20decryption&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=encryption%20and%20decryption&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>