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: cryptography process</title> <meta name="description" content="Search results for: cryptography process"> <meta name="keywords" content="cryptography process"> <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="cryptography process" 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="cryptography process"> <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> 15293</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: cryptography process</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">15293</span> Cryptosystems in Asymmetric Cryptography for Securing Data on Cloud at Various Critical Levels</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sartaj%20Singh">Sartaj Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=Amar%20Singh"> Amar Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=Ashok%20Sharma"> Ashok Sharma</a>, <a href="https://publications.waset.org/abstracts/search?q=Sandeep%20Kaur"> Sandeep Kaur</a> </p> <p class="card-text"><strong>Abstract:</strong></p> With upcoming threats in a digital world, we need to work continuously in the area of security in all aspects, from hardware to software as well as data modelling. The rise in social media activities and hunger for data by various entities leads to cybercrime and more attack on the privacy and security of persons. Cryptography has always been employed to avoid access to important data by using many processes. Symmetric key and asymmetric key cryptography have been used for keeping data secrets at rest as well in transmission mode. Various cryptosystems have evolved from time to time to make the data more secure. In this research article, we are studying various cryptosystems in asymmetric cryptography and their application with usefulness, and much emphasis is given to Elliptic curve cryptography involving algebraic mathematics. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cryptography" title="cryptography">cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric%20key%20cryptography" title=" symmetric key cryptography"> symmetric key cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=asymmetric%20key%20cryptography" title=" asymmetric key cryptography"> asymmetric key cryptography</a> </p> <a href="https://publications.waset.org/abstracts/152445/cryptosystems-in-asymmetric-cryptography-for-securing-data-on-cloud-at-various-critical-levels" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/152445.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">124</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">15292</span> Digital Watermarking Based on Visual Cryptography and Histogram</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=R.%20Rama%20Kishore">R. Rama Kishore</a>, <a href="https://publications.waset.org/abstracts/search?q=Sunesh"> Sunesh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays, robust and secure watermarking algorithm and its optimization have been need of the hour. A watermarking algorithm is presented to achieve the copy right protection of the owner based on visual cryptography, histogram shape property and entropy. In this, both host image and watermark are preprocessed. Host image is preprocessed by using Butterworth filter, and watermark is with visual cryptography. Applying visual cryptography on water mark generates two shares. One share is used for embedding the watermark, and the other one is used for solving any dispute with the aid of trusted authority. Usage of histogram shape makes the process more robust against geometric and signal processing attacks. The combination of visual cryptography, Butterworth filter, histogram, and entropy can make the algorithm more robust, imperceptible, and copy right protection of the owner. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=digital%20watermarking" title="digital watermarking">digital watermarking</a>, <a href="https://publications.waset.org/abstracts/search?q=visual%20cryptography" title=" visual cryptography"> visual cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=histogram" title=" histogram"> histogram</a>, <a href="https://publications.waset.org/abstracts/search?q=butter%20worth%20filter" title=" butter worth filter"> butter worth filter</a> </p> <a href="https://publications.waset.org/abstracts/48320/digital-watermarking-based-on-visual-cryptography-and-histogram" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/48320.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">358</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">15291</span> Cryptography and Cryptosystem a Panacea to Security Risk in Wireless Networking</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Modesta%20E.%20Ezema">Modesta E. Ezema</a>, <a href="https://publications.waset.org/abstracts/search?q=Chikwendu%20V.%20Alabekee"> Chikwendu V. Alabekee</a>, <a href="https://publications.waset.org/abstracts/search?q=Victoria%20N.%20Ishiwu"> Victoria N. Ishiwu</a>, <a href="https://publications.waset.org/abstracts/search?q=Ifeyinwa%20NwosuArize"> Ifeyinwa NwosuArize</a>, <a href="https://publications.waset.org/abstracts/search?q=Chinedu%20I.%20Nwoye"> Chinedu I. Nwoye</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The advent of wireless networking in computing technology cannot be overemphasized, it opened up easy accessibility to information resources, networking made easier and brought internet accessibility to our doorsteps, but despite all these, some mishap came in with it that is causing mayhem in today ‘s overall information security. The cyber criminals will always compromise the integrity of a message that is not encrypted or that is encrypted with a weak algorithm.In other to correct the mayhem, this study focuses on cryptosystem and cryptography. This ensures end to end crypt messaging. The study of various cryptographic algorithms, as well as the techniques and applications of the cryptography for efficiency, were all considered in the work., present and future applications of cryptography were dealt with as well as Quantum Cryptography was exposed as the current and the future area in the development of cryptography. An empirical study was conducted to collect data from network users. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=algorithm" title="algorithm">algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography" title=" cryptography"> cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptosystem" title=" cryptosystem"> cryptosystem</a>, <a href="https://publications.waset.org/abstracts/search?q=network" title=" network"> network</a> </p> <a href="https://publications.waset.org/abstracts/55625/cryptography-and-cryptosystem-a-panacea-to-security-risk-in-wireless-networking" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/55625.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">349</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">15290</span> Quantum Cryptography: Classical Cryptography Algorithms’ Vulnerability State as Quantum Computing Advances</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tydra%20Preyear">Tydra Preyear</a>, <a href="https://publications.waset.org/abstracts/search?q=Victor%20Clincy"> Victor Clincy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Quantum computing presents many computational advantages over classical computing methods due to the utilization of quantum mechanics. The capability of this computing infrastructure poses threats to standard cryptographic systems such as RSA and AES, which are designed for classical computing environments. This paper discusses the impact that quantum computing has on cryptography, while focusing on the evolution from classical cryptographic concepts to quantum and post-quantum cryptographic concepts. Standard Cryptography is essential for securing data by utilizing encryption and decryption methods, and these methods face vulnerability problems due to the advancement of quantum computing. In order to counter these vulnerabilities, the methods that are proposed are quantum cryptography and post-quantum cryptography. Quantum cryptography uses principles such as the uncertainty principle and photon polarization in order to provide secure data transmission. In addition, the concept of Quantum key distribution is introduced to ensure more secure communication channels by distributing cryptographic keys. There is the emergence of post-quantum cryptography which is used for improving cryptographic algorithms in order to be more secure from attacks by classical and quantum computers. Throughout this exploration, the paper mentions the critical role of the advancement of cryptographic methods to keep data integrity and privacy safe from quantum computing concepts. Future research directions that would be discussed would be more effective cryptographic methods through the advancement of technology. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantum%20computing" title="quantum computing">quantum computing</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20cryptography" title=" quantum cryptography"> quantum cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography" title=" cryptography"> cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20integrity%20and%20privacy" title=" data integrity and privacy"> data integrity and privacy</a> </p> <a href="https://publications.waset.org/abstracts/189381/quantum-cryptography-classical-cryptography-algorithms-vulnerability-state-as-quantum-computing-advances" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/189381.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">26</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">15289</span> Cryptography Based Authentication Methods</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20A.%20Alia">Mohammad A. Alia</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdelfatah%20Aref%20Tamimi"> Abdelfatah Aref Tamimi</a>, <a href="https://publications.waset.org/abstracts/search?q=Omaima%20N.%20A.%20Al-Allaf"> Omaima N. A. Al-Allaf</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper reviews a comparison study on the most common used authentication methods. Some of these methods are actually based on cryptography. In this study, we show the main cryptographic services. Also, this study presents a specific discussion about authentication service, since the authentication service is classified into several categorizes according to their methods. However, this study gives more about the real life example for each of the authentication methods. It talks about the simplest authentication methods as well about the available biometric authentication methods such as voice, iris, fingerprint, and face authentication. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=information%20security" title="information security">information security</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography" title=" cryptography"> cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=system%20access%20control" title=" system access control"> system access control</a>, <a href="https://publications.waset.org/abstracts/search?q=authentication" title=" authentication"> authentication</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20security" title=" network security"> network security</a> </p> <a href="https://publications.waset.org/abstracts/12779/cryptography-based-authentication-methods" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/12779.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">471</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">15288</span> Secure E-Pay System Using Steganography and Visual Cryptography</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=K.%20Suganya%20Devi">K. Suganya Devi</a>, <a href="https://publications.waset.org/abstracts/search?q=P.%20Srinivasan"> P. Srinivasan</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20P.%20Vaishnave"> M. P. Vaishnave</a>, <a href="https://publications.waset.org/abstracts/search?q=G.%20Arutperumjothi"> G. Arutperumjothi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Today’s internet world is highly prone to various online attacks, of which the most harmful attack is phishing. The attackers host the fake websites which are very similar and look alike. We propose an image based authentication using steganography and visual cryptography to prevent phishing. This paper presents a secure steganographic technique for true color (RGB) images and uses Discrete Cosine Transform to compress the images. The proposed method hides the secret data inside the cover image. The use of visual cryptography is to preserve the privacy of an image by decomposing the original image into two shares. Original image can be identified only when both qualified shares are simultaneously available. Individual share does not reveal the identity of the original image. Thus, the existence of the secret message is hard to be detected by the RS steganalysis. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=image%20security" title="image security">image security</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20LSB" title=" random LSB"> random LSB</a>, <a href="https://publications.waset.org/abstracts/search?q=steganography" title=" steganography"> steganography</a>, <a href="https://publications.waset.org/abstracts/search?q=visual%20cryptography" title=" visual cryptography"> visual cryptography</a> </p> <a href="https://publications.waset.org/abstracts/67554/secure-e-pay-system-using-steganography-and-visual-cryptography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67554.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">330</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">15287</span> Digital Watermarking Using Fractional Transform and (k,n) Halftone Visual Cryptography (HVC)</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=R.%20Rama%20Kishore">R. Rama Kishore</a>, <a href="https://publications.waset.org/abstracts/search?q=Sunesh%20Malik"> Sunesh Malik</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Development in the usage of internet for different purposes in recent times creates great threat for the copy right protection of the digital images. Digital watermarking is the best way to rescue from the said problem. This paper presents detailed review of the different watermarking techniques, latest trends in the field and categorized like spatial and transform domain, blind and non-blind methods, visible and non visible techniques etc. It also discusses the different optimization techniques used in the field of watermarking in order to improve the robustness and imperceptibility of the method. Different measures are discussed to evaluate the performance of the watermarking algorithm. At the end, this paper proposes a watermarking algorithm using (k.n) shares of halftone visual cryptography (HVC) instead of (2, 2) share cryptography. (k,n) shares visual cryptography improves the security of the watermark. As halftone is a method of reprographic, it helps in improving the visual quality of watermark image. The proposed method uses fractional transformation to improve the robustness of the copyright protection of the method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=digital%20watermarking" title="digital watermarking">digital watermarking</a>, <a href="https://publications.waset.org/abstracts/search?q=fractional%20transform" title=" fractional transform"> fractional transform</a>, <a href="https://publications.waset.org/abstracts/search?q=halftone" title=" halftone"> halftone</a>, <a href="https://publications.waset.org/abstracts/search?q=visual%20cryptography" title=" visual cryptography"> visual cryptography</a> </p> <a href="https://publications.waset.org/abstracts/61578/digital-watermarking-using-fractional-transform-and-kn-halftone-visual-cryptography-hvc" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/61578.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">355</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">15286</span> Secure Optical Communication System Using Quantum Cryptography</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ehab%20AbdulRazzaq%20Hussein">Ehab AbdulRazzaq Hussein</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Quantum cryptography (QC) is an emerging technology for secure key distribution with single-photon transmissions. In contrast to classical cryptographic schemes, the security of QC schemes is guaranteed by the fundamental laws of nature. Their security stems from the impossibility to distinguish non-orthogonal quantum states with certainty. A potential eavesdropper introduces errors in the transmissions, which can later be discovered by the legitimate participants of the communication. In this paper, the modeling approach is proposed for QC protocol BB84 using polarization coding. The single-photon system is assumed to be used in the designed models. Thus, Eve cannot use beam-splitting strategy to eavesdrop on the quantum channel transmission. The only eavesdropping strategy possible to Eve is the intercept/resend strategy. After quantum transmission of the QC protocol, the quantum bit error rate (QBER) is estimated and compared with a threshold value. If it is above this value the procedure must be stopped and performed later again. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=security" title="security">security</a>, <a href="https://publications.waset.org/abstracts/search?q=key%20distribution" title=" key distribution"> key distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography" title=" cryptography"> cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20protocols" title=" quantum protocols"> quantum protocols</a>, <a href="https://publications.waset.org/abstracts/search?q=Quantum%20Cryptography%20%28QC%29" title=" Quantum Cryptography (QC)"> Quantum Cryptography (QC)</a>, <a href="https://publications.waset.org/abstracts/search?q=Quantum%20Key%20Distribution%20%28QKD%29." title=" Quantum Key Distribution (QKD)."> Quantum Key Distribution (QKD).</a> </p> <a href="https://publications.waset.org/abstracts/2413/secure-optical-communication-system-using-quantum-cryptography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2413.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">406</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">15285</span> Identity-Based Encryption: A Comparison of Leading Classical and Post-Quantum Implementations in an Enterprise Setting</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Emily%20Stamm">Emily Stamm</a>, <a href="https://publications.waset.org/abstracts/search?q=Neil%20Smyth"> Neil Smyth</a>, <a href="https://publications.waset.org/abstracts/search?q=Elizabeth%20O%27Sullivan"> Elizabeth O'Sullivan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In Identity-Based Encryption (IBE), an identity, such as a username, email address, or domain name, acts as the public key. IBE consolidates the PKI by eliminating the repetitive process of requesting public keys for each message encryption. Two of the most popular schemes are Sakai-Kasahara (SAKKE), which is based on elliptic curve pairings, and the Ducas, Lyubashevsky, and Prest lattice scheme (DLP- Lattice), which is based on quantum-secure lattice cryptography. In or- der to embed the schemes in a standard enterprise setting, both schemes are implemented as shared system libraries and integrated into a REST service that functions at the enterprise level. The performance of both schemes as libraries and services is compared, and the practicalities of implementation and application are discussed. Our performance results indicate that although SAKKE has the smaller key and ciphertext sizes, DLP-Lattice is significantly faster overall and we recommend it for most enterprise use cases. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=identity-based%20encryption" title="identity-based encryption">identity-based encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=post-quantum%20cryptography" title=" post-quantum cryptography"> post-quantum cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=lattice-based%20cryptography" title=" lattice-based cryptography"> lattice-based cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=IBE" title=" IBE"> IBE</a> </p> <a href="https://publications.waset.org/abstracts/146066/identity-based-encryption-a-comparison-of-leading-classical-and-post-quantum-implementations-in-an-enterprise-setting" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/146066.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">136</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">15284</span> Chaos Cryptography in Cloud Architectures with Lower Latency</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20A.%20Alia">Mohammad A. Alia</a> </p> <p class="card-text"><strong>Abstract:</strong></p> With the rapid evolution of the internet applications, cloud computing becomes one of today’s hottest research areas due to its ability to reduce costs associated with computing. Cloud is, therefore, increasing flexibility and scalability for computing services in the internet. Cloud computing is Internet based computing due to shared resources and information which are dynamically delivered to consumers. As cloud computing share resources via the open network, hence cloud outsourcing is vulnerable to attack. Therefore, this paper will explore data security of cloud computing by implementing chaotic cryptography. The proposal scenario develops a problem transformation technique that enables customers to secretly transform their information. This work proposes the chaotic cryptographic algorithms have been applied to enhance the security of the cloud computing accessibility. However, the proposed scenario is secure, easy and straightforward process. The chaotic encryption and digital signature systems ensure the security of the proposed scenario. Though, the choice of the key size becomes crucial to prevent a brute force attack. <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=cloud%20computing" title=" cloud computing"> cloud computing</a>, <a href="https://publications.waset.org/abstracts/search?q=security" title=" security"> security</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography" title=" cryptography"> cryptography</a> </p> <a href="https://publications.waset.org/abstracts/79408/chaos-cryptography-in-cloud-architectures-with-lower-latency" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/79408.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">345</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">15283</span> Improved of Elliptic Curves Cryptography over a Ring</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdelhakim%20Chillali">Abdelhakim Chillali</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdelhamid%20Tadmori"> Abdelhamid Tadmori</a>, <a href="https://publications.waset.org/abstracts/search?q=Muhammed%20Ziane"> Muhammed Ziane</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this article we will study the elliptic curve defined over the ring An and we define the mathematical operations of ECC, which provides a high security and advantage for wireless applications compared to other asymmetric key cryptosystem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=elliptic%20curves" title="elliptic curves">elliptic curves</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20ring" title=" finite ring"> finite ring</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography" title=" cryptography"> cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=study" title=" study"> study</a> </p> <a href="https://publications.waset.org/abstracts/24042/improved-of-elliptic-curves-cryptography-over-a-ring" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24042.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">372</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">15282</span> Tamper Resistance Evaluation Tests with Noise Resources</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Masaya%20Yoshikawa">Masaya Yoshikawa</a>, <a href="https://publications.waset.org/abstracts/search?q=Toshiya%20Asai"> Toshiya Asai</a>, <a href="https://publications.waset.org/abstracts/search?q=Ryoma%20Matsuhisa"> Ryoma Matsuhisa</a>, <a href="https://publications.waset.org/abstracts/search?q=Yusuke%20Nozaki"> Yusuke Nozaki</a>, <a href="https://publications.waset.org/abstracts/search?q=Kensaku%20Asahi"> Kensaku Asahi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently, side-channel attacks, which estimate secret keys using side-channel information such as power consumption and compromising emanations of cryptography circuits embedded in hardware, have become a serious problem. In particular, electromagnetic analysis attacks against cryptographic circuits between information processing and electromagnetic fields, which are related to secret keys in cryptography circuits, are the most threatening side-channel attacks. Therefore, it is important to evaluate tamper resistance against electromagnetic analysis attacks for cryptography circuits. The present study performs basic examination of the tamper resistance of cryptography circuits using electromagnetic analysis attacks with noise resources. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=tamper%20resistance" title="tamper resistance">tamper resistance</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptographic%20circuit" title=" cryptographic circuit"> cryptographic circuit</a>, <a href="https://publications.waset.org/abstracts/search?q=hardware%20security%20evaluation" title=" hardware security evaluation"> hardware security evaluation</a>, <a href="https://publications.waset.org/abstracts/search?q=noise%20resources" title=" noise resources "> noise resources </a> </p> <a href="https://publications.waset.org/abstracts/25852/tamper-resistance-evaluation-tests-with-noise-resources" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25852.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">504</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">15281</span> Implementation of Elliptic Curve Cryptography Encryption Engine on a FPGA</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohamad%20Khairi%20Ishak">Mohamad Khairi Ishak</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Conventional public key crypto systems such as RSA (Ron Rivest, Adi Shamir and Leonard Adleman), DSA (Digital Signature Algorithm), and Elgamal are no longer efficient to be implemented in the small, memory constrained devices. Elliptic Curve Cryptography (ECC), which allows smaller key length as compared to conventional public key crypto systems, has thus become a very attractive choice for many applications. This paper describes implementation of an elliptic curve cryptography (ECC) encryption engine on a FPGA. The system has been implemented in 2 different key sizes, which are 131 bits and 163 bits. Area and timing analysis are provided for both key sizes for comparison. The crypto system, which has been implemented on Altera’s EPF10K200SBC600-1, has a hardware size of 5945/9984 and 6913/9984 of logic cells for 131 bits implementation and 163 bits implementation respectively. The crypto system operates up to 43 MHz, and performs point multiplication operation in 11.3 ms for 131 bits implementation and 14.9 ms for 163 bits implementation. In terms of speed, our crypto system is about 8 times faster than the software implementation of the same system. <p class="card-text"><strong>Keywords:</strong> <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=FPGA" title=" FPGA"> FPGA</a>, <a href="https://publications.waset.org/abstracts/search?q=key%20sizes" title=" key sizes"> key sizes</a>, <a href="https://publications.waset.org/abstracts/search?q=memory" title=" memory "> memory </a> </p> <a href="https://publications.waset.org/abstracts/13762/implementation-of-elliptic-curve-cryptography-encryption-engine-on-a-fpga" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13762.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">322</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">15280</span> Pythagorean-Platonic Lattice Method for Finding all Co-Prime Right Angle Triangles</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anthony%20Overmars">Anthony Overmars</a>, <a href="https://publications.waset.org/abstracts/search?q=Sitalakshmi%20Venkatraman"> Sitalakshmi Venkatraman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a method for determining all of the co-prime right angle triangles in the Euclidean field by looking at the intersection of the Pythagorean and Platonic right angle triangles and the corresponding lattice that this produces. The co-prime properties of each lattice point representing a unique right angle triangle are then considered. This paper proposes a conjunction between these two ancient disparaging theorists. This work has wide applications in information security where cryptography involves improved ways of finding tuples of prime numbers for secure communication systems. In particular, this paper has direct impact in enhancing the encryption and decryption algorithms in cryptography. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pythagorean%20triples" title="Pythagorean triples">Pythagorean triples</a>, <a href="https://publications.waset.org/abstracts/search?q=platonic%20triples" title=" platonic triples"> platonic triples</a>, <a href="https://publications.waset.org/abstracts/search?q=right%20angle%20triangles" title=" right angle triangles"> right angle triangles</a>, <a href="https://publications.waset.org/abstracts/search?q=co-prime%20numbers" title=" co-prime numbers"> co-prime numbers</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography" title=" cryptography"> cryptography</a> </p> <a href="https://publications.waset.org/abstracts/80590/pythagorean-platonic-lattice-method-for-finding-all-co-prime-right-angle-triangles" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/80590.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">239</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">15279</span> Double Encrypted Data Communication Using Cryptography and Steganography</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Adine%20Barett">Adine Barett</a>, <a href="https://publications.waset.org/abstracts/search?q=Jermel%20Watson"> Jermel Watson</a>, <a href="https://publications.waset.org/abstracts/search?q=Anteneh%20Girma"> Anteneh Girma</a>, <a href="https://publications.waset.org/abstracts/search?q=Kacem%20Thabet"> Kacem Thabet</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In information security, secure communication of data across networks has always been a problem at the forefront. Transfer of information across networks is susceptible to being exploited by attackers engaging in malicious activity. In this paper, we leverage steganography and cryptography to create a layered security solution to protect the information being transmitted. The first layer of security leverages crypto- graphic techniques to scramble the information so that it cannot be deciphered even if the steganography-based layer is compromised. The second layer of security relies on steganography to disguise the encrypted in- formation so that it cannot be seen. We consider three cryptographic cipher methods in the cryptography layer, namely, Playfair cipher, Blowfish cipher, and Hills cipher. Then, the encrypted message is passed through the least significant bit (LSB) to the steganography algorithm for further encryption. Both encryption approaches are combined efficiently to help secure information in transit over a network. This multi-layered encryption is a solution that will benefit cloud platforms, social media platforms and networks that regularly transfer private information such as banks and insurance companies. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cryptography" title="cryptography">cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=steganography" title=" steganography"> steganography</a>, <a href="https://publications.waset.org/abstracts/search?q=layered%20security" title=" layered security"> layered security</a>, <a href="https://publications.waset.org/abstracts/search?q=Cipher" title=" Cipher"> Cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a> </p> <a href="https://publications.waset.org/abstracts/168479/double-encrypted-data-communication-using-cryptography-and-steganography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/168479.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">85</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">15278</span> A Lightweight Authentication and Key Exchange Protocol Design for Smart Homes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zhifu%20Li">Zhifu Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Lei%20Li"> Lei Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Wanting%20Zhou"> Wanting Zhou</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuanhang%20He"> Yuanhang He</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposed a lightweight certificate-less authentication and key exchange protocol (Light-CL-PKC) based on elliptic curve cryptography and the Chinese Remainder Theorem for smart home scenarios. Light-CL-PKC can efficiently reduce the computational cost of both sides of authentication by forgoing time-consuming bilinear pair operations and making full use of point-addition and point-multiplication operations on elliptic curves. The authentication and key exchange processes in this system are also completed in a a single round of communication between the two parties. The analysis result demonstrates that it can significantly minimize the communication overhead of more than 32.14% compared with the referenced protocols, while the runtime for both authentication and key exchange have also been significantly reduced. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=authentication" title="authentication">authentication</a>, <a href="https://publications.waset.org/abstracts/search?q=key%20exchange" title=" key exchange"> key exchange</a>, <a href="https://publications.waset.org/abstracts/search?q=certificateless%20public%20key%20cryptography" title=" certificateless public key cryptography"> certificateless public key cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=elliptic%20curve%20cryptography" title=" elliptic curve cryptography"> elliptic curve cryptography</a> </p> <a href="https://publications.waset.org/abstracts/164480/a-lightweight-authentication-and-key-exchange-protocol-design-for-smart-homes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/164480.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">98</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">15277</span> Analysis of Network Performance Using Aspect of Quantum Cryptography</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nisarg%20A.%20Patel">Nisarg A. Patel</a>, <a href="https://publications.waset.org/abstracts/search?q=Hiren%20B.%20Patel"> Hiren B. Patel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Quantum cryptography is described as a point-to-point secure key generation technology that has emerged in recent times in providing absolute security. Researchers have started studying new innovative approaches to exploit the security of Quantum Key Distribution (QKD) for a large-scale communication system. A number of approaches and models for utilization of QKD for secure communication have been developed. The uncertainty principle in quantum mechanics created a new paradigm for QKD. One of the approaches for use of QKD involved network fashioned security. The main goal was point-to-point Quantum network that exploited QKD technology for end-to-end network security via high speed QKD. Other approaches and models equipped with QKD in network fashion are introduced in the literature as. A different approach that this paper deals with is using QKD in existing protocols, which are widely used on the Internet to enhance security with main objective of unconditional security. Our work is towards the analysis of the QKD in Mobile ad-hoc network (MANET). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cryptography" title="cryptography">cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=networking" title=" networking"> networking</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum" title=" quantum"> quantum</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption%20and%20decryption" title=" encryption and decryption"> encryption and decryption</a> </p> <a href="https://publications.waset.org/abstracts/108626/analysis-of-network-performance-using-aspect-of-quantum-cryptography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/108626.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">184</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">15276</span> Secure Authentication Scheme Based on Numerical Series Cryptography for Internet of Things</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Maha%20Aladdin">Maha Aladdin</a>, <a href="https://publications.waset.org/abstracts/search?q=Khaled%20Nagaty"> Khaled Nagaty</a>, <a href="https://publications.waset.org/abstracts/search?q=Abeer%20Hamdy"> Abeer Hamdy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The rapid advancement cellular networks and wireless networks have laid a solid basis for the Internet of Things. IoT has evolved into a unique standard that allows diverse physical devices to collaborate with one another. A service provider gives a variety of services that may be accessed via smart apps anywhere, at any time, and from any location over the Internet. Because of the public environment of mobile communication and the Internet, these services are highly vulnerable to a several malicious attacks, such as unauthorized disclosure by hostile attackers. As a result, the best option for overcoming these vulnerabilities is a strong authentication method. In this paper, a lightweight authentication scheme that is based on numerical series cryptography is proposed for the IoT environments. It allows mutual authentication between IoT devices Parametric study and formal proofs are utilized to illustrate that the pro-posed approach is resistant to a variety of security threats. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=internet%20of%20things" title="internet of things">internet of things</a>, <a href="https://publications.waset.org/abstracts/search?q=authentication" title=" authentication"> authentication</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography" title=" cryptography"> cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=security%20protocol" title=" security protocol"> security protocol</a> </p> <a href="https://publications.waset.org/abstracts/154760/secure-authentication-scheme-based-on-numerical-series-cryptography-for-internet-of-things" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/154760.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">121</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">15275</span> Arithmetic Operations Based on Double Base Number Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=K.%20Sanjayani">K. Sanjayani</a>, <a href="https://publications.waset.org/abstracts/search?q=C.%20Saraswathy"> C. Saraswathy</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Sreenivasan"> S. Sreenivasan</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Sudhahar"> S. Sudhahar</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20Suganya"> D. Suganya</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20S.%20Neelukumari"> K. S. Neelukumari</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Vijayarangan"> N. Vijayarangan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Double Base Number System (DBNS) is an imminent system of representing a number using two bases namely 2 and 3, which has its application in Elliptic Curve Cryptography (ECC) and Digital Signature Algorithm (DSA).The previous binary method representation included only base 2. DBNS uses an approximation algorithm namely, Greedy Algorithm. By using this algorithm, the number of digits required to represent a larger number is less when compared to the standard binary method that uses base 2 algorithms. Hence, the computational speed is increased and time being reduced. The standard binary method uses binary digits 0 and 1 to represent a number whereas the DBNS method uses binary digit 1 alone to represent any number (canonical form). The greedy algorithm uses two ways to represent the number, one is by using only the positive summands and the other is by using both positive and negative summands. In this paper, arithmetic operations are used for elliptic curve cryptography. Elliptic curve discrete logarithm problem is the foundation for most of the day to day elliptic curve cryptography. This appears to be a momentous hard slog compared to digital logarithm problem. In elliptic curve digital signature algorithm, the key generation requires 160 bit of data by usage of standard binary representation. Whereas, the number of bits required generating the key can be reduced with the help of double base number representation. In this paper, a new technique is proposed to generate key during encryption and extraction of key in decryption. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cryptography" title="cryptography">cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=double%20base%20number%20system" title=" double base number system"> double base number system</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=elliptic%20curve%20digital%20signature%20algorithm" title=" elliptic curve digital signature algorithm"> elliptic curve digital signature algorithm</a> </p> <a href="https://publications.waset.org/abstracts/1760/arithmetic-operations-based-on-double-base-number-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/1760.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">15274</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">15273</span> Optimized and Secured Digital Watermarking Using Fuzzy Entropy, Bezier Curve and Visual Cryptography</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=R.%20Rama%20Kishore">R. Rama Kishore</a>, <a href="https://publications.waset.org/abstracts/search?q=Sunesh"> Sunesh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recent development in the usage of internet for different purposes creates a great threat for the copyright protection of the digital images. Digital watermarking can be used to address the problem. This paper presents detailed review of the different watermarking techniques, latest trends in the field of secured, robust and imperceptible watermarking. It also discusses the different optimization techniques used in the field of watermarking in order to improve the robustness and imperceptibility of the method. Different measures are discussed to evaluate the performance of the watermarking algorithm. At the end, this paper proposes a watermarking algorithm using (2, 2) share visual cryptography and Bezier curve based algorithm to improve the security of the watermark. The proposed method uses fractional transformation to improve the robustness of the copyright protection of the method. The algorithm is optimized using fuzzy entropy for better results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=digital%20watermarking" title="digital watermarking">digital watermarking</a>, <a href="https://publications.waset.org/abstracts/search?q=fractional%20transform" title=" fractional transform"> fractional transform</a>, <a href="https://publications.waset.org/abstracts/search?q=visual%20cryptography" title=" visual cryptography"> visual cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=Bezier%20curve" title=" Bezier curve"> Bezier curve</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20entropy" title=" fuzzy entropy"> fuzzy entropy</a> </p> <a href="https://publications.waset.org/abstracts/89843/optimized-and-secured-digital-watermarking-using-fuzzy-entropy-bezier-curve-and-visual-cryptography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/89843.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">365</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">15272</span> Key Transfer Protocol Based on Non-invertible Numbers</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Luis%20A.%20Lizama-Perez">Luis A. Lizama-Perez</a>, <a href="https://publications.waset.org/abstracts/search?q=Manuel%20J.%20Linares"> Manuel J. Linares</a>, <a href="https://publications.waset.org/abstracts/search?q=Mauricio%20Lopez"> Mauricio Lopez</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We introduce a method to perform remote user authentication on what we call non-invertible cryptography. It exploits the fact that the multiplication of an invertible integer and a non-invertible integer in a ring Zn produces a non-invertible integer making infeasible to compute factorization. The protocol requires the smallest key size when is compared with the main public key algorithms as Diffie-Hellman, Rivest-Shamir-Adleman or Elliptic Curve Cryptography. Since we found that the unique opportunity for the eavesdropper is to mount an exhaustive search on the keys, the protocol seems to be post-quantum. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=invertible" title="invertible">invertible</a>, <a href="https://publications.waset.org/abstracts/search?q=non-invertible" title=" non-invertible"> non-invertible</a>, <a href="https://publications.waset.org/abstracts/search?q=ring" title=" ring"> ring</a>, <a href="https://publications.waset.org/abstracts/search?q=key%20transfer" title=" key transfer"> key transfer</a> </p> <a href="https://publications.waset.org/abstracts/98980/key-transfer-protocol-based-on-non-invertible-numbers" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/98980.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">179</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">15271</span> Exploring the Applications of Modular Forms in Cryptography</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Berhane%20Tewelday%20Weldhiwot">Berhane Tewelday Weldhiwot</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research investigates the pivotal role of modular forms in modern cryptographic systems, particularly focusing on their applications in secure communications and data integrity. Modular forms, which are complex analytic functions with rich arithmetic properties, have gained prominence due to their connections to number theory and algebraic geometry. This study begins by outlining the fundamental concepts of modular forms and their historical development, followed by a detailed examination of their applications in cryptographic protocols such as elliptic curve cryptography and zero-knowledge proofs. By employing techniques from analytic number theory, the research delves into how modular forms can enhance the efficiency and security of cryptographic algorithms. The findings suggest that leveraging modular forms not only improves computational performance but also fortifies security measures against emerging threats in digital communication. This work aims to contribute to the ongoing discourse on integrating advanced mathematical theories into practical applications, ultimately fostering innovation in cryptographic methodologies. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=modular%20forms" title="modular forms">modular forms</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography" title=" cryptography"> cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=elliptic%20curves" title=" elliptic curves"> elliptic curves</a>, <a href="https://publications.waset.org/abstracts/search?q=applications" title=" applications"> applications</a>, <a href="https://publications.waset.org/abstracts/search?q=mathematical%20theory" title=" mathematical theory"> mathematical theory</a> </p> <a href="https://publications.waset.org/abstracts/192634/exploring-the-applications-of-modular-forms-in-cryptography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/192634.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">16</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">15270</span> SA-SPKC: Secure and Efficient Aggregation Scheme for Wireless Sensor Networks Using Stateful Public Key Cryptography </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Merad%20Boudia%20Omar%20Rafik">Merad Boudia Omar Rafik</a>, <a href="https://publications.waset.org/abstracts/search?q=Feham%20Mohammed"> Feham Mohammed </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Data aggregation in wireless sensor networks (WSNs) provides a great reduction of energy consumption. The limited resources of sensor nodes make the choice of an encryption algorithm very important for providing security for data aggregation. Asymmetric cryptography involves large ciphertexts and heavy computations but solves, on the other hand, the problem of key distribution of symmetric one. The latter provides smaller ciphertexts and speed computations. Also, the recent researches have shown that achieving the end-to-end confidentiality and the end-to-end integrity at the same is a challenging task. In this paper, we propose (SA-SPKC), a novel security protocol which addresses both security services for WSNs, and where only the base station can verify the individual data and identify the malicious node. Our scheme is based on stateful public key encryption (StPKE). The latter combines the best features of both kinds of encryption along with state in order to reduce the computation overhead. Our analysis <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=secure%20data%20aggregation" title="secure data aggregation">secure data aggregation</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20networks" title=" wireless sensor networks"> wireless sensor networks</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=homomorphic%20encryption" title=" homomorphic encryption "> homomorphic encryption </a> </p> <a href="https://publications.waset.org/abstracts/23097/sa-spkc-secure-and-efficient-aggregation-scheme-for-wireless-sensor-networks-using-stateful-public-key-cryptography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23097.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">297</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">15269</span> Providing Reliability, Availability and Scalability Support for Quick Assist Technology Cryptography on the Cloud</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Songwu%20Shen">Songwu Shen</a>, <a href="https://publications.waset.org/abstracts/search?q=Garrett%20Drysdale"> Garrett Drysdale</a>, <a href="https://publications.waset.org/abstracts/search?q=Veerendranath%20Mannepalli"> Veerendranath Mannepalli</a>, <a href="https://publications.waset.org/abstracts/search?q=Qihua%20Dai"> Qihua Dai</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuan%20Wang"> Yuan Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuli%20Chen"> Yuli Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=David%20Qian"> David Qian</a>, <a href="https://publications.waset.org/abstracts/search?q=Utkarsh%20Kakaiya"> Utkarsh Kakaiya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Hardware accelerator has been a promising solution to reduce the cost of cloud data centers. This paper investigates the QoS enhancement of the acceleration of an important datacenter workload: the webserver (or proxy) that faces high computational consumption originated from secure sockets layer (SSL) or transport layer security (TLS) procession in the cloud environment. Our study reveals that for the accelerator maintenance cases—need to upgrade driver/firmware or hardware reset due to hardware hang; we still can provide cryptography services by switching to software during maintenance phase and then switching back to accelerator after maintenance. The switching is seamless to server application such as Nginx that runs inside a VM on top of the server. To achieve this high availability goal, we propose a comprehensive fallback solution based on Intel® QuickAssist Technology (QAT). This approach introduces an architecture that involves the collaboration between physical function (PF) and virtual function (VF), and collaboration among VF, OpenSSL, and web application Nginx. The evaluation shows that our solution could provide high reliability, availability, and scalability (RAS) of hardware cryptography service in a 7x24x365 manner in the cloud environment. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=accelerator" title="accelerator">accelerator</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography%20service" title=" cryptography service"> cryptography service</a>, <a href="https://publications.waset.org/abstracts/search?q=RAS" title=" RAS"> RAS</a>, <a href="https://publications.waset.org/abstracts/search?q=secure%20sockets%20layer%2Ftransport%20layer%20security" title=" secure sockets layer/transport layer security"> secure sockets layer/transport layer security</a>, <a href="https://publications.waset.org/abstracts/search?q=SSL%2FTLS" title=" SSL/TLS"> SSL/TLS</a>, <a href="https://publications.waset.org/abstracts/search?q=virtualization%20fallback%20architecture" title=" virtualization fallback architecture"> virtualization fallback architecture</a> </p> <a href="https://publications.waset.org/abstracts/127796/providing-reliability-availability-and-scalability-support-for-quick-assist-technology-cryptography-on-the-cloud" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/127796.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">159</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">15268</span> Scalable Systolic Multiplier over Binary Extension Fields Based on Two-Level Karatsuba Decomposition</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chiou-Yng%20Lee">Chiou-Yng Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Wen-Yo%20Lee"> Wen-Yo Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Chieh-Tsai%20Wu"> Chieh-Tsai Wu</a>, <a href="https://publications.waset.org/abstracts/search?q=Cheng-Chen%20Yang"> Cheng-Chen Yang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Shifted polynomial basis (SPB) is a variation of polynomial basis representation. SPB has potential for efficient bit-level and digit-level implementations of multiplication over binary extension fields with subquadratic space complexity. For efficient implementation of pairing computation with large finite fields, this paper presents a new SPB multiplication algorithm based on Karatsuba schemes, and used that to derive a novel scalable multiplier architecture. Analytical results show that the proposed multiplier provides a trade-off between space and time complexities. Our proposed multiplier is modular, regular, and suitable for very-large-scale integration (VLSI) implementations. It involves less area complexity compared to the multipliers based on traditional decomposition methods. It is therefore, more suitable for efficient hardware implementation of pairing based cryptography and elliptic curve cryptography (ECC) in constraint driven applications. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=digit-serial%20systolic%20multiplier" title="digit-serial systolic multiplier">digit-serial systolic multiplier</a>, <a href="https://publications.waset.org/abstracts/search?q=elliptic%20curve%20cryptography%20%28ECC%29" title=" elliptic curve cryptography (ECC)"> elliptic curve cryptography (ECC)</a>, <a href="https://publications.waset.org/abstracts/search?q=Karatsuba%20algorithm%20%28KA%29" title=" Karatsuba algorithm (KA)"> Karatsuba algorithm (KA)</a>, <a href="https://publications.waset.org/abstracts/search?q=shifted%20polynomial%20basis%20%28SPB%29" title=" shifted polynomial basis (SPB)"> shifted polynomial basis (SPB)</a>, <a href="https://publications.waset.org/abstracts/search?q=pairing%20computation" title=" pairing computation"> pairing computation</a> </p> <a href="https://publications.waset.org/abstracts/8169/scalable-systolic-multiplier-over-binary-extension-fields-based-on-two-level-karatsuba-decomposition" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8169.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">362</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">15267</span> A Scheme Cooperating with Cryptography to Enhance Security in Satellite Communications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chieh-Fu%20Chang">Chieh-Fu Chang</a>, <a href="https://publications.waset.org/abstracts/search?q=Wan-Hsin%20Hsieh"> Wan-Hsin Hsieh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We have proposed a novel scheme— iterative word-extension (IWE) to enhance the cliff effect of Reed-Solomon codes regarding the error performance at a specific Eb/N0. The scheme can be readily extended to block codes and the important properties of IWE are further investigated here. In order to select proper block codes specifying the desired cliff Eb/N0, the associated features of IWE are explored. These properties and features grant IWE ability to enhance security regarding the received Eb/N0 in physical layer so that IWE scheme can cooperate with the traditional presentation layer approach — cryptography, to meet the secure requirements in diverse applications. The features and feasibility of IWE scheme in satellite communication are finally discussed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=security" title="security">security</a>, <a href="https://publications.waset.org/abstracts/search?q=IWE" title=" IWE"> IWE</a>, <a href="https://publications.waset.org/abstracts/search?q=cliff%20effect" title=" cliff effect"> cliff effect</a>, <a href="https://publications.waset.org/abstracts/search?q=space%20communications" title=" space communications"> space communications</a> </p> <a href="https://publications.waset.org/abstracts/23545/a-scheme-cooperating-with-cryptography-to-enhance-security-in-satellite-communications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23545.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">425</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">15266</span> Symmetric Key Encryption Algorithm Using Indian Traditional Musical Scale for Information Security</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aishwarya%20Talapuru">Aishwarya Talapuru</a>, <a href="https://publications.waset.org/abstracts/search?q=Sri%20Silpa%20Padmanabhuni"> Sri Silpa Padmanabhuni</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Jyoshna"> B. Jyoshna</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cryptography helps in preventing threats to information security by providing various algorithms. This study introduces a new symmetric key encryption algorithm for information security which is linked with the "raagas" which means Indian traditional scale and pattern of music notes. This algorithm takes the plain text as input and starts its encryption process. The algorithm then randomly selects a raaga from the list of raagas that is assumed to be present with both sender and the receiver. The plain text is associated with the thus selected raaga and an intermediate cipher-text is formed as the algorithm converts the plain text characters into other characters, depending upon the rules of the algorithm. This intermediate code or cipher text is arranged in various patterns in three different rounds of encryption performed. The total number of rounds in the algorithm is equal to the multiples of 3. To be more specific, the outcome or output of the sequence of first three rounds is again passed as the input to this sequence of rounds recursively, till the total number of rounds of encryption is performed. The raaga selected by the algorithm and the number of rounds performed will be specified at an arbitrary location in the key, in addition to important information regarding the rounds of encryption, embedded in the key which is known by the sender and interpreted only by the receiver, thereby making the algorithm hack proof. The key can be constructed of any number of bits without any restriction to the size. A software application is also developed to demonstrate this process of encryption, which dynamically takes the plain text as input and readily generates the cipher text as output. Therefore, this algorithm stands as one of the strongest tools for information security. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cipher%20text" title="cipher text">cipher text</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography" title=" cryptography"> cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=plaintext" title=" plaintext"> plaintext</a>, <a href="https://publications.waset.org/abstracts/search?q=raaga" title=" raaga"> raaga</a> </p> <a href="https://publications.waset.org/abstracts/50374/symmetric-key-encryption-algorithm-using-indian-traditional-musical-scale-for-information-security" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50374.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">289</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">15265</span> Secure Message Transmission Using Meaningful Shares</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> Visual cryptography encodes a secret image into shares of random binary patterns. If the shares are exerted onto transparencies, the secret image can be visually decoded by superimposing a qualified subset of transparencies, but no secret information can be obtained from the superposition of a forbidden subset. The binary patterns of the shares, however, have no visual meaning and hinder the objectives of visual cryptography. In the Secret Message Transmission through Meaningful Shares a secret message to be transmitted is converted to grey scale image. Then (2,2) visual cryptographic shares are generated from this converted gray scale image. The shares are encrypted using A Chaos-Based Image Encryption Algorithm Using Wavelet Transform. Two separate color images which are of the same size of the shares, taken as cover image of the respective shares to hide the shares into them. The encrypted shares which are covered by meaningful images so that a potential eavesdropper wont know there is a message to be read. The meaningful shares are transmitted through two different transmission medium. During decoding shares are fetched from received meaningful images and decrypted using A Chaos-Based Image Encryption Algorithm Using Wavelet Transform. The shares are combined to regenerate the grey scale image from where the secret message is obtained. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=visual%20cryptography" title="visual cryptography">visual cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=wavelet%20transform" title=" wavelet transform"> wavelet transform</a>, <a href="https://publications.waset.org/abstracts/search?q=meaningful%20shares" title=" meaningful shares"> meaningful shares</a>, <a href="https://publications.waset.org/abstracts/search?q=grey%20scale%20image" title=" grey scale image"> grey scale image</a> </p> <a href="https://publications.waset.org/abstracts/16629/secure-message-transmission-using-meaningful-shares" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16629.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">455</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">15264</span> Science behind Quantum Teleportation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ananya%20G.">Ananya G.</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Varshitha"> B. Varshitha</a>, <a href="https://publications.waset.org/abstracts/search?q=Shwetha%20S."> Shwetha S.</a>, <a href="https://publications.waset.org/abstracts/search?q=Kavitha%20S.%20N."> Kavitha S. N.</a>, <a href="https://publications.waset.org/abstracts/search?q=Praveen%20Kumar%20Gupta"> Praveen Kumar Gupta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Teleportation is the ability to travel by just reappearing at some other spot. Though teleportation has never been achieved, quantum teleportation is possible. Quantum teleportation is a process of transferring the quantum state of a particle onto another particle, under the circumstance that one does not get to know any information about the state in the process of transformation. This paper presents a brief overview of quantum teleportation, discussing the topics like Entanglement, EPR Paradox, Bell's Theorem, Qubits, elements for a successful teleport, some examples of advanced teleportation systems (also covers few ongoing experiments), applications (that includes quantum cryptography), and the current hurdles for future scientists interested in this field. Finally, major advantages and limitations to the existing teleportation theory are discussed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=teleportation" title="teleportation">teleportation</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20teleportation" title=" quantum teleportation"> quantum teleportation</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20entanglement" title=" quantum entanglement"> quantum entanglement</a>, <a href="https://publications.waset.org/abstracts/search?q=qubits" title=" qubits"> qubits</a>, <a href="https://publications.waset.org/abstracts/search?q=EPR%20paradox" title=" EPR paradox"> EPR paradox</a>, <a href="https://publications.waset.org/abstracts/search?q=bell%20states" title=" bell states"> bell states</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20particles" title=" quantum particles"> quantum particles</a>, <a href="https://publications.waset.org/abstracts/search?q=spooky%20action%20at%20a%20distance" title=" spooky action at a distance"> spooky action at a distance</a> </p> <a href="https://publications.waset.org/abstracts/148679/science-behind-quantum-teleportation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/148679.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">117</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=cryptography%20process&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cryptography%20process&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cryptography%20process&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cryptography%20process&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cryptography%20process&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cryptography%20process&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cryptography%20process&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cryptography%20process&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cryptography%20process&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cryptography%20process&page=509">509</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cryptography%20process&page=510">510</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cryptography%20process&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>