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: Rabin cryptosystem</title> <meta name="description" content="Search results for: Rabin cryptosystem"> <meta name="keywords" content="Rabin cryptosystem"> <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="Rabin cryptosystem" 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="Rabin cryptosystem"> <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> 31</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: Rabin cryptosystem</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">31</span> Overcoming 4-to-1 Decryption Failure of the Rabin Cryptosystem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20Rezal%20Kamel%20Ariffin">Muhammad Rezal Kamel Ariffin</a>, <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20Asyraf%20Asbullah"> Muhammad Asyraf Asbullah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The square root modulo problem is a known primitive in designing an asymmetric cryptosystem. It was first attempted by Rabin. Decryption failure of the Rabin cryptosystem caused by the 4-to-1 decryption output is overcome efficiently in this work. The proposed scheme to overcome the decryption failure issue (known as the AAβ-cryptosystem) is constructed using a simple mathematical structure, it has low computational requirements and would enable communication devices with low computing power to deploy secure communication procedures efficiently. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rabin%20cryptosystem" title="Rabin cryptosystem">Rabin cryptosystem</a>, <a href="https://publications.waset.org/abstracts/search?q=4-to-1%20decryption%20failure" title=" 4-to-1 decryption failure"> 4-to-1 decryption failure</a>, <a href="https://publications.waset.org/abstracts/search?q=square%20root%20modulo%20problem" title=" square root modulo problem"> square root modulo problem</a>, <a href="https://publications.waset.org/abstracts/search?q=integer%20factorization%20problem" title=" integer factorization problem"> integer factorization problem</a> </p> <a href="https://publications.waset.org/abstracts/21804/overcoming-4-to-1-decryption-failure-of-the-rabin-cryptosystem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21804.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">475</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">30</span> An Attack on the Lucas Based El-Gamal Cryptosystem in the Elliptic Curve Group Over Finite Field Using Greater Common Divisor</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lee%20Feng%20Koo">Lee Feng Koo</a>, <a href="https://publications.waset.org/abstracts/search?q=Tze%20Jin%20Wong"> Tze Jin Wong</a>, <a href="https://publications.waset.org/abstracts/search?q=Pang%20Hung%20Yiu"> Pang Hung Yiu</a>, <a href="https://publications.waset.org/abstracts/search?q=Nik%20Mohd%20Asri%20Nik%20Long"> Nik Mohd Asri Nik Long</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Greater common divisor (GCD) attack is an attack that relies on the polynomial structure of the cryptosystem. This attack required two plaintexts differ from a fixed number and encrypted under same modulus. This paper reports a security reaction of Lucas Based El-Gamal Cryptosystem in the Elliptic Curve group over finite field under GCD attack. Lucas Based El-Gamal Cryptosystem in the Elliptic Curve group over finite field was exposed mathematically to the GCD attack using GCD and Dickson polynomial. The result shows that the cryptanalyst is able to get the plaintext without decryption by using GCD attack. Thus, the study concluded that it is highly perilous when two plaintexts have a slight difference from a fixed number in the same Elliptic curve group over finite field. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=decryption" title="decryption">decryption</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=elliptic%20curve" title=" elliptic curve"> elliptic curve</a>, <a href="https://publications.waset.org/abstracts/search?q=greater%20common%20divisor" title=" greater common divisor"> greater common divisor</a> </p> <a href="https://publications.waset.org/abstracts/97382/an-attack-on-the-lucas-based-el-gamal-cryptosystem-in-the-elliptic-curve-group-over-finite-field-using-greater-common-divisor" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/97382.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">256</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">29</span> Comparison between Separable and Irreducible Goppa Code in McEliece Cryptosystem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Newroz%20Nooralddin%20Abdulrazaq">Newroz Nooralddin Abdulrazaq</a>, <a href="https://publications.waset.org/abstracts/search?q=Thuraya%20Mahmood%20Qaradaghi"> Thuraya Mahmood Qaradaghi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The McEliece cryptosystem is an asymmetric type of cryptography based on error correction code. The classical McEliece used irreducible binary Goppa code which considered unbreakable until now especially with parameter [1024, 524, and 101], but it is suffering from large public key matrix which leads to be difficult to be used practically. In this work Irreducible and Separable Goppa codes have been introduced. The Irreducible and Separable Goppa codes used are with flexible parameters and dynamic error vectors. A Comparison between Separable and Irreducible Goppa code in McEliece Cryptosystem has been done. For encryption stage, to get better result for comparison, two types of testing have been chosen; in the first one the random message is constant while the parameters of Goppa code have been changed. But for the second test, the parameters of Goppa code are constant (m=8 and t=10) while the random message have been changed. The results show that the time needed to calculate parity check matrix in separable are higher than the one for irreducible McEliece cryptosystem, which is considered expected results due to calculate extra parity check matrix in decryption process for g2(z) in separable type, and the time needed to execute error locator in decryption stage in separable type is better than the time needed to calculate it in irreducible type. The proposed implementation has been done by Visual studio C#. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=McEliece%20cryptosystem" title="McEliece cryptosystem">McEliece cryptosystem</a>, <a href="https://publications.waset.org/abstracts/search?q=Goppa%20code" title=" Goppa code"> Goppa code</a>, <a href="https://publications.waset.org/abstracts/search?q=separable" title=" separable"> separable</a>, <a href="https://publications.waset.org/abstracts/search?q=irreducible" title=" irreducible"> irreducible</a> </p> <a href="https://publications.waset.org/abstracts/37017/comparison-between-separable-and-irreducible-goppa-code-in-mceliece-cryptosystem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/37017.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">266</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">28</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">27</span> Cryptographic Attack on Lucas Based Cryptosystems Using Chinese Remainder Theorem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tze%20Jin%20Wong">Tze Jin Wong</a>, <a href="https://publications.waset.org/abstracts/search?q=Lee%20Feng%20Koo"> Lee Feng Koo</a>, <a href="https://publications.waset.org/abstracts/search?q=Pang%20Hung%20Yiu"> Pang Hung Yiu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Lenstra’s attack uses Chinese remainder theorem as a tool and requires a faulty signature to be successful. This paper reports on the security responses of fourth and sixth order Lucas based (LUC<sub>4,6</sub>) cryptosystem under the Lenstra’s attack as compared to the other two Lucas based cryptosystems such as LUC and LUC<sub>3</sub> cryptosystems. All the Lucas based cryptosystems were exposed mathematically to the Lenstra’s attack using Chinese Remainder Theorem and Dickson polynomial. Result shows that the possibility for successful Lenstra’s attack is less against LUC<sub>4,6</sub> cryptosystem than LUC<sub>3</sub> and LUC cryptosystems. Current study concludes that LUC<sub>4,6</sub> cryptosystem is more secure than LUC and LUC<sub>3</sub> cryptosystems in sustaining against Lenstra’s attack. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lucas%20sequence" title="Lucas sequence">Lucas sequence</a>, <a href="https://publications.waset.org/abstracts/search?q=Dickson%20polynomial" title=" Dickson polynomial"> Dickson polynomial</a>, <a href="https://publications.waset.org/abstracts/search?q=faulty%20signature" title=" faulty signature"> faulty signature</a>, <a href="https://publications.waset.org/abstracts/search?q=corresponding%20signature" title=" corresponding signature"> corresponding signature</a>, <a href="https://publications.waset.org/abstracts/search?q=congruence" title=" congruence"> congruence</a> </p> <a href="https://publications.waset.org/abstracts/97395/cryptographic-attack-on-lucas-based-cryptosystems-using-chinese-remainder-theorem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/97395.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">166</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">26</span> Generalized π-Armendariz Authentication Cryptosystem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Areej%20M.%20Abduldaim">Areej M. Abduldaim</a>, <a href="https://publications.waset.org/abstracts/search?q=Nadia%20M.%20G.%20Al-Saidi"> Nadia M. G. Al-Saidi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Algebra is one of the important fields of mathematics. It concerns with the study and manipulation of mathematical symbols. It also concerns with the study of abstractions such as groups, rings, and fields. Due to the development of these abstractions, it is extended to consider other structures, such as vectors, matrices, and polynomials, which are non-numerical objects. Computer algebra is the implementation of algebraic methods as algorithms and computer programs. Recently, many algebraic cryptosystem protocols are based on non-commutative algebraic structures, such as authentication, key exchange, and encryption-decryption processes are adopted. Cryptography is the science that aimed at sending the information through public channels in such a way that only an authorized recipient can read it. Ring theory is the most attractive category of algebra in the area of cryptography. In this paper, we employ the algebraic structure called skew -Armendariz rings to design a neoteric algorithm for zero knowledge proof. The proposed protocol is established and illustrated through numerical example, and its soundness and completeness are proved. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cryptosystem" title="cryptosystem">cryptosystem</a>, <a href="https://publications.waset.org/abstracts/search?q=identification" title=" identification"> identification</a>, <a href="https://publications.waset.org/abstracts/search?q=skew%20%CF%80-Armendariz%20rings" title=" skew π-Armendariz rings"> skew π-Armendariz rings</a>, <a href="https://publications.waset.org/abstracts/search?q=skew%20polynomial%20rings" title=" skew polynomial rings"> skew polynomial rings</a>, <a href="https://publications.waset.org/abstracts/search?q=zero%20knowledge%20protocol" title=" zero knowledge protocol"> zero knowledge protocol</a> </p> <a href="https://publications.waset.org/abstracts/75349/generalized-p-armendariz-authentication-cryptosystem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/75349.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">217</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">25</span> A Comparative Analysis of Asymmetric Encryption Schemes on Android Messaging Service</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mabrouka%20Algherinai">Mabrouka Algherinai</a>, <a href="https://publications.waset.org/abstracts/search?q=Fatma%20Karkouri"> Fatma Karkouri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Today, Short Message Service (SMS) is an important means of communication. SMS is not only used in informal environment for communication and transaction, but it is also used in formal environments such as institutions, organizations, companies, and business world as a tool for communication and transactions. Therefore, there is a need to secure the information that is being transmitted through this medium to ensure security of information both in transit and at rest. But, encryption has been identified as a means to provide security to SMS messages in transit and at rest. Several past researches have proposed and developed several encryption algorithms for SMS and Information Security. This research aims at comparing the performance of common Asymmetric encryption algorithms on SMS security. The research employs the use of three algorithms, namely RSA, McEliece, and RABIN. Several experiments were performed on SMS of various sizes on android mobile device. The experimental results show that each of the three techniques has different key generation, encryption, and decryption times. The efficiency of an algorithm is determined by the time that it takes for encryption, decryption, and key generation. The best algorithm can be chosen based on the least time required for encryption. The obtained results show the least time when McEliece size 4096 is used. RABIN size 4096 gives most time for encryption and so it is the least effective algorithm when considering encryption. Also, the research shows that McEliece size 2048 has the least time for key generation, and hence, it is the best algorithm as relating to key generation. The result of the algorithms also shows that RSA size 1024 is the most preferable algorithm in terms of decryption as it gives the least time for decryption. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=SMS" title="SMS">SMS</a>, <a href="https://publications.waset.org/abstracts/search?q=RSA" title=" RSA"> RSA</a>, <a href="https://publications.waset.org/abstracts/search?q=McEliece" title=" McEliece"> McEliece</a>, <a href="https://publications.waset.org/abstracts/search?q=RABIN" title=" RABIN"> RABIN</a> </p> <a href="https://publications.waset.org/abstracts/97665/a-comparative-analysis-of-asymmetric-encryption-schemes-on-android-messaging-service" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/97665.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">163</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">24</span> The Permutation of Symmetric Triangular Equilateral Group in the Cryptography of Private and Public Key</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fola%20John%20Adeyeye">Fola John Adeyeye</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose a cryptosystem private and public key base on symmetric group Pn and validates its theoretical formulation. This proposed system benefits from the algebraic properties of Pn such as noncommutative high logical, computational speed and high flexibility in selecting key which makes the discrete permutation multiplier logic (DPML) resist to attack by any algorithm such as Pohlig-Hellman. One of the advantages of this scheme is that it explore all the possible triangular symmetries. Against these properties, the only disadvantage is that the law of permutation multiplicity only allow an operation from left to right. Many other cryptosystems can be transformed into their symmetric group. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cryptosystem" title="cryptosystem">cryptosystem</a>, <a href="https://publications.waset.org/abstracts/search?q=private%20and%20public%20key" title=" private and public key"> private and public key</a>, <a href="https://publications.waset.org/abstracts/search?q=DPML" title=" DPML"> DPML</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric%20group%20Pn" title=" symmetric group Pn"> symmetric group Pn</a> </p> <a href="https://publications.waset.org/abstracts/103766/the-permutation-of-symmetric-triangular-equilateral-group-in-the-cryptography-of-private-and-public-key" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/103766.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">202</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">23</span> Modified Montgomery for RSA Cryptosystem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rupali%20Verma">Rupali Verma</a>, <a href="https://publications.waset.org/abstracts/search?q=Maitreyee%20Dutta"> Maitreyee Dutta</a>, <a href="https://publications.waset.org/abstracts/search?q=Renu%20Vig"> Renu Vig</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Encryption and decryption in RSA are done by modular exponentiation which is achieved by repeated modular multiplication. Hence, efficiency of modular multiplication directly determines the efficiency of RSA cryptosystem. This paper designs a Modified Montgomery Modular multiplication in which addition of operands is computed by 4:2 compressor. The basic logic operations in addition are partitioned over two iterations such that parallel computations are performed. This reduces the critical path delay of proposed Montgomery design. The proposed design and RSA are implemented on Virtex 2 and Virtex 5 FPGAs. The two factors partitioning and parallelism have improved the frequency and throughput of proposed design. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=RSA" title="RSA">RSA</a>, <a href="https://publications.waset.org/abstracts/search?q=montgomery%20modular%20multiplication" title=" montgomery modular multiplication"> montgomery modular multiplication</a>, <a href="https://publications.waset.org/abstracts/search?q=4%3A2%20compressor" title=" 4:2 compressor"> 4:2 compressor</a>, <a href="https://publications.waset.org/abstracts/search?q=FPGA" title=" FPGA "> FPGA </a> </p> <a href="https://publications.waset.org/abstracts/3733/modified-montgomery-for-rsa-cryptosystem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3733.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">413</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">22</span> Secure Automatic Key SMS Encryption Scheme Using Hybrid Cryptosystem: An Approach for One Time Password Security Enhancement</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pratama%20R.%20Yunia">Pratama R. Yunia</a>, <a href="https://publications.waset.org/abstracts/search?q=Firmansyah"> Firmansyah</a>, <a href="https://publications.waset.org/abstracts/search?q=I."> I.</a>, <a href="https://publications.waset.org/abstracts/search?q=Ariani"> Ariani</a>, <a href="https://publications.waset.org/abstracts/search?q=Ulfa%20R.%20Maharani"> Ulfa R. Maharani</a>, <a href="https://publications.waset.org/abstracts/search?q=Fikri%20M.%20Al"> Fikri M. Al</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays, notwithstanding that the role of SMS as a means of communication has been largely replaced by online applications such as WhatsApp, Telegram, and others, the fact that SMS is still used for certain and important communication needs is indisputable. Among them is for sending one time password (OTP) as an authentication media for various online applications ranging from chatting, shopping to online banking applications. However, the usage of SMS does not pretty much guarantee the security of transmitted messages. As a matter of fact, the transmitted messages between BTS is still in the form of plaintext, making it extremely vulnerable to eavesdropping, especially if the message is confidential, for instance, the OTP. One solution to overcome this problem is to use an SMS application which provides security services for each transmitted message. Responding to this problem, in this study, an automatic key SMS encryption scheme was designed as a means to secure SMS communication. The proposed scheme allows SMS sending, which is automatically encrypted with keys that are constantly changing (automatic key update), automatic key exchange, and automatic key generation. In terms of the security method, the proposed scheme applies cryptographic techniques with a hybrid cryptosystem mechanism. Proofing the proposed scheme, a client to client SMS encryption application was developed using Java platform with AES-256 as encryption algorithm, RSA-768 as public and private key generator and SHA-256 for message hashing function. The result of this study is a secure automatic key SMS encryption scheme using hybrid cryptosystem which can guarantee the security of every transmitted message, so as to become a reliable solution in sending confidential messages through SMS although it still has weaknesses in terms of processing time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=encryption%20scheme" title="encryption scheme">encryption scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20cryptosystem" title=" hybrid cryptosystem"> hybrid cryptosystem</a>, <a href="https://publications.waset.org/abstracts/search?q=one%20time%20password" title=" one time password"> one time password</a>, <a href="https://publications.waset.org/abstracts/search?q=SMS%20security" title=" SMS security"> SMS security</a> </p> <a href="https://publications.waset.org/abstracts/118902/secure-automatic-key-sms-encryption-scheme-using-hybrid-cryptosystem-an-approach-for-one-time-password-security-enhancement" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/118902.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">128</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">21</span> Software Quality Assurance in Network Security using Cryptographic Techniques</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sidra%20Shabbir">Sidra Shabbir</a>, <a href="https://publications.waset.org/abstracts/search?q=Ayesha%20Manzoor"> Ayesha Manzoor</a>, <a href="https://publications.waset.org/abstracts/search?q=Mehreen%20Sirshar"> Mehreen Sirshar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The use of the network communication has imposed serious threats to the security of assets over the network. Network security is getting more prone to active and passive attacks which may result in serious consequences to data integrity, confidentiality and availability. Various cryptographic techniques have been proposed in the past few years to combat with the concerned problem by ensuring quality but in order to have a fully secured network; a framework of new cryptosystem was needed. This paper discusses certain cryptographic techniques which have shown far better improvement in the network security with enhanced quality assurance. The scope of this research paper is to cover the security pitfalls in the current systems and their possible solutions based on the new cryptosystems. The development of new cryptosystem framework has paved a new way to the widespread network communications with enhanced quality in network security. <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=network%20security" title=" network security"> network security</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=decryption" title=" decryption"> decryption</a>, <a href="https://publications.waset.org/abstracts/search?q=integrity" title=" integrity"> integrity</a>, <a href="https://publications.waset.org/abstracts/search?q=confidentiality" title=" confidentiality"> confidentiality</a>, <a href="https://publications.waset.org/abstracts/search?q=security%20algorithms" title=" security algorithms"> security algorithms</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/26324/software-quality-assurance-in-network-security-using-cryptographic-techniques" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/26324.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">733</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">20</span> An Analysis of Non-Elliptic Curve Based Primality Tests</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=William%20Wong">William Wong</a>, <a href="https://publications.waset.org/abstracts/search?q=Zakaria%20Alomari"> Zakaria Alomari</a>, <a href="https://publications.waset.org/abstracts/search?q=Hon%20Ching%20Lai"> Hon Ching Lai</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhida%20Li"> Zhida Li</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Modern-day information security depends on implementing Diffie-Hellman, which requires the generation of prime numbers. Because the number of primes is infinite, it is impractical to store prime numbers for use, and therefore, primality tests are indispensable in modern-day information security. A primality test is a test to determine whether a number is prime or composite. There are two types of primality tests, which are deterministic tests and probabilistic tests. Deterministic tests are adopting algorithms that provide a definite answer whether a given number is prime or composite. While in probabilistic tests, a probabilistic result would be provided, there is a degree of uncertainty. In this paper, we review three probabilistic tests: the Fermat Primality Test, the Miller-Rabin Test, and the Baillie-PSW Test, as well as one deterministic test, the Agrawal-Kayal-Saxena (AKS) Test. Furthermore, we do an analysis of these tests. All of the reviews discussed are not based on the Elliptic Curve. The analysis demonstrates that, in the majority of real-world scenarios, the Baillie- PSW test’s favorability stems from its typical operational complexity of O(log 3n) and its capacity to deliver accurate results for numbers below 2^64. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=primality%20tests" title="primality tests">primality tests</a>, <a href="https://publications.waset.org/abstracts/search?q=Fermat%E2%80%99s%20primality%20test" title=" Fermat’s primality test"> Fermat’s primality test</a>, <a href="https://publications.waset.org/abstracts/search?q=Miller-Rabin%20primality%20test" title=" Miller-Rabin primality test"> Miller-Rabin primality test</a>, <a href="https://publications.waset.org/abstracts/search?q=Baillie-PSW%20primality%20test" title=" Baillie-PSW primality test"> Baillie-PSW primality test</a>, <a href="https://publications.waset.org/abstracts/search?q=AKS%20primality%20test" title=" AKS primality test"> AKS primality test</a> </p> <a href="https://publications.waset.org/abstracts/173827/an-analysis-of-non-elliptic-curve-based-primality-tests" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/173827.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">88</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">19</span> Interdisciplinary Teaching for Nursing Students: A Key to Understanding Teamwork</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ilana%20Margalith">Ilana Margalith</a>, <a href="https://publications.waset.org/abstracts/search?q=Yaron%20Niv"> Yaron Niv</a> </p> <p class="card-text"><strong>Abstract:</strong></p> One of the most important factors of professional health treatment is teamwork, in which each discipline contributes its expert knowledge, thus ensuring quality and a high standard of care as well as efficient communication (one of the International Patient Safety Goals). However, in most countries, students are educated separately by each health discipline. They are exposed to teamwork only during their clinical experience, which in some cases is short and skill-oriented. In addition, health organizations in most countries are hierarchical and although changes have occurred in the hierarchy of the medical system, there are still disciplines that underrate the unique contributions of other health professionals, thus, young graduates of health professions develop and base their perception of their peers from other disciplines on insufficient knowledge. In order to establish a wide-ranging perception among nursing students as to the contribution of different health professionals to the health of their patients, students at the Clalit Nursing Academy, Rabin Campus (Dina), Israel, participated in an interdisciplinary clinical discussion with students from several different professions, other than nursing, who were completing their clinical experience at Rabin Medical Center in medicine, health psychology, social work, audiology, physiotherapy and occupational therapy. The discussion was led by a medical-surgical nursing instructor. Their tutors received in advance, a case report enabling them to prepare the students as to how to present their professional theories and interventions regarding the case. Mutual stimulation and acknowledgment of the unique contribution of each part of the team enriched the nursing students' understanding as to how their own nursing interventions could be integrated into the entire process towards a safe and speedy recovery of the patient. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=health%20professions%27%20students" title="health professions' students">health professions' students</a>, <a href="https://publications.waset.org/abstracts/search?q=interdisciplinary%20clinical%20discussion" title=" interdisciplinary clinical discussion"> interdisciplinary clinical discussion</a>, <a href="https://publications.waset.org/abstracts/search?q=nursing%20education" title=" nursing education"> nursing education</a>, <a href="https://publications.waset.org/abstracts/search?q=patient%20safety" title=" patient safety"> patient safety</a> </p> <a href="https://publications.waset.org/abstracts/94532/interdisciplinary-teaching-for-nursing-students-a-key-to-understanding-teamwork" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/94532.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">172</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">18</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">17</span> Evolutional Substitution Cipher on Chaotic Attractor</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Adda%20Ali-Pacha">Adda Ali-Pacha</a>, <a href="https://publications.waset.org/abstracts/search?q=Naima%20Hadj-Said"> Naima Hadj-Said</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays, the security of information is primarily founded on the calculation of algorithms that confidentiality depend on the number of bits necessary to define a cryptographic key. In this work, we introduce a new chaotic cryptosystem that we call evolutional substitution cipher on a chaotic attractor. In this research paper, we take the Henon attractor. The evolutional substitution cipher on Henon attractor is based on the principle of monoalphabetic cipher and it associates the plaintext at a succession of real numbers calculated from the attractor equations. <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=substitution%20cipher" title=" substitution cipher"> substitution cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=chaos%20theory" title=" chaos theory"> chaos theory</a>, <a href="https://publications.waset.org/abstracts/search?q=Henon%20attractor" title=" Henon attractor"> Henon attractor</a>, <a href="https://publications.waset.org/abstracts/search?q=evolutional%20substitution%20cipher" title=" evolutional substitution cipher"> evolutional substitution cipher</a> </p> <a href="https://publications.waset.org/abstracts/4769/evolutional-substitution-cipher-on-chaotic-attractor" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/4769.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">429</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">16</span> Property of Diamond Coated Tools for Lapping Single-Crystal Sapphire Wafer</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Feng%20Wei">Feng Wei</a>, <a href="https://publications.waset.org/abstracts/search?q=Lu%20Wenzhuang"> Lu Wenzhuang</a>, <a href="https://publications.waset.org/abstracts/search?q=Cai%20Wenjun"> Cai Wenjun</a>, <a href="https://publications.waset.org/abstracts/search?q=Yu%20Yaping"> Yu Yaping</a>, <a href="https://publications.waset.org/abstracts/search?q=Basnet%20Rabin"> Basnet Rabin</a>, <a href="https://publications.waset.org/abstracts/search?q=Zuo%20Dunwen"> Zuo Dunwen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Diamond coatings were prepared on cemented carbide by hot filament chemical vapor deposition (HFCVD) method. Lapping experiment of single-crystal sapphire wafer was carried out using the prepared diamond coated tools. The diamond coatings and machined surface of the sapphire wafer were evaluated by SEM, laser confocal microscope and Raman spectrum. The results indicate that the lapping sapphire chips are small irregular debris and long thread-like debris. There is graphitization of diamond crystal during the lapping process. A low surface roughness can be obtained using a spherical grain diamond coated tool. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=lapping" title="lapping">lapping</a>, <a href="https://publications.waset.org/abstracts/search?q=nano-micro%20crystalline%20diamond%20coating" title=" nano-micro crystalline diamond coating"> nano-micro crystalline diamond coating</a>, <a href="https://publications.waset.org/abstracts/search?q=Raman%20spectrum" title=" Raman spectrum"> Raman spectrum</a>, <a href="https://publications.waset.org/abstracts/search?q=sapphire" title=" sapphire"> sapphire</a> </p> <a href="https://publications.waset.org/abstracts/21218/property-of-diamond-coated-tools-for-lapping-single-crystal-sapphire-wafer" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21218.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">493</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">15</span> A Secure Digital Signature Scheme with Fault Tolerance Based on the Improved RSA System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=H.%20El-Kamchouchi">H. El-Kamchouchi</a>, <a href="https://publications.waset.org/abstracts/search?q=Heba%20Gaber"> Heba Gaber</a>, <a href="https://publications.waset.org/abstracts/search?q=Fatma%20Ahmed"> Fatma Ahmed</a>, <a href="https://publications.waset.org/abstracts/search?q=Dalia%20H.%20El-Kamchouchi"> Dalia H. El-Kamchouchi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Fault tolerance and data security are two important issues in modern communication systems. In this paper, we propose a secure and efficient digital signature scheme with fault tolerance based on the improved RSA system. The proposed scheme for the RSA cryptosystem contains three prime numbers and overcome several attacks possible on RSA. By using the Chinese Reminder Theorem (CRT) the proposed scheme has a speed improvement on the RSA decryption side and it provides high security also. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=digital%20signature" title="digital signature">digital signature</a>, <a href="https://publications.waset.org/abstracts/search?q=fault%20tolerance" title=" fault tolerance"> fault tolerance</a>, <a href="https://publications.waset.org/abstracts/search?q=RSA" title=" RSA"> RSA</a>, <a href="https://publications.waset.org/abstracts/search?q=security%20analysis" title=" security analysis"> security analysis</a> </p> <a href="https://publications.waset.org/abstracts/51269/a-secure-digital-signature-scheme-with-fault-tolerance-based-on-the-improved-rsa-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/51269.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">476</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">14</span> Accelerating Side Channel Analysis with Distributed and Parallelized Processing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kyunghee%20Oh">Kyunghee Oh</a>, <a href="https://publications.waset.org/abstracts/search?q=Dooho%20Choi"> Dooho Choi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Although there is no theoretical weakness in a cryptographic algorithm, Side Channel Analysis can find out some secret data from the physical implementation of a cryptosystem. The analysis is based on extra information such as timing information, power consumption, electromagnetic leaks or even sound which can be exploited to break the system. Differential Power Analysis is one of the most popular analyses, as computing the statistical correlations of the secret keys and power consumptions. It is usually necessary to calculate huge data and takes a long time. It may take several weeks for some devices with countermeasures. We suggest and evaluate the methods to shorten the time to analyze cryptosystems. Our methods include distributed computing and parallelized processing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=DPA" title="DPA">DPA</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20computing" title=" distributed computing"> distributed computing</a>, <a href="https://publications.waset.org/abstracts/search?q=parallelized%20processing" title=" parallelized processing"> parallelized processing</a>, <a href="https://publications.waset.org/abstracts/search?q=side%20channel%20analysis" title=" side channel analysis"> side channel analysis</a> </p> <a href="https://publications.waset.org/abstracts/9204/accelerating-side-channel-analysis-with-distributed-and-parallelized-processing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9204.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">427</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">13</span> Mechanical Properties of D2 Tool Steel Cryogenically Treated Using Controllable Cooling</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Rabin">A. Rabin</a>, <a href="https://publications.waset.org/abstracts/search?q=G.%20Mazor"> G. Mazor</a>, <a href="https://publications.waset.org/abstracts/search?q=I.%20Ladizhenski"> I. Ladizhenski</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20Shneck"> R. Shneck</a>, <a href="https://publications.waset.org/abstracts/search?q=Z."> Z.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The hardness and hardenability of AISI D2 cold work tool steel with conventional quenching (CQ), deep cryogenic quenching (DCQ) and rapid deep cryogenic quenching heat treatments caused by temporary porous coating based on magnesium sulfate was investigated. Each of the cooling processes was examined from the perspective of the full process efficiency, heat flux in the austenite-martensite transformation range followed by characterization of the temporary porous layer made of magnesium sulfate using confocal laser scanning microscopy (CLSM), surface and core hardness and hardenability using Vickr’s hardness technique. The results show that the cooling rate (CR) at the austenite-martensite transformation range have a high influence on the hardness of the studied steel. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=AISI%20D2" title="AISI D2">AISI D2</a>, <a href="https://publications.waset.org/abstracts/search?q=controllable%20cooling" title=" controllable cooling"> controllable cooling</a>, <a href="https://publications.waset.org/abstracts/search?q=magnesium%20sulfate%20coating" title=" magnesium sulfate coating"> magnesium sulfate coating</a>, <a href="https://publications.waset.org/abstracts/search?q=rapid%20cryogenic%20heat%20treatment" title=" rapid cryogenic heat treatment"> rapid cryogenic heat treatment</a>, <a href="https://publications.waset.org/abstracts/search?q=temporary%20porous%20layer" title=" temporary porous layer"> temporary porous layer</a> </p> <a href="https://publications.waset.org/abstracts/153436/mechanical-properties-of-d2-tool-steel-cryogenically-treated-using-controllable-cooling" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/153436.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">137</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">12</span> Feedback from Experiments on Managing Methods against Japanese Knotweed on a River Appendix of the RhôNe between 2015 and 2020</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=William%20Brasier">William Brasier</a>, <a href="https://publications.waset.org/abstracts/search?q=Nicolas%20Rabin"> Nicolas Rabin</a>, <a href="https://publications.waset.org/abstracts/search?q=Celeste%20Joly"> Celeste Joly</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Japanese knotweed (Fallopia japonica) is very present on the banks of the Rhone, colonizing more and more areas along the river. The Compagnie Nationale du Rhone (C.N.R.), which manages the river, has experimented with several control techniques in recent years. Since 2015, 15 experimental plots have been monitored on the banks of a restored river appendix to measure the effect of three control methods: confinement by felt, repeated mowing and the planting of competing species and/or species with allelopathic power: Viburnum opulus, Rhamnus frangula, Sambucus ebulus and Juglans regia. Each year, the number of stems, the number of elderberry plants, the height of the plants and photographs were collected. After six years of monitoring, the results showed that the density of knotweed stems decreased by 50 to 90% on all plots. The control methods are sustainable and are gradually gaining in efficiency. The establishment of native plants coupled with regular manual maintenance can reduce the development of Japanese knotweed. Continued monitoring over the next few years will determine the kinetics of the total eradication (i.e. 0 stem/plot) of the Japanese knotweed by these methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fallopia%20japonica" title="fallopia japonica">fallopia japonica</a>, <a href="https://publications.waset.org/abstracts/search?q=interspecific%20plant%20competition" title=" interspecific plant competition "> interspecific plant competition </a>, <a href="https://publications.waset.org/abstracts/search?q=Rhone%20river" title=" Rhone river"> Rhone river</a>, <a href="https://publications.waset.org/abstracts/search?q=riparian%20trees" title=" riparian trees"> riparian trees</a> </p> <a href="https://publications.waset.org/abstracts/132873/feedback-from-experiments-on-managing-methods-against-japanese-knotweed-on-a-river-appendix-of-the-rhone-between-2015-and-2020" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/132873.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">130</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">11</span> Efficient Internal Generator Based on Random Selection of an Elliptic Curve</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mustapha%20Benssalah">Mustapha Benssalah</a>, <a href="https://publications.waset.org/abstracts/search?q=Mustapha%20Djeddou"> Mustapha Djeddou</a>, <a href="https://publications.waset.org/abstracts/search?q=Karim%20Drouiche"> Karim Drouiche</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The random number generation (RNG) presents a significant importance for the security and the privacy of numerous applications, such as RFID technology and smart cards. Since, the quality of the generated bit sequences is paramount that a weak internal generator for example, can directly cause the entire application to be insecure, and thus it makes no sense to employ strong algorithms for the application. In this paper, we propose a new pseudo random number generator (PRNG), suitable for cryptosystems ECC-based, constructed by randomly selecting points from several elliptic curves randomly selected. The main contribution of this work is the increasing of the generator internal states by extending the set of its output realizations to several curves auto-selected. The quality and the statistical characteristics of the proposed PRNG are validated using the Chi-square goodness of fit test and the empirical Special Publication 800-22 statistical test suite issued by NIST. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=PRNG" title="PRNG">PRNG</a>, <a href="https://publications.waset.org/abstracts/search?q=security" title=" security"> security</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptosystem" title=" cryptosystem"> cryptosystem</a>, <a href="https://publications.waset.org/abstracts/search?q=ECC" title=" ECC"> ECC</a> </p> <a href="https://publications.waset.org/abstracts/23607/efficient-internal-generator-based-on-random-selection-of-an-elliptic-curve" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23607.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">444</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">10</span> A Survey on Countermeasures of Cache-Timing Attack on AES Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Settana%20M.%20Abdulh">Settana M. Abdulh</a>, <a href="https://publications.waset.org/abstracts/search?q=Naila%20A.%20Sadalla"> Naila A. Sadalla</a>, <a href="https://publications.waset.org/abstracts/search?q=Yaseen%20H.%20Taha"> Yaseen H. Taha</a>, <a href="https://publications.waset.org/abstracts/search?q=Howaida%20Elshoush"> Howaida Elshoush</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Side channel attacks are based on side channel information, which is information that is leaked from encryption systems. This includes timing information, power consumption as well as electromagnetic or even sound leaking which can exploited by an attacker. Implementing side channel attacks are possible if and only if an attacker has access to a cryptosystem. In this case, the attacker can exploit bad implementation in software or hardware which is not controlled by encryption implementer. Thus, he/she will represent a real threat to the security system. Several countermeasures have been proposed to eliminate side channel information vulnerability.Cache timing attack is a special type of side channel attack. Here, timing information is collected and analyzed by an attacker to guess sensitive information such as encryption key or plaintext. This paper reviews the technique applied in this attack and surveys the countermeasures against it, evaluating the feasibility and usability of each. Based on this evaluation, finally we pose several recommendations about using these countermeasures. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=AES%20algorithm" title="AES algorithm">AES algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=side%20channel%20attack" title=" side channel attack"> side channel attack</a>, <a href="https://publications.waset.org/abstracts/search?q=cache%20timing%20attack" title=" cache timing attack"> cache timing attack</a>, <a href="https://publications.waset.org/abstracts/search?q=cache%20timing%20countermeasure" title=" cache timing countermeasure"> cache timing countermeasure</a> </p> <a href="https://publications.waset.org/abstracts/17652/a-survey-on-countermeasures-of-cache-timing-attack-on-aes-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17652.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">299</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">9</span> Main Chaos-Based Image Encryption Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ibtissem%20Talbi">Ibtissem Talbi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> During the last decade, a variety of chaos-based cryptosystems have been investigated. Most of them are based on the structure of Fridrich, which is based on the traditional confusion-diffusion architecture proposed by Shannon. Compared with traditional cryptosystems (DES, 3DES, AES, etc.), the chaos-based cryptosystems are more flexible, more modular and easier to be implemented, which make them suitable for large scale-data encyption, such as images and videos. The heart of any chaos-based cryptosystem is the chaotic generator and so, a part of the efficiency (robustness, speed) of the system depends greatly on it. In this talk, we give an overview of the state of the art of chaos-based block ciphers and we describe some of our schemes already proposed. Also we will focus on the essential characteristics of the digital chaotic generator, The needed performance of a chaos-based block cipher in terms of security level and speed of calculus depends on the considered application. There is a compromise between the security and the speed of the calculation. The security of these block block ciphers will be analyzed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=chaos-based%20cryptosystems" title="chaos-based cryptosystems">chaos-based cryptosystems</a>, <a href="https://publications.waset.org/abstracts/search?q=chaotic%20generator" title=" chaotic generator"> chaotic generator</a>, <a href="https://publications.waset.org/abstracts/search?q=security%20analysis" title=" security analysis"> security analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=structure%20of%20Fridrich" title=" structure of Fridrich"> structure of Fridrich</a> </p> <a href="https://publications.waset.org/abstracts/13064/main-chaos-based-image-encryption-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13064.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">684</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">8</span> Deterministic Random Number Generator Algorithm for Cryptosystem Keys</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Adi%20A.%20Maaita">Adi A. Maaita</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamza%20A.%20A.%20Al%20Sewadi"> Hamza A. A. Al Sewadi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> One of the crucial parameters of digital cryptographic systems is the selection of the keys used and their distribution. The randomness of the keys has a strong impact on the system’s security strength being difficult to be predicted, guessed, reproduced or discovered by a cryptanalyst. Therefore, adequate key randomness generation is still sought for the benefit of stronger cryptosystems. This paper suggests an algorithm designed to generate and test pseudo random number sequences intended for cryptographic applications. This algorithm is based on mathematically manipulating a publically agreed upon information between sender and receiver over a public channel. This information is used as a seed for performing some mathematical functions in order to generate a sequence of pseudorandom numbers that will be used for encryption/decryption purposes. This manipulation involves permutations and substitutions that fulfills Shannon’s principle of “confusion and diffusion”. ASCII code characters wereutilized in the generation process instead of using bit strings initially, which adds more flexibility in testing different seed values. Finally, the obtained results would indicate sound difficulty of guessing keys by attackers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cryptosystems" title="cryptosystems">cryptosystems</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20security%20agreement" title=" information security agreement"> information security agreement</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=random%20numbers" title=" random numbers"> random numbers</a> </p> <a href="https://publications.waset.org/abstracts/24886/deterministic-random-number-generator-algorithm-for-cryptosystem-keys" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24886.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">268</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">7</span> Performance Analysis of Elliptic Curve Cryptography Using Onion Routing to Enhance the Privacy and Anonymity in Grid Computing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=H.%20Parveen%20Begam">H. Parveen Begam</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20A.%20Maluk%20Mohamed"> M. A. Maluk Mohamed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Grid computing is an environment that allows sharing and coordinated use of diverse resources in dynamic, heterogeneous and distributed environment using Virtual Organization (VO). Security is a critical issue due to the open nature of the wireless channels in the grid computing which requires three fundamental services: authentication, authorization, and encryption. The privacy and anonymity are considered as an important factor while communicating over publicly spanned network like web. To ensure a high level of security we explored an extension of onion routing, which has been used with dynamic token exchange along with protection of privacy and anonymity of individual identity. To improve the performance of encrypting the layers, the elliptic curve cryptography is used. Compared to traditional cryptosystems like RSA (Rivest-Shamir-Adelman), ECC (Elliptic Curve Cryptosystem) offers equivalent security with smaller key sizes which result in faster computations, lower power consumption, as well as memory and bandwidth savings. This paper presents the estimation of the performance improvements of onion routing using ECC as well as the comparison graph between performance level of RSA and ECC. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=grid%20computing" title="grid computing">grid computing</a>, <a href="https://publications.waset.org/abstracts/search?q=privacy" title=" privacy"> privacy</a>, <a href="https://publications.waset.org/abstracts/search?q=anonymity" title=" anonymity"> anonymity</a>, <a href="https://publications.waset.org/abstracts/search?q=onion%20routing" title=" onion routing"> onion routing</a>, <a href="https://publications.waset.org/abstracts/search?q=ECC" title=" ECC"> ECC</a>, <a href="https://publications.waset.org/abstracts/search?q=RSA" title=" RSA"> RSA</a> </p> <a href="https://publications.waset.org/abstracts/28834/performance-analysis-of-elliptic-curve-cryptography-using-onion-routing-to-enhance-the-privacy-and-anonymity-in-grid-computing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28834.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">398</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">6</span> On Dynamic Chaotic S-BOX Based Advanced Encryption Standard Algorithm for Image Encryption</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ajish%20Sreedharan">Ajish Sreedharan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Security in transmission and storage of digital images has its importance in today’s image communications and confidential video conferencing. Due to the increasing use of images in industrial process, it is essential to protect the confidential image data from unauthorized access. Advanced Encryption Standard (AES) is a well known block cipher that has several advantages in data encryption. However, it is not suitable for real-time applications. This paper presents modifications to the Advanced Encryption Standard to reflect a high level security and better image encryption. The modifications are done by adjusting the ShiftRow Transformation and using On Dynamic chaotic S-BOX. In AES the Substitute bytes, Shift row and Mix columns by themselves would provide no security because they do not use the key. In Dynamic chaotic S-BOX Based AES the Substitute bytes provide security because the S-Box is constructed from the key. Experimental results verify and prove that the proposed modification to image cryptosystem is highly secure from the cryptographic viewpoint. The results also prove that with a comparison to original AES encryption algorithm the modified algorithm gives better encryption results in terms of security against statistical attacks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=advanced%20encryption%20standard%20%28AES%29" title="advanced encryption standard (AES)">advanced encryption standard (AES)</a>, <a href="https://publications.waset.org/abstracts/search?q=on%20dynamic%20chaotic%20S-BOX" title=" on dynamic chaotic S-BOX"> on dynamic chaotic S-BOX</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20encryption" title=" image encryption"> image encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=security%20analysis" title=" security analysis"> security analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=ShiftRow%20transformation" title=" ShiftRow transformation"> ShiftRow transformation</a> </p> <a href="https://publications.waset.org/abstracts/16549/on-dynamic-chaotic-s-box-based-advanced-encryption-standard-algorithm-for-image-encryption" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16549.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">437</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5</span> Efficient Semi-Systolic Finite Field Multiplier Using Redundant Basis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hyun-Ho%20Lee">Hyun-Ho Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Kee-Won%20Kim"> Kee-Won Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The arithmetic operations over GF(2m) have been extensively used in error correcting codes and public-key cryptography schemes. Finite field arithmetic includes addition, multiplication, division and inversion operations. Addition is very simple and can be implemented with an extremely simple circuit. The other operations are much more complex. The multiplication is the most important for cryptosystems, such as the elliptic curve cryptosystem, since computing exponentiation, division, and computing multiplicative inverse can be performed by computing multiplication iteratively. In this paper, we present a parallel computation algorithm that operates Montgomery multiplication over finite field using redundant basis. Also, based on the multiplication algorithm, we present an efficient semi-systolic multiplier over finite field. The multiplier has less space and time complexities compared to related multipliers. As compared to the corresponding existing structures, the multiplier saves at least 5% area, 50% time, and 53% area-time (AT) complexity. Accordingly, it is well suited for VLSI implementation and can be easily applied as a basic component for computing complex operations over finite field, such as inversion and division operation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=finite%20field" title="finite field">finite field</a>, <a href="https://publications.waset.org/abstracts/search?q=Montgomery%20multiplication" title=" Montgomery multiplication"> Montgomery multiplication</a>, <a href="https://publications.waset.org/abstracts/search?q=systolic%20array" title=" systolic array"> systolic array</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography" title=" cryptography"> cryptography</a> </p> <a href="https://publications.waset.org/abstracts/55023/efficient-semi-systolic-finite-field-multiplier-using-redundant-basis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/55023.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">294</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">4</span> Isolation Preserving Medical Conclusion Hold Structure via C5 Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Swati%20Kishor%20Zode">Swati Kishor Zode</a>, <a href="https://publications.waset.org/abstracts/search?q=Rahul%20Ambekar"> Rahul Ambekar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Data mining is the extraction of fascinating examples on the other hand information from enormous measure of information and choice is made as indicated by the applicable information extracted. As of late, with the dangerous advancement in internet, stockpiling of information and handling procedures, privacy preservation has been one of the major (higher) concerns in data mining. Various techniques and methods have been produced for protection saving data mining. In the situation of Clinical Decision Support System, the choice is to be made on the premise of the data separated from the remote servers by means of Internet to diagnose the patient. In this paper, the fundamental thought is to build the precision of Decision Support System for multiple diseases for different maladies and in addition protect persistent information while correspondence between Clinician side (Client side) also, the Server side. A privacy preserving protocol for clinical decision support network is proposed so that patients information dependably stay scrambled amid diagnose prepare by looking after the accuracy. To enhance the precision of Decision Support System for various malady C5.0 classifiers and to save security, a Homomorphism encryption algorithm Paillier cryptosystem is being utilized. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=classification" title="classification">classification</a>, <a href="https://publications.waset.org/abstracts/search?q=homomorphic%20encryption" title=" homomorphic encryption"> homomorphic encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=clinical%20decision%20support" title=" clinical decision support"> clinical decision support</a>, <a href="https://publications.waset.org/abstracts/search?q=privacy" title=" privacy "> privacy </a> </p> <a href="https://publications.waset.org/abstracts/32625/isolation-preserving-medical-conclusion-hold-structure-via-c5-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32625.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">3</span> Human-Elephant Conflict and Mitigation Measures in Buffer Zone of Bardia National Park, Nepal</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rabin%20Paudel">Rabin Paudel</a>, <a href="https://publications.waset.org/abstracts/search?q=Dambar%20Bahadur%20Mahato"> Dambar Bahadur Mahato</a>, <a href="https://publications.waset.org/abstracts/search?q=Prabin%20Poudel"> Prabin Poudel</a>, <a href="https://publications.waset.org/abstracts/search?q=Bijaya%20Neupane"> Bijaya Neupane</a>, <a href="https://publications.waset.org/abstracts/search?q=Sakar%20Jha"> Sakar Jha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Understanding Human-Elephant Conflict (HEC) is very important in countries like Nepal, where solutions to escalating conflicts are urgently required. However, most of the HEC mitigation measures implemented so far have been done on an ad hoc basis without the detailed understanding of nature and extent of the damage. This study aims to assess the current scenario of HEC in regards to crop and property damages by Wild Asian Elephant and people’s perception towards existing mitigating measures and elephant conservation in Buffer zone area of Bardia National Park. The methods used were a questionnaire survey (N= 178), key-informant interview (N= 18) and focal group discussions (N= 6). Descriptive statistics were used to determine the nature and extent of damage and to understand people’s perception towards HEC, its mitigation measures and elephant conservation. Chi-square test was applied to determine the significance of crop and property damages with respect to distance from the park boundary. Out of all types of damage, crop damage was found to be the highest (51%), followed by house damage (31%) and damage to stored grains (18%) with winter being the season with the greatest elephant damage. Among 178 respondents, the majority of them (82%) were positive towards elephant conservation despite the increment in HEC incidents as perceived by 88% of total respondents. Among the mitigation measures present, the most applied was electric fence (91%) followed by barbed wire fence (5%), reinforced concrete cement wall (3%) and gabion wall (1%). Most effective mitigation measures were reinforced concrete cement wall and gabion wall. To combat increasing crop damage, the insurance policy should be initiated. The efficiency of the mitigation measures should be timely monitored, and corrective measures should be applied as per the need. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=crop%20and%20property%20damage" title="crop and property damage">crop and property damage</a>, <a href="https://publications.waset.org/abstracts/search?q=elephant%20conflict" title=" elephant conflict"> elephant conflict</a>, <a href="https://publications.waset.org/abstracts/search?q=Asiatic%20wild%20elephant" title=" Asiatic wild elephant"> Asiatic wild elephant</a>, <a href="https://publications.waset.org/abstracts/search?q=mitigation%20measures" title=" mitigation measures"> mitigation measures</a> </p> <a href="https://publications.waset.org/abstracts/111975/human-elephant-conflict-and-mitigation-measures-in-buffer-zone-of-bardia-national-park-nepal" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/111975.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">149</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">2</span> 'Coping with Workplace Violence' Workshop: A Commendable Addition to the Curriculum for BA in Nursing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ilana%20Margalith">Ilana Margalith</a>, <a href="https://publications.waset.org/abstracts/search?q=Adaya%20Meirowitz"> Adaya Meirowitz</a>, <a href="https://publications.waset.org/abstracts/search?q=Sigalit%20Cohavi"> Sigalit Cohavi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Violence against health professionals by patients and their families have recently become a disturbing phenomenon worldwide, exacting psychological as well as economic tolls. Health workplaces in Israel (e.g. hospitals and H.M.O clinics) provide workshops for their employees, supplying them with coping strategies. However, these workshops do not focus on nursing students, who are also subjected to this violence. Their learning environment is no longer as protective as it used to be. Furthermore, coping with violence was not part of the curriculum for Israeli nursing students. Thus, based on human aggression theories which depict the pivotal role of the professional's correct response in preventing the onset of an aggressive response or the escalation of violence, a workshop was developed for undergraduate nursing students at the Clalit Nursing Academy, Rabin Campus (Dina), Israel. The workshop aimed at reducing students' anxiety vis a vis the aggressive patient or family in addition to strengthening their ability to cope with such situations. The students practiced interpersonal skills, especially relevant to early detection of potential violence, as well as ‘a correct response’ reaction to the violence, thus developing the necessary steps to be implemented when encountering violence in the workplace. In order to assess the efficiency of the workshop, the participants filled out a questionnaire comprising knowledge and self-efficacy scales. Moreover, the replies of the 23 participants in this workshop were compared with those of 24 students who attended a standard course on interpersonal communication. Students' self-efficacy and knowledge were measured in both groups before and after the course. A statistically significant interaction was found between group (workshop/standard course) and time (before/after) as to the influence on students' self-efficacy (p=0.004) and knowledge (p=0.007). Nursing students, who participated in this ‘coping with workplace violence’ workshop, gained knowledge, confidence and a sense of self-efficacy with regard to workplace violence. Early detection of signs of imminent violence amongst patients or families and the prevention of its escalation, as well as the ability to manage the threatening situation when occurring, are acquired skills. Encouraging nursing students to learn and practice these skills may enhance their ability to cope with these unfortunate occurrences. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=early%20detection%20of%20violence" title="early detection of violence">early detection of violence</a>, <a href="https://publications.waset.org/abstracts/search?q=nursing%20students" title=" nursing students"> nursing students</a>, <a href="https://publications.waset.org/abstracts/search?q=patient%20aggression" title=" patient aggression"> patient aggression</a>, <a href="https://publications.waset.org/abstracts/search?q=self-efficacy" title=" self-efficacy"> self-efficacy</a>, <a href="https://publications.waset.org/abstracts/search?q=workplace%20violence" title=" workplace violence"> workplace violence</a> </p> <a href="https://publications.waset.org/abstracts/94534/coping-with-workplace-violence-workshop-a-commendable-addition-to-the-curriculum-for-ba-in-nursing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/94534.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">138</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=Rabin%20cryptosystem&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Rabin%20cryptosystem&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>