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: block cipher</title> <meta name="description" content="Search results for: block cipher"> <meta name="keywords" content="block cipher"> <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="block cipher" 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="block cipher"> <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> 1064</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: block cipher</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1064</span> NUX: A Lightweight Block Cipher for Security at Wireless Sensor Node Level</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gaurav%20Bansod">Gaurav Bansod</a>, <a href="https://publications.waset.org/abstracts/search?q=Swapnil%20Sutar"> Swapnil Sutar</a>, <a href="https://publications.waset.org/abstracts/search?q=Abhijit%20Patil"> Abhijit Patil</a>, <a href="https://publications.waset.org/abstracts/search?q=Jagdish%20Patil"> Jagdish Patil</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes an ultra-lightweight cipher NUX. NUX is a generalized Feistel network. It supports 128/80 bit key length and block length of 64 bit. For 128 bit key length, NUX needs only 1022 GEs which is less as compared to all existing cipher design. NUX design results into less footprint area and minimal memory size. This paper presents security analysis of NUX cipher design which shows cipher’s resistance against basic attacks like Linear and Differential Cryptanalysis. Advanced attacks like Biclique attack is also mounted on NUX cipher design. Two different F function in NUX cipher design results in high diffusion mechanism which generates large number of active S-boxes in minimum number of rounds. NUX cipher has total 31 rounds. NUX design will be best-suited design for critical application like smart grid, IoT, wireless sensor network, where memory size, footprint area and the power dissipation are the major constraints. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=lightweight%20cryptography" title="lightweight cryptography">lightweight cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=Feistel%20cipher" title=" Feistel cipher"> Feistel cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=block%20cipher" title=" block cipher"> block cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=IoT" title=" IoT"> IoT</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=embedded%20security" title=" embedded security"> embedded security</a>, <a href="https://publications.waset.org/abstracts/search?q=ubiquitous%20computing" title=" ubiquitous computing"> ubiquitous computing</a> </p> <a href="https://publications.waset.org/abstracts/76572/nux-a-lightweight-block-cipher-for-security-at-wireless-sensor-node-level" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/76572.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">373</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">1063</span> A New Block Cipher for Resource-Constrained Internet of Things Devices</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20Rana">Muhammad Rana</a>, <a href="https://publications.waset.org/abstracts/search?q=Quazi%20Mamun"> Quazi Mamun</a>, <a href="https://publications.waset.org/abstracts/search?q=Rafiqul%20Islam"> Rafiqul Islam</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the Internet of Things (IoT), many devices are connected and accumulate a sheer amount of data. These Internet-driven raw data need to be transferred securely to the end-users via dependable networks. Consequently, the challenges of IoT security in various IoT domains are paramount. Cryptography is being applied to secure the networks for authentication, confidentiality, data integrity and access control. However, due to the resource constraint properties of IoT devices, the conventional cipher may not be suitable in all IoT networks. This paper designs a robust and effective lightweight cipher to secure the IoT environment and meet the resource-constrained nature of IoT devices. We also propose a symmetric and block-cipher based lightweight cryptographic algorithm. The proposed algorithm increases the complexity of the block cipher, maintaining the lowest computational requirements possible. The proposed algorithm efficiently constructs the key register updating technique, reduces the number of encryption rounds, and adds a new layer between the encryption and decryption processes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=internet%20of%20things" title="internet of things">internet of things</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography%20block%20cipher" title=" cryptography block cipher"> cryptography block cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=S-box" title=" S-box"> S-box</a>, <a href="https://publications.waset.org/abstracts/search?q=key%20management" title=" key management"> key management</a>, <a href="https://publications.waset.org/abstracts/search?q=security" title=" security"> security</a>, <a href="https://publications.waset.org/abstracts/search?q=network" title=" network"> network</a> </p> <a href="https://publications.waset.org/abstracts/148938/a-new-block-cipher-for-resource-constrained-internet-of-things-devices" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/148938.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">113</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">1062</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">1061</span> Improved Impossible Differential Cryptanalysis of Midori64</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zhan%20Chen">Zhan Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Wenquan%20Bi"> Wenquan Bi</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiaoyun%20Wang"> Xiaoyun Wang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Midori family of light weight block cipher is proposed in ASIACRYPT2015. It has attracted the attention of numerous cryptanalysts. There are two versions of Midori: Midori64 which takes a 64-bit block size and Midori128 the size of which is 128-bit. In this paper an improved 10-round impossible differential attack on Midori64 is proposed. Pre-whitening keys are considered in this attack. A better impossible differential path is used to reduce time complexity by decreasing the number of key bits guessed. A hash table is built in the pre-computation phase to reduce computational complexity. Partial abort technique is used in the key seiving phase. The attack requires 259 chosen plaintexts, 214.58 blocks of memory and 268.83 10-round Midori64 encryptions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cryptanalysis" title="cryptanalysis">cryptanalysis</a>, <a href="https://publications.waset.org/abstracts/search?q=impossible%20differential" title=" impossible differential"> impossible differential</a>, <a href="https://publications.waset.org/abstracts/search?q=light%20weight%20block%20cipher" title=" light weight block cipher"> light weight block cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=Midori" title=" Midori"> Midori</a> </p> <a href="https://publications.waset.org/abstracts/61496/improved-impossible-differential-cryptanalysis-of-midori64" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/61496.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">348</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">1060</span> 11-Round Impossible Differential Attack on Midori64</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zhan%20Chen">Zhan Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Wenquan%20Bi"> Wenquan Bi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper focuses on examining the strength of Midori against impossible differential attack. The Midori family of light weight block cipher orienting to energy-efficiency is proposed in ASIACRYPT2015. Using a 6-round property, the authors implement an 11-round impossible differential attack on Midori64 by extending two rounds on the top and three rounds on the bottom. There is enough key space to consider pre-whitening keys in this attack. An impossible differential path that minimises the key bits involved is used to reduce computational complexity. Several additional observations such as partial abort technique are used to further reduce data and time complexities. This attack has data complexity of 2 ⁶⁹·² chosen plaintexts, requires 2 ¹⁴·⁵⁸ blocks of memory and 2 ⁹⁴·⁷ 11- round Midori64 encryptions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cryptanalysis" title="cryptanalysis">cryptanalysis</a>, <a href="https://publications.waset.org/abstracts/search?q=impossible%20differential" title=" impossible differential"> impossible differential</a>, <a href="https://publications.waset.org/abstracts/search?q=light%20weight%20block%20cipher" title=" light weight block cipher"> light weight block cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=Midori" title=" Midori"> Midori</a> </p> <a href="https://publications.waset.org/abstracts/67242/11-round-impossible-differential-attack-on-midori64" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67242.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">276</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">1059</span> Constructing White-Box Implementations Based on Threshold Shares and Composite Fields</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tingting%20%20Lin">Tingting Lin</a>, <a href="https://publications.waset.org/abstracts/search?q=Manfred%20von%20Willich"> Manfred von Willich</a>, <a href="https://publications.waset.org/abstracts/search?q=Dafu%20Lou"> Dafu Lou</a>, <a href="https://publications.waset.org/abstracts/search?q=Phil%20Eisen"> Phil Eisen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A white-box implementation of a cryptographic algorithm is a software implementation intended to resist extraction of the secret key by an adversary. To date, most of the white-box techniques are used to protect block cipher implementations. However, a large proportion of the white-box implementations are proven to be vulnerable to affine equivalence attacks and other algebraic attacks, as well as differential computation analysis (DCA). In this paper, we identify a class of block ciphers for which we propose a method of constructing white-box implementations. Our method is based on threshold implementations and operations in composite fields. The resulting implementations consist of lookup tables and few exclusive OR operations. All intermediate values (inputs and outputs of the lookup tables) are masked. The threshold implementation makes the distribution of the masked values uniform and independent of the original inputs, and the operations in composite fields reduce the size of the lookup tables. The white-box implementations can provide resistance against algebraic attacks and DCA-like attacks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=white-box" title="white-box">white-box</a>, <a href="https://publications.waset.org/abstracts/search?q=block%20cipher" title=" block cipher"> block cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=composite%20field" title=" composite field"> composite field</a>, <a href="https://publications.waset.org/abstracts/search?q=threshold%20implementation" title=" threshold implementation"> threshold implementation</a> </p> <a href="https://publications.waset.org/abstracts/108457/constructing-white-box-implementations-based-on-threshold-shares-and-composite-fields" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/108457.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">168</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">1058</span> DCT and Stream Ciphers for Improved Image Encryption Mechanism </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=T.%20R.%20Sharika">T. R. Sharika</a>, <a href="https://publications.waset.org/abstracts/search?q=Ashwini%20Kumar"> Ashwini Kumar</a>, <a href="https://publications.waset.org/abstracts/search?q=Kamal%20Bijlani"> Kamal Bijlani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Encryption is the process of converting crucial information’s unreadable to unauthorized persons. Image security is an important type of encryption that secures all type of images from cryptanalysis. A stream cipher is a fast symmetric key algorithm which is used to convert plaintext to cipher text. In this paper we are proposing an image encryption algorithm with Discrete Cosine Transform and Stream Ciphers that can improve compression of images and enhanced security. The paper also explains the use of a shuffling algorithm for enhancing securing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=decryption" title="decryption">decryption</a>, <a href="https://publications.waset.org/abstracts/search?q=DCT" title=" DCT"> DCT</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=RC4%20cipher" title=" RC4 cipher"> RC4 cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=stream%20cipher" title=" stream cipher"> stream cipher</a> </p> <a href="https://publications.waset.org/abstracts/32780/dct-and-stream-ciphers-for-improved-image-encryption-mechanism" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32780.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">363</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">1057</span> A Hill Cipher Based on the Kish-Sethuraman Protocol</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kondwani%20Magamba">Kondwani Magamba</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the idealized Kish-Sethuraman (KS) protocol,messages are sent between Alice and Bob each using a secret personal key. This protocol is said to be perfectly secure because both Bob and Alice keep their keys undisclosed so that at all times the message is encrypted by at least one key, thus no information is leaked or shared. In this paper, we propose a realization of the KS protocol through the use of the Hill Cipher. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kish-Sethuraman%20Protocol" title="Kish-Sethuraman Protocol">Kish-Sethuraman Protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=Hill%20Cipher" title=" Hill Cipher"> Hill Cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=MDS%20Matrices" title=" MDS Matrices"> MDS Matrices</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a> </p> <a href="https://publications.waset.org/abstracts/15505/a-hill-cipher-based-on-the-kish-sethuraman-protocol" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15505.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">357</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">1056</span> Round Addition DFA on Lightweight Block Ciphers with On-The-Fly Key Schedule</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hideki%20Yoshikawa">Hideki Yoshikawa</a>, <a href="https://publications.waset.org/abstracts/search?q=Masahiro%20Kaminaga"> Masahiro Kaminaga</a>, <a href="https://publications.waset.org/abstracts/search?q=Arimitsu%20Shikoda"> Arimitsu Shikoda</a>, <a href="https://publications.waset.org/abstracts/search?q=Toshinori%20Suzuki"> Toshinori Suzuki</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Round addition differential fault analysis (DFA) using operation bypassing for lightweight block ciphers with on-the-fly key schedule is presented. For 64-bit KLEIN and 64-bit LED, it is shown that only a pair of correct ciphertext and faulty ciphertext can derive the secret master key. For PRESENT, one correct ciphertext and two faulty ciphertexts are required to reconstruct the secret key. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=differential%20fault%20analysis%20%28DFA%29" title="differential fault analysis (DFA)">differential fault analysis (DFA)</a>, <a href="https://publications.waset.org/abstracts/search?q=round%20addition" title=" round addition"> round addition</a>, <a href="https://publications.waset.org/abstracts/search?q=block%20cipher" title=" block cipher"> block cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=on-the-fly%20key%20schedule" title=" on-the-fly key schedule"> on-the-fly key schedule</a> </p> <a href="https://publications.waset.org/abstracts/35859/round-addition-dfa-on-lightweight-block-ciphers-with-on-the-fly-key-schedule" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35859.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">703</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">1055</span> Determination of Complexity Level in Merged Irregular Transposition Cipher</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Okike%20Benjamin">Okike Benjamin</a>, <a href="https://publications.waset.org/abstracts/search?q=Garba%20Ejd"> Garba Ejd</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Today, it has been observed security of information along the superhighway is often compromised by those who are not authorized to have access to such information. In order to ensure the security of information along the superhighway, such information should be encrypted by some means to conceal the real meaning of the information. There are many encryption techniques out there in the market. However, some of these encryption techniques are often easily decrypted by adversaries. The researcher has decided to develop an encryption technique that may be more difficult to decrypt. This may be achieved by splitting the message to be encrypted into parts and encrypting each part separately and swapping the positions before transmitting the message along the superhighway. The method is termed Merged Irregular Transposition Cipher. Also, the research would determine the complexity level in respect to the number of splits of the message. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=transposition%20cipher" title="transposition cipher">transposition cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=merged%20irregular%20cipher" title=" merged irregular cipher"> merged irregular cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=complexity%20level" title=" complexity level "> complexity level </a> </p> <a href="https://publications.waset.org/abstracts/13713/determination-of-complexity-level-in-merged-irregular-transposition-cipher" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13713.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">344</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">1054</span> Determination of Complexity Level in Okike's Merged Irregular Transposition Cipher</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Okike%20Benjami">Okike Benjami</a>, <a href="https://publications.waset.org/abstracts/search?q=Garba%20Ejd"> Garba Ejd</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Today, it has been observed security of information along the superhighway is often compromised by those who are not authorized to have access to such information. In other to ensure the security of information along the superhighway, such information should be encrypted by some means to conceal the real meaning of the information. There are many encryption techniques out there in the market. However, some of these encryption techniques are often decrypted by adversaries with ease. The researcher has decided to develop an encryption technique that may be more difficult to decrypt. This may be achieved by splitting the message to be encrypted into parts and encrypting each part separately and swapping the positions before transmitting the message along the superhighway. The method is termed Okike’s Merged Irregular Transposition Cipher. Also, the research would determine the complexity level in respect to the number of splits of the message. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=transposition%20cipher" title="transposition cipher">transposition cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=merged%20irregular%20cipher" title=" merged irregular cipher"> merged irregular cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=complexity%20level" title=" complexity level"> complexity level</a> </p> <a href="https://publications.waset.org/abstracts/30279/determination-of-complexity-level-in-okikes-merged-irregular-transposition-cipher" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/30279.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">290</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">1053</span> Double Encrypted Data Communication Using Cryptography and Steganography</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Adine%20Barett">Adine Barett</a>, <a href="https://publications.waset.org/abstracts/search?q=Jermel%20Watson"> Jermel Watson</a>, <a href="https://publications.waset.org/abstracts/search?q=Anteneh%20Girma"> Anteneh Girma</a>, <a href="https://publications.waset.org/abstracts/search?q=Kacem%20Thabet"> Kacem Thabet</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In information security, secure communication of data across networks has always been a problem at the forefront. Transfer of information across networks is susceptible to being exploited by attackers engaging in malicious activity. In this paper, we leverage steganography and cryptography to create a layered security solution to protect the information being transmitted. The first layer of security leverages crypto- graphic techniques to scramble the information so that it cannot be deciphered even if the steganography-based layer is compromised. The second layer of security relies on steganography to disguise the encrypted in- formation so that it cannot be seen. We consider three cryptographic cipher methods in the cryptography layer, namely, Playfair cipher, Blowfish cipher, and Hills cipher. Then, the encrypted message is passed through the least significant bit (LSB) to the steganography algorithm for further encryption. Both encryption approaches are combined efficiently to help secure information in transit over a network. This multi-layered encryption is a solution that will benefit cloud platforms, social media platforms and networks that regularly transfer private information such as banks and insurance companies. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cryptography" title="cryptography">cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=steganography" title=" steganography"> steganography</a>, <a href="https://publications.waset.org/abstracts/search?q=layered%20security" title=" layered security"> layered security</a>, <a href="https://publications.waset.org/abstracts/search?q=Cipher" title=" Cipher"> Cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a> </p> <a href="https://publications.waset.org/abstracts/168479/double-encrypted-data-communication-using-cryptography-and-steganography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/168479.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">85</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1052</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">1051</span> Preparation of Wireless Networks and Security; Challenges in Efficient Accession of Encrypted Data in Healthcare</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Zayoud">M. Zayoud</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Oueida"> S. Oueida</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Ionescu"> S. Ionescu</a>, <a href="https://publications.waset.org/abstracts/search?q=P.%20AbiChar"> P. AbiChar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Background: Wireless sensor network is encompassed of diversified tools of information technology, which is widely applied in a range of domains, including military surveillance, weather forecasting, and earthquake forecasting. Strengthened grounds are always developed for wireless sensor networks, which usually emerges security issues during professional application. Thus, essential technological tools are necessary to be assessed for secure aggregation of data. Moreover, such practices have to be incorporated in the healthcare practices that shall be serving in the best of the mutual interest Objective: Aggregation of encrypted data has been assessed through homomorphic stream cipher to assure its effectiveness along with providing the optimum solutions to the field of healthcare. Methods: An experimental design has been incorporated, which utilized newly developed cipher along with CPU-constrained devices. Modular additions have also been employed to evaluate the nature of aggregated data. The processes of homomorphic stream cipher have been highlighted through different sensors and modular additions. Results: Homomorphic stream cipher has been recognized as simple and secure process, which has allowed efficient aggregation of encrypted data. In addition, the application has led its way to the improvisation of the healthcare practices. Statistical values can be easily computed through the aggregation on the basis of selected cipher. Sensed data in accordance with variance, mean, and standard deviation has also been computed through the selected tool. Conclusion: It can be concluded that homomorphic stream cipher can be an ideal tool for appropriate aggregation of data. Alongside, it shall also provide the best solutions to the healthcare sector. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=aggregation" title="aggregation">aggregation</a>, <a href="https://publications.waset.org/abstracts/search?q=cipher" title=" cipher"> cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=homomorphic%20stream" title=" homomorphic stream"> homomorphic stream</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a> </p> <a href="https://publications.waset.org/abstracts/52690/preparation-of-wireless-networks-and-security-challenges-in-efficient-accession-of-encrypted-data-in-healthcare" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/52690.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">260</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">1050</span> Improved Hash Value Based Stream CipherUsing Delayed Feedback with Carry Shift Register</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=K.%20K.%20Soundra%20Pandian">K. K. Soundra Pandian</a>, <a href="https://publications.waset.org/abstracts/search?q=Bhupendra%20Gupta"> Bhupendra Gupta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the modern era, as the application data’s are massive and complex, it needs to be secured from the adversary attack. In this context, a non-recursive key based integrated spritz stream cipher with the circulant hash function using delayed feedback with carry shift register (d-FCSR) is proposed in this paper. The novelty of this proposed stream cipher algorithm is to engender the improved keystream using d-FCSR. The proposed algorithm is coded using Verilog HDL to produce dynamic binary key stream and implemented on commercially available FPGA device Virtex 5 xc5vlx110t-2ff1136. The implementation of stream cipher using d-FCSR on the FPGA device operates at a maximum frequency of 60.62 MHz. It achieved the data throughput of 492 Mbps and improved in terms of efficiency (throughput/area) compared to existing techniques. This paper also briefs the cryptanalysis of proposed circulant hash value based spritz stream cipher using d-FCSR is against the adversary attack on a hardware platform for the hardware based cryptography applications. <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=circulant%20function" title=" circulant function"> circulant function</a>, <a href="https://publications.waset.org/abstracts/search?q=field%20programmable%20gated%20array" title=" field programmable gated array"> field programmable gated array</a>, <a href="https://publications.waset.org/abstracts/search?q=hash%20value" title=" hash value"> hash value</a>, <a href="https://publications.waset.org/abstracts/search?q=spritz%20stream%20cipher" title=" spritz stream cipher"> spritz stream cipher</a> </p> <a href="https://publications.waset.org/abstracts/73756/improved-hash-value-based-stream-cipherusing-delayed-feedback-with-carry-shift-register" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/73756.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">250</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">1049</span> Model Estimation and Error Level for Okike’s Merged Irregular Transposition Cipher</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Okike%20Benjamin">Okike Benjamin</a>, <a href="https://publications.waset.org/abstracts/search?q=Garba%20E.%20J.%20D."> Garba E. J. D.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The researcher has developed a new encryption technique known as Merged Irregular Transposition Cipher. In this cipher method of encryption, a message to be encrypted is split into parts and each part encrypted separately. Before the encrypted message is transmitted to the recipient(s), the positions of the split in the encrypted messages could be swapped to ensure more security. This work seeks to develop a model by considering the split number, S and the average number of characters per split, L as the message under consideration is split from 2 through 10. Again, after developing the model, the error level in the model would be determined. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=merged%20irregular%20transposition" title="merged irregular transposition">merged irregular transposition</a>, <a href="https://publications.waset.org/abstracts/search?q=error%20level" title=" error level"> error level</a>, <a href="https://publications.waset.org/abstracts/search?q=model%20estimation" title=" model estimation"> model estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=message%20splitting" title=" message splitting"> message splitting</a> </p> <a href="https://publications.waset.org/abstracts/22331/model-estimation-and-error-level-for-okikes-merged-irregular-transposition-cipher" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/22331.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">314</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1048</span> Fingerprint Image Encryption Using a 2D Chaotic Map and Elliptic Curve Cryptography</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=D.%20M.%20S.%20Bandara">D. M. S. Bandara</a>, <a href="https://publications.waset.org/abstracts/search?q=Yunqi%20Lei"> Yunqi Lei</a>, <a href="https://publications.waset.org/abstracts/search?q=Ye%20Luo"> Ye Luo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Fingerprints are suitable as long-term markers of human identity since they provide detailed and unique individual features which are difficult to alter and durable over life time. In this paper, we propose an algorithm to encrypt and decrypt fingerprint images by using a specially designed Elliptic Curve Cryptography (ECC) procedure based on block ciphers. In addition, to increase the confusing effect of fingerprint encryption, we also utilize a chaotic-behaved method called Arnold Cat Map (ACM) for a 2D scrambling of pixel locations in our method. Experimental results are carried out with various types of efficiency and security analyses. As a result, we demonstrate that the proposed fingerprint encryption/decryption algorithm is advantageous in several different aspects including efficiency, security and flexibility. In particular, using this algorithm, we achieve a margin of about 0.1% in the test of Number of Pixel Changing Rate (NPCR) values comparing to the-state-of-the-art performances. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=arnold%20cat%20map" title="arnold cat map">arnold cat map</a>, <a href="https://publications.waset.org/abstracts/search?q=biometric%20encryption" title=" biometric encryption"> biometric encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=block%20cipher" title=" block cipher"> block cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=elliptic%20curve%20cryptography" title=" elliptic curve cryptography"> elliptic curve cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=fingerprint%20encryption" title=" fingerprint encryption"> fingerprint encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=Koblitz%E2%80%99s%20%20encoding" title=" Koblitz’s encoding"> Koblitz’s encoding</a> </p> <a href="https://publications.waset.org/abstracts/96251/fingerprint-image-encryption-using-a-2d-chaotic-map-and-elliptic-curve-cryptography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/96251.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">204</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1047</span> Maintaining User-Level Security in Short Message Service</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=T.%20Arudchelvam">T. Arudchelvam</a>, <a href="https://publications.waset.org/abstracts/search?q=W.%20W.%20E.%20N.%20Fernando"> W. W. E. N. Fernando</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Mobile phone has become as an essential thing in our life. Therefore, security is the most important thing to be considered in mobile communication. Short message service is the cheapest way of communication via the mobile phones. Therefore, security is very important in the short message service as well. This paper presents a method to maintain the security at user level. Different types of encryption methods are used to implement the user level security in mobile phones. Caesar cipher, Rail Fence, Vigenere cipher and RSA are used as encryption methods in this work. Caesar cipher and the Rail Fence methods are enhanced and implemented. The beauty in this work is that the user can select the encryption method and the key. Therefore, by changing the encryption method and the key time to time, the user can ensure the security of messages. By this work, while users can safely send/receive messages, they can save their information from unauthorised and unwanted people in their own mobile phone as well. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=SMS" title="SMS">SMS</a>, <a href="https://publications.waset.org/abstracts/search?q=user%20level%20security" title=" user level security"> user level security</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=decryption" title=" decryption"> decryption</a>, <a href="https://publications.waset.org/abstracts/search?q=short%20message%20service" title=" short message service"> short message service</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20communication" title=" mobile communication"> mobile communication</a> </p> <a href="https://publications.waset.org/abstracts/49955/maintaining-user-level-security-in-short-message-service" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/49955.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">396</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1046</span> Symmetric Key Encryption Algorithm Using Indian Traditional Musical Scale for Information Security</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aishwarya%20Talapuru">Aishwarya Talapuru</a>, <a href="https://publications.waset.org/abstracts/search?q=Sri%20Silpa%20Padmanabhuni"> Sri Silpa Padmanabhuni</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Jyoshna"> B. Jyoshna</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cryptography helps in preventing threats to information security by providing various algorithms. This study introduces a new symmetric key encryption algorithm for information security which is linked with the "raagas" which means Indian traditional scale and pattern of music notes. This algorithm takes the plain text as input and starts its encryption process. The algorithm then randomly selects a raaga from the list of raagas that is assumed to be present with both sender and the receiver. The plain text is associated with the thus selected raaga and an intermediate cipher-text is formed as the algorithm converts the plain text characters into other characters, depending upon the rules of the algorithm. This intermediate code or cipher text is arranged in various patterns in three different rounds of encryption performed. The total number of rounds in the algorithm is equal to the multiples of 3. To be more specific, the outcome or output of the sequence of first three rounds is again passed as the input to this sequence of rounds recursively, till the total number of rounds of encryption is performed. The raaga selected by the algorithm and the number of rounds performed will be specified at an arbitrary location in the key, in addition to important information regarding the rounds of encryption, embedded in the key which is known by the sender and interpreted only by the receiver, thereby making the algorithm hack proof. The key can be constructed of any number of bits without any restriction to the size. A software application is also developed to demonstrate this process of encryption, which dynamically takes the plain text as input and readily generates the cipher text as output. Therefore, this algorithm stands as one of the strongest tools for information security. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cipher%20text" title="cipher text">cipher text</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography" title=" cryptography"> cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=plaintext" title=" plaintext"> plaintext</a>, <a href="https://publications.waset.org/abstracts/search?q=raaga" title=" raaga"> raaga</a> </p> <a href="https://publications.waset.org/abstracts/50374/symmetric-key-encryption-algorithm-using-indian-traditional-musical-scale-for-information-security" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50374.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">289</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1045</span> Reduction of Dynamic Influences in Composite Rubber-Concrete Block Designed to Walls Construction </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Maciej%20Major">Maciej Major</a>, <a href="https://publications.waset.org/abstracts/search?q=Izabela%20Major"> Izabela Major</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The aim of this paper is a numerical analysis of three-layered block design to walls construction subjected to the dynamic load. The block consists of the layers: concrete with rubber pads in shape of crosses, space filled with air and concrete with I-shape rubber pads. The main purpose of rubber inserts embedded during the production process is additional protection against the transversal dynamic load. For the analysis, as rubber, the Zahorski hyperelastic incompressible material model was assumed. A concentrated force as dynamic load applied to the external block surface was investigated. The results for the considered block observed as the stress distribution plot were compared to the results obtained for the solid concrete block. In order to estimate the percentage damping of proposed composite, rubber-concrete block in relation to the solid block the numerical analysis with the use of finite element method based on ADINA software was performed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dynamics" title="dynamics">dynamics</a>, <a href="https://publications.waset.org/abstracts/search?q=composite" title=" composite"> composite</a>, <a href="https://publications.waset.org/abstracts/search?q=rubber" title=" rubber"> rubber</a>, <a href="https://publications.waset.org/abstracts/search?q=Zahorski" title=" Zahorski"> Zahorski</a> </p> <a href="https://publications.waset.org/abstracts/81851/reduction-of-dynamic-influences-in-composite-rubber-concrete-block-designed-to-walls-construction" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/81851.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">241</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">1044</span> Generation of Photo-Mosaic Images through Block Matching and Color Adjustment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hae-Yeoun%20Lee">Hae-Yeoun Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Mosaic refers to a technique that makes image by gathering lots of small materials in various colours. This paper presents an automatic algorithm that makes the photomosaic image using photos. The algorithm is composed of four steps: Partition and feature extraction, block matching, redundancy removal and colour adjustment. The input image is partitioned in the small block to extract feature. Each block is matched to find similar photo in database by comparing similarity with Euclidean difference between blocks. The intensity of the block is adjusted to enhance the similarity of image by replacing the value of light and darkness with that of relevant block. Further, the quality of image is improved by minimizing the redundancy of tiles in the adjacent blocks. Experimental results support that the proposed algorithm is excellent in quantitative analysis and qualitative analysis. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=photomosaic" title="photomosaic">photomosaic</a>, <a href="https://publications.waset.org/abstracts/search?q=Euclidean%20distance" title=" Euclidean distance"> Euclidean distance</a>, <a href="https://publications.waset.org/abstracts/search?q=block%20matching" title=" block matching"> block matching</a>, <a href="https://publications.waset.org/abstracts/search?q=intensity%20adjustment" title=" intensity adjustment"> intensity adjustment</a> </p> <a href="https://publications.waset.org/abstracts/7022/generation-of-photo-mosaic-images-through-block-matching-and-color-adjustment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/7022.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">279</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">1043</span> The Study on Blast Effect of Polymer Gel by Trazul Lead Block Test and Concrete Block Test</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Young-Hun%20Ko">Young-Hun Ko</a>, <a href="https://publications.waset.org/abstracts/search?q=Seung-Jun%20Kim"> Seung-Jun Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Khaqan%20Baluch"> Khaqan Baluch</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyung-%20Sik%20Yang"> Hyung- Sik Yang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, the polymer gel was used as coupling material in a blasting hole and its comparison was made with other coupling materials like sand, water, and air. Trazul lead block test and AUTODYN numerical analysis were conducted to analyze the effects of the coupling materials on the intensity of the explosion, as well as the verification tests were conducted by using concrete block test. The emulsion explosives were used in decoupling conditions, sand, water, and polymer gel were used as the coupling materials. The lead block test and the numerical analysis showed that the expansion of the blast hole in the lead block was similar to that of the water and gelatin and followed by sand and air conditions. The validation of concrete block test result showed the similar result as Trazul lead block test and the explosion strength was measured at 0.8 for polymer gel, 0.7 for sand, and 0.6 for no coupling material, in comparison to the full charge (1.0) case. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Trazul%20lead%20block%20test" title="Trazul lead block test">Trazul lead block test</a>, <a href="https://publications.waset.org/abstracts/search?q=AUTODYN%20numerical%20analysis" title=" AUTODYN numerical analysis"> AUTODYN numerical analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=coupling%20material" title=" coupling material"> coupling material</a>, <a href="https://publications.waset.org/abstracts/search?q=polymer%20gel" title=" polymer gel"> polymer gel</a>, <a href="https://publications.waset.org/abstracts/search?q=soil%20covering%20concrete%20block%20explosion%20test" title=" soil covering concrete block explosion test "> soil covering concrete block explosion test </a> </p> <a href="https://publications.waset.org/abstracts/89043/the-study-on-blast-effect-of-polymer-gel-by-trazul-lead-block-test-and-concrete-block-test" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/89043.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">300</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">1042</span> The Development of a New Block Method for Solving Stiff ODEs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Khairil%20I.%20Othman">Khairil I. Othman</a>, <a href="https://publications.waset.org/abstracts/search?q=Mahfuzah%20Mahayaddin"> Mahfuzah Mahayaddin</a>, <a href="https://publications.waset.org/abstracts/search?q=Zarina%20Bibi%20Ibrahim"> Zarina Bibi Ibrahim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We develop and demonstrate a computationally efficient numerical technique to solve first order stiff differential equations. This technique is based on block method whereby three approximate points are calculated. The Cholistani of varied step sizes are presented in divided difference form. Stability regions of the formulae are briefly discussed in this paper. Numerical results show that this block method perform very well compared to existing methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=block%20method" title="block method">block method</a>, <a href="https://publications.waset.org/abstracts/search?q=divided%20difference" title=" divided difference"> divided difference</a>, <a href="https://publications.waset.org/abstracts/search?q=stiff" title=" stiff"> stiff</a>, <a href="https://publications.waset.org/abstracts/search?q=computational" title=" computational"> computational</a> </p> <a href="https://publications.waset.org/abstracts/4999/the-development-of-a-new-block-method-for-solving-stiff-odes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/4999.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">430</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">1041</span> Pattern in Splitting Sequence in Okike’s Merged Irregular Transposition Cipher for Encrypting Cyberspace Messages</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Okike%20Benjamin">Okike Benjamin</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20J.%20D.%20Garba"> E. J. D. Garba </a> </p> <p class="card-text"><strong>Abstract:</strong></p> The protection of sensitive information against unauthorized access or fraudulent changes has been of prime concern throughout the centuries. Modern communication techniques, using computers connected through networks, make all data even more vulnerable to these threats. The researchers in this work propose a new encryption technique to be known as Merged Irregular Transposition Cipher. In this proposed encryption technique, a message to be encrypted will first of all be split into multiple parts depending on the length of the message. After the split, different keywords are chosen to encrypt different parts of the message. After encrypting all parts of the message, the positions of the encrypted message could be swapped to other position thereby making it very difficult to decrypt by any unauthorized user. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=information%20security" title="information security">information security</a>, <a href="https://publications.waset.org/abstracts/search?q=message%20splitting" title=" message splitting"> message splitting</a>, <a href="https://publications.waset.org/abstracts/search?q=pattern" title=" pattern"> pattern</a>, <a href="https://publications.waset.org/abstracts/search?q=sequence" title=" sequence "> sequence </a> </p> <a href="https://publications.waset.org/abstracts/22633/pattern-in-splitting-sequence-in-okikes-merged-irregular-transposition-cipher-for-encrypting-cyberspace-messages" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/22633.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">289</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1040</span> Modification of Newton Method in Two Points Block Differentiation Formula</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Khairil%20Iskandar%20Othman">Khairil Iskandar Othman</a>, <a href="https://publications.waset.org/abstracts/search?q=Nadhirah%20Kamal"> Nadhirah Kamal</a>, <a href="https://publications.waset.org/abstracts/search?q=Zarina%20Bibi%20Ibrahim"> Zarina Bibi Ibrahim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Block methods for solving stiff systems of ordinary differential equations (ODEs) are based on backward differential formulas (BDF) with PE(CE)2 and Newton method. In this paper, we introduce Modified Newton as a new strategy to get more efficient result. The derivation of BBDF using modified block Newton method is presented. This new block method with predictor-corrector gives more accurate result when compared to the existing BBDF. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=modified%20Newton" title="modified Newton">modified Newton</a>, <a href="https://publications.waset.org/abstracts/search?q=stiff" title=" stiff"> stiff</a>, <a href="https://publications.waset.org/abstracts/search?q=BBDF" title=" BBDF"> BBDF</a>, <a href="https://publications.waset.org/abstracts/search?q=Jacobian%20matrix" title=" Jacobian matrix"> Jacobian matrix</a> </p> <a href="https://publications.waset.org/abstracts/54758/modification-of-newton-method-in-two-points-block-differentiation-formula" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/54758.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">378</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">1039</span> On a Continuous Formulation of Block Method for Solving First Order Ordinary Differential Equations (ODEs)</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20M.%20Sagir">A. M. Sagir</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The aim of this paper is to investigate the performance of the developed linear multistep block method for solving first order initial value problem of Ordinary Differential Equations (ODEs). The method calculates the numerical solution at three points simultaneously and produces three new equally spaced solution values within a block. The continuous formulations enable us to differentiate and evaluate at some selected points to obtain three discrete schemes, which were used in block form for parallel or sequential solutions of the problems. A stability analysis and efficiency of the block method are tested on ordinary differential equations involving practical applications, and the results obtained compared favorably with the exact solution. Furthermore, comparison of error analysis has been developed with the help of computer software. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=block%20method" title="block method">block method</a>, <a href="https://publications.waset.org/abstracts/search?q=first%20order%20ordinary%20differential%20equations" title=" first order ordinary differential equations"> first order ordinary differential equations</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20multistep" title=" linear multistep"> linear multistep</a>, <a href="https://publications.waset.org/abstracts/search?q=self-starting" title=" self-starting"> self-starting</a> </p> <a href="https://publications.waset.org/abstracts/3622/on-a-continuous-formulation-of-block-method-for-solving-first-order-ordinary-differential-equations-odes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3622.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">306</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">1038</span> On Block Vandermonde Matrix Constructed from Matrix Polynomial Solvents</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Malika%20Yaici">Malika Yaici</a>, <a href="https://publications.waset.org/abstracts/search?q=Kamel%20Hariche"> Kamel Hariche</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In control engineering, systems described by matrix fractions are studied through properties of block roots, also called solvents. These solvents are usually dealt with in a block Vandermonde matrix form. Inverses and determinants of Vandermonde matrices and block Vandermonde matrices are used in solving problems of numerical analysis in many domains but require costly computations. Even though Vandermonde matrices are well known and method to compute inverse and determinants are many and, generally, based on interpolation techniques, methods to compute the inverse and determinant of a block Vandermonde matrix have not been well studied. In this paper, some properties of these matrices and iterative algorithms to compute the determinant and the inverse of a block Vandermonde matrix are given. These methods are deducted from the partitioned matrix inversion and determinant computing methods. Due to their great size, parallelization may be a solution to reduce the computations cost, so a parallelization of these algorithms is proposed and validated by a comparison using algorithmic complexity. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=block%20vandermonde%20matrix" title="block vandermonde matrix">block vandermonde matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=solvents" title=" solvents"> solvents</a>, <a href="https://publications.waset.org/abstracts/search?q=matrix%20polynomial" title=" matrix polynomial"> matrix polynomial</a>, <a href="https://publications.waset.org/abstracts/search?q=matrix%20inverse" title=" matrix inverse"> matrix inverse</a>, <a href="https://publications.waset.org/abstracts/search?q=matrix%20determinant" title=" matrix determinant"> matrix determinant</a>, <a href="https://publications.waset.org/abstracts/search?q=parallelization" title=" parallelization"> parallelization</a> </p> <a href="https://publications.waset.org/abstracts/89115/on-block-vandermonde-matrix-constructed-from-matrix-polynomial-solvents" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/89115.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">240</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">1037</span> Implementation of Complete Management Practices in Managing the Cocoa Pod Borer</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=B.%20Saripah">B. Saripah</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Alias"> A. Alias </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cocoa Theobroma cacao (Linnaeus) (Malvales: Sterculiaceae) is subjected to be infested by various numbers of insect pests, and Conopomorpha cramerella Snellen (Lepidoptera: Gracillariidae) is the most serious pest of cocoa in Malaysia. The pest was indigenous to the South East Asia. Several control measures have been implemented and the chemicals have been a major approach if not unilateral, in the management of CPB. Despite extensive use of insecticides, CPB continues to cause an unacceptable level of damage; thus, the combination of several control approaches should be sought. The study was commenced for 12 months at three blocks; Block 18C with complete management practices which include insecticide application, pruning, fertilization and frequent harvesting, Block 17C was treated with frequent harvesting at intervals of 7-8 days, and Block 19C was served as control block. The results showed that the mean numbers of CPB eggs were recorded higher in Block 17C compared with Block 18C in all sampling occasions. Block 18C shows the lowest mean number of CPB eggs in both sampling plots, outside and core plots and it was found significantly different (p ≤ 0. 05) compared to the other blocks. The mean number of CPB eggs was fluctuated throughout sampling occasions, the lowest mean number of eggs was recorded in January (17C) and November (18C), while the highest was recorded in April (17C) and December 2012 (18C). Frequent spraying with insecticides at the adjacent block (18C) helps in reducing CPB eggs in the control block (Block 19C), although there was no spraying was implemented Block 19C. In summary, the combination of complete management practices at Block 18C seems to have some effect on the CPB population at Blocks 17 and 19C because all blocks are adjacent to each other. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cocoa" title="cocoa">cocoa</a>, <a href="https://publications.waset.org/abstracts/search?q=theobroma%20cacao" title=" theobroma cacao"> theobroma cacao</a>, <a href="https://publications.waset.org/abstracts/search?q=cocoa%20pod%20borer" title=" cocoa pod borer"> cocoa pod borer</a>, <a href="https://publications.waset.org/abstracts/search?q=conopomorpha%20cramerella" title=" conopomorpha cramerella"> conopomorpha cramerella</a> </p> <a href="https://publications.waset.org/abstracts/29722/implementation-of-complete-management-practices-in-managing-the-cocoa-pod-borer" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29722.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">445</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1036</span> Numerical Treatment of Block Method for the Solution of Ordinary Differential Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20M.%20Sagir">A. M. Sagir</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Discrete linear multistep block method of uniform order for the solution of first order Initial Value Problems (IVPs) in Ordinary Differential Equations (ODEs) is presented in this paper. The approach of interpolation and collocation approximation are adopted in the derivation of the method which is then applied to first order ordinary differential equations with associated initial conditions. The continuous hybrid formulations enable us to differentiate and evaluate at some grids and off – grid points to obtain four discrete schemes, which were used in block form for parallel or sequential solutions of the problems. Furthermore, a stability analysis and efficiency of the block method are tested on ordinary differential equations, and the results obtained compared favorably with the exact solution. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=block%20method" title="block method">block method</a>, <a href="https://publications.waset.org/abstracts/search?q=first%20order%20ordinary%20differential%20equations" title=" first order ordinary differential equations"> first order ordinary differential equations</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid" title=" hybrid"> hybrid</a>, <a href="https://publications.waset.org/abstracts/search?q=self-starting" title=" self-starting "> self-starting </a> </p> <a href="https://publications.waset.org/abstracts/3426/numerical-treatment-of-block-method-for-the-solution-of-ordinary-differential-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3426.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">482</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1035</span> Research on Residential Block Fabric: A Case Study of Hangzhou West Area</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wang%20Ye">Wang Ye</a>, <a href="https://publications.waset.org/abstracts/search?q=Wei%20Wei"> Wei Wei</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Residential block construction of big cities in China began in the 1950s, and four models had far-reaching influence on modern residential block in its development process, including unit compound and residential district in 1950s to 1980s, and gated community and open community in 1990s to now. Based on analysis of the four models’ fabric, the article takes residential blocks in Hangzhou west area as an example and carries on the studies from urban structure level and block special level, mainly including urban road network, land use, community function, road organization, public space and building fabric. At last, the article puts forward semi-open sub-community strategy to improve the current fabric. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hangzhou%20west%20area" title="Hangzhou west area">Hangzhou west area</a>, <a href="https://publications.waset.org/abstracts/search?q=residential%20block%20model" title=" residential block model"> residential block model</a>, <a href="https://publications.waset.org/abstracts/search?q=residential%20block%20fabric" title=" residential block fabric"> residential block fabric</a>, <a href="https://publications.waset.org/abstracts/search?q=semi-open%20sub-community%20strategy" title=" semi-open sub-community strategy"> semi-open sub-community strategy</a> </p> <a href="https://publications.waset.org/abstracts/3762/research-on-residential-block-fabric-a-case-study-of-hangzhou-west-area" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3762.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">417</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=block%20cipher&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=block%20cipher&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=block%20cipher&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=block%20cipher&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=block%20cipher&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=block%20cipher&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=block%20cipher&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=block%20cipher&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=block%20cipher&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=block%20cipher&page=35">35</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=block%20cipher&page=36">36</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=block%20cipher&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>