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: transposition cipher</title> <meta name="description" content="Search results for: transposition cipher"> <meta name="keywords" content="transposition 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="transposition 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="transposition 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> 57</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: transposition cipher</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">57</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">56</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">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">55</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">54</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">287</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">53</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">52</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">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">51</span> DCT and Stream Ciphers for Improved Image Encryption Mechanism </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=T.%20R.%20Sharika">T. R. Sharika</a>, <a href="https://publications.waset.org/abstracts/search?q=Ashwini%20Kumar"> Ashwini Kumar</a>, <a href="https://publications.waset.org/abstracts/search?q=Kamal%20Bijlani"> Kamal Bijlani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Encryption is the process of converting crucial information’s unreadable to unauthorized persons. Image security is an important type of encryption that secures all type of images from cryptanalysis. A stream cipher is a fast symmetric key algorithm which is used to convert plaintext to cipher text. In this paper we are proposing an image encryption algorithm with Discrete Cosine Transform and Stream Ciphers that can improve compression of images and enhanced security. The paper also explains the use of a shuffling algorithm for enhancing securing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=decryption" title="decryption">decryption</a>, <a href="https://publications.waset.org/abstracts/search?q=DCT" title=" DCT"> DCT</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=RC4%20cipher" title=" RC4 cipher"> RC4 cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=stream%20cipher" title=" stream cipher"> stream cipher</a> </p> <a href="https://publications.waset.org/abstracts/32780/dct-and-stream-ciphers-for-improved-image-encryption-mechanism" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32780.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">361</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">50</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">356</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">49</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">48</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">84</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">47</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">46</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">45</span> Learning to Teach in Large Classrooms: Training Faculty Members from Milano Bicocca University, from Didactic Transposition to Communication Skills</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=E.%20Nigris">E. Nigris</a>, <a href="https://publications.waset.org/abstracts/search?q=F.%20Passalacqua"> F. Passalacqua</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Relating to the recent researches in the field of faculty development, this paper aims to present a pilot training programme realized at the University of Milano-Bicocca to improve teaching skills of faculty members. A total of 57 professors (both full professors and associate professors) were trained during the pilot programme in three editions of the workshop, focused on promoting skills for teaching large classes. The study takes into account: 1) the theoretical framework of the programme which combines the recent tradition about professional development and the research on in-service training of school teachers; 2) the structure and the content of the training programme, organized in a 12 hours-full immersion workshop and in individual consultations; 3) the educational specificity of the training programme which is based on the relation between 'general didactic' (active learning metholodies; didactic communication) and 'disciplinary didactics' (didactic transposition and reconstruction); 4) results about the impact of the training programme, both related to the workshop and the individual consultations. This study aims to provide insights mainly on two levels of the training program’s impact ('behaviour change' and 'transfer') and for this reason learning outcomes are evaluated by different instruments: a questionnaire filled out by all 57 participants; 12 in-depth interviews; 3 focus groups; conversation transcriptions of workshop activities. Data analysis is based on a descriptive qualitative approach and it is conducted through thematic analysis of the transcripts using analytical categories derived principally from the didactic transposition theory. The results show that the training programme developed effectively three major skills regarding different stages of the 'didactic transposition' process: a) the content selection; a more accurated selection and reduction of the 'scholarly knowledge', conforming to the first stage of the didactic transposition process; b) the consideration of students’ prior knowledge and misconceptions within the lesson design, in order to connect effectively the 'scholarly knowledge' to the 'knowledge to be taught' (second stage of the didactic transposition process); c) the way of asking questions and managing discussion in large classrooms, in line with the transformation of the 'knowledge to be taught' in 'taught knowledge' (third stage of the didactic transposition process). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=didactic%20communication" title="didactic communication">didactic communication</a>, <a href="https://publications.waset.org/abstracts/search?q=didactic%20transposition" title=" didactic transposition"> didactic transposition</a>, <a href="https://publications.waset.org/abstracts/search?q=instructional%20development" title=" instructional development"> instructional development</a>, <a href="https://publications.waset.org/abstracts/search?q=teaching%20large%20classroom" title=" teaching large classroom"> teaching large classroom</a> </p> <a href="https://publications.waset.org/abstracts/94344/learning-to-teach-in-large-classrooms-training-faculty-members-from-milano-bicocca-university-from-didactic-transposition-to-communication-skills" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/94344.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> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">44</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">43</span> The Didactic Transposition in Brazilian High School Physics Textbooks: A Comparative Study of Didactic Materials</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Leandro%20Marcos%20Alves%20Vaz">Leandro Marcos Alves Vaz</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this article, we analyze the different approaches to the topic Magnetism of Matter in physics textbooks of Brazilian schools. For this, we compared the approach to the concepts of the magnetic characteristics of materials (diamagnetism, paramagnetism, ferromagnetism and antiferromagnetism) in different sources of information and in different levels of education, from Higher Education to High School. In this sense, we used as reference the theory of the Didactic Transposition of Yves Chevallard, a French educational theorist, who conceived in his theory three types of knowledge – Scholarly Knowledge, Knowledge to be taught and Taught Knowledge – related to teaching practice. As a research methodology, from the reading of the works used in teacher training and those destined to basic education students, we compared the treatment of a higher education physics book, a scientific article published in a Brazilian journal of the educational area, and four high school textbooks, in order to establish in which there is a greater or lesser degree of approximation with the knowledge produced by the scholars – scholarly knowledge – or even with the knowledge to be taught (to that found in books intended for teaching). Thus, we evaluated the level of proximity of the subjects conveyed in high school and higher education, as well as the relevance that some textbook authors give to the theme. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Brazilian%20physics%20books" title="Brazilian physics books">Brazilian physics books</a>, <a href="https://publications.waset.org/abstracts/search?q=didactic%20transposition" title=" didactic transposition"> didactic transposition</a>, <a href="https://publications.waset.org/abstracts/search?q=magnetism%20of%20matter" title=" magnetism of matter"> magnetism of matter</a>, <a href="https://publications.waset.org/abstracts/search?q=teaching%20of%20physics" title=" teaching of physics"> teaching of physics</a> </p> <a href="https://publications.waset.org/abstracts/68437/the-didactic-transposition-in-brazilian-high-school-physics-textbooks-a-comparative-study-of-didactic-materials" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/68437.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">297</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">42</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">41</span> Madame Bovary in Transit: from Novel to Graphic Novel</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hania%20Pasandi">Hania Pasandi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Since its publication in 1856, Madame Bovary has established itself as one of the most adapted texts of French literature. Some eighteen film adaptations and twenty-seven rewritings of Madame Bovary in fiction to date shows a great enthusiasm for recreating Flaubert’s masterpiece in a variety of mediums. Posy Simmonds’ 1999 graphic novel, Gemma Bovery stands out among these adaptations as the graphic novel with its visual and narrative structure offers a new reading experience of Madame Bovary, while combining Emma Bovary’s elements with contemporary social, cultural, and artistic discourses. This paper studies the transposition of Flaubert’s Madame Bovary (1857) to late twentieth-century Britain in Posy Simmonds’ 1999 graphic novel, Gemma Bovery by exploring how it borrows the essential flaubertian themes, from its source text to incorporate it with contemporary cultural trends. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=graphic%20novel" title="graphic novel">graphic novel</a>, <a href="https://publications.waset.org/abstracts/search?q=Gemma%20Bovery" title=" Gemma Bovery"> Gemma Bovery</a>, <a href="https://publications.waset.org/abstracts/search?q=Madame%20Bovary" title=" Madame Bovary"> Madame Bovary</a>, <a href="https://publications.waset.org/abstracts/search?q=transposition" title=" transposition"> transposition</a> </p> <a href="https://publications.waset.org/abstracts/129063/madame-bovary-in-transit-from-novel-to-graphic-novel" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/129063.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">153</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">40</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">39</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">38</span> A Method and System for Secure Authentication Using One Time QR Code</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Divyans%20Mahansaria">Divyans Mahansaria</a> </p> <p class="card-text"><strong>Abstract:</strong></p> User authentication is an important security measure for protecting confidential data and systems. However, the vulnerability while authenticating into a system has significantly increased. Thus, necessary mechanisms must be deployed during the process of authenticating a user to safeguard him/her from the vulnerable attacks. The proposed solution implements a novel authentication mechanism to counter various forms of security breach attacks including phishing, Trojan horse, replay, key logging, Asterisk logging, shoulder surfing, brute force search and others. QR code (Quick Response Code) is a type of matrix barcode or two-dimensional barcode that can be used for storing URLs, text, images and other information. In the proposed solution, during each new authentication request, a QR code is dynamically generated and presented to the user. A piece of generic information is mapped to plurality of elements and stored within the QR code. The mapping of generic information with plurality of elements, randomizes in each new login, and thus the QR code generated for each new authentication request is for one-time use only. In order to authenticate into the system, the user needs to decode the QR code using any QR code decoding software. The QR code decoding software needs to be installed on handheld mobile devices such as smartphones, personal digital assistant (PDA), etc. On decoding the QR code, the user will be presented a mapping between the generic piece of information and plurality of elements using which the user needs to derive cipher secret information corresponding to his/her actual password. Now, in place of the actual password, the user will use this cipher secret information to authenticate into the system. The authentication terminal will receive the cipher secret information and use a validation engine that will decipher the cipher secret information. If the entered secret information is correct, the user will be provided access to the system. Usability study has been carried out on the proposed solution, and the new authentication mechanism was found to be easy to learn and adapt. Mathematical analysis of the time taken to carry out brute force attack on the proposed solution has been carried out. The result of mathematical analysis showed that the solution is almost completely resistant to brute force attack. Today’s standard methods for authentication are subject to a wide variety of software, hardware, and human attacks. The proposed scheme can be very useful in controlling the various types of authentication related attacks especially in a networked computer environment where the use of username and password for authentication is common. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=authentication" title="authentication">authentication</a>, <a href="https://publications.waset.org/abstracts/search?q=QR%20code" title=" QR code"> QR code</a>, <a href="https://publications.waset.org/abstracts/search?q=cipher%20%2F%20decipher%20text" title=" cipher / decipher text"> cipher / decipher text</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=secret%20information" title=" secret information "> secret information </a> </p> <a href="https://publications.waset.org/abstracts/71171/a-method-and-system-for-secure-authentication-using-one-time-qr-code" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/71171.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">37</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">36</span> Anaesthetic Management of Congenitally Corrected Transposition of Great Arteries with Complete Heart Block in a Parturient for Emergency Caesarean Section</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lokvendra%20S.%20Budania">Lokvendra S. Budania</a>, <a href="https://publications.waset.org/abstracts/search?q=Yogesh%20K%20Gaude"> Yogesh K Gaude</a>, <a href="https://publications.waset.org/abstracts/search?q=Vamsidhar%20Chamala"> Vamsidhar Chamala </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Introduction: Congenitally corrected transposition of great arteries (CCTGA) is a complex congenital heart disease where there are both atrioventricular and ventriculoarterial discordances, usually accompanied by other cardiovascular malformations. Case Report: A 24-year-old primigravida known case of CCTGA at 37 weeks of gestation was referred to our hospital for safe delivery. Her electrocardiogram showed HR-40/pm, echocardiography showed Ejection Fraction of 65% and CCTGA. Temporary pacemaker was inserted by cardiologist in catheterization laboratory, before giving trial of labour in view of complete heart block. She was planned for normal delivery, but emergency Caesarean section was planned due to non-reassuring foetal Cardiotocography Pre-op vitals showed PR-50 bpm with temporary pacemaker, Blood pressure-110/70 mmHg, SpO2-99% on room air. Nil per oral was inadequate. Patency of two peripheral IV cannula checked and left radial arterial line secured. Epidural Anaesthesia was planned, and catheter was placed at L2-L3. Test dose was given, Anaesthesia was provided with 5ml + 5ml of 2% Lignocaine with 25 mcg Fentanyl and further 2.5Ml of 0.5% Bupivacaine was given to achieve a sensory level of T6. Cesarean section was performed and baby was delivered. Cautery was avoided during this procedure. IV Oxytocin (15U) was added to 500 mL of ringer’s lactate. Hypotension was treated with phenylephrine boluses. Patient was shifted to post-operative care unit and later to high dependency unit for monitoring. Post op vitals remained stable. Temporary pacemaker was removed after 24 hours of surgery. Her post-operative period was uneventful and discharged from hospital. Conclusion: Rare congenital cardiac disorders require detail knowledge of pathophysiology and associated comorbidities with the disease. Meticulously planned and carefully titrated neuraxial techniques will be beneficial for such cases. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=congenitally%20corrected%20transposition%20of%20great%20arteries" title="congenitally corrected transposition of great arteries">congenitally corrected transposition of great arteries</a>, <a href="https://publications.waset.org/abstracts/search?q=complete%20heart%20block" title=" complete heart block"> complete heart block</a>, <a href="https://publications.waset.org/abstracts/search?q=emergency%20LSCS" title=" emergency LSCS"> emergency LSCS</a>, <a href="https://publications.waset.org/abstracts/search?q=epidural%20anaesthesia" title=" epidural anaesthesia"> epidural anaesthesia</a> </p> <a href="https://publications.waset.org/abstracts/112325/anaesthetic-management-of-congenitally-corrected-transposition-of-great-arteries-with-complete-heart-block-in-a-parturient-for-emergency-caesarean-section" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/112325.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">35</span> Commercial Winding for Superconducting Cables and Magnets</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Glenn%20Auld%20Knierim">Glenn Auld Knierim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Automated robotic winding of high-temperature superconductors (HTS) addresses precision, efficiency, and reliability critical to the commercialization of products. Today’s HTS materials are mature and commercially promising but require manufacturing attention. In particular to the exaggerated rectangular cross-section (very thin by very wide), winding precision is critical to address the stress that can crack the fragile ceramic superconductor (SC) layer and destroy the SC properties. Damage potential is highest during peak operations, where winding stress magnifies operational stress. Another challenge is operational parameters such as magnetic field alignment affecting design performance. Winding process performance, including precision, capability for geometric complexity, and efficient repeatability, are required for commercial production of current HTS. Due to winding limitations, current HTS magnets focus on simple pancake configurations. HTS motors, generators, MRI/NMR, fusion, and other projects are awaiting robotic wound solenoid, planar, and spherical magnet configurations. As with conventional power cables, full transposition winding is required for long length alternating current (AC) and pulsed power cables. Robotic production is required for transposition, periodic swapping of cable conductors, and placing into precise positions, which allows power utility required minimized reactance. A full transposition SC cable, in theory, has no transmission length limits for AC and variable transient operation due to no resistance (a problem with conventional cables), negligible reactance (a problem for helical wound HTS cables), and no long length manufacturing issues (a problem with both stamped and twisted stacked HTS cables). The Infinity Physics team is solving manufacturing problems by developing automated manufacturing to produce the first-ever reliable and utility-grade commercial SC cables and magnets. Robotic winding machines combine mechanical and process design, specialized sense and observer, and state-of-the-art optimization and control sequencing to carefully manipulate individual fragile SCs, especially HTS, to shape previously unattainable, complex geometries with electrical geometry equivalent to commercially available conventional conductor devices. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=automated%20winding%20manufacturing" title="automated winding manufacturing">automated winding manufacturing</a>, <a href="https://publications.waset.org/abstracts/search?q=high%20temperature%20superconductor" title=" high temperature superconductor"> high temperature superconductor</a>, <a href="https://publications.waset.org/abstracts/search?q=magnet" title=" magnet"> magnet</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20cable" title=" power cable"> power cable</a> </p> <a href="https://publications.waset.org/abstracts/137346/commercial-winding-for-superconducting-cables-and-magnets" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/137346.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">140</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">34</span> Training to Evaluate Creative Activity in a Training Context, Analysis of a Learner Evaluation Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Massy%20Guillaume">Massy Guillaume</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Introduction: The implementation of creativity in educational policies or curricula raises several issues, including the evaluation of creativity and the means to do so. This doctoral research focuses on the appropriation and transposition of creativity assessment models by future teachers. Our objective is to identify the elements of the models that are most transferable to practice in order to improve their implementation in the students' curriculum while seeking to create a new model for assessing creativity in the school environment. Methods: In order to meet our objective, this preliminary quantitative exploratory study by questionnaire was conducted at two points in the participants' training: at the beginning of the training module and throughout the practical work. The population is composed of 40 people of diverse origins with an average age of 26 (s:8,623) years. In order to be as close as possible to our research objective and to test our questionnaires, we set up a pre-test phase during the spring semester of 2022. Results: The results presented focus on aspects of the OECD Creative Competencies Assessment Model. Overall, 72% of participants support the model's focus on skill levels as appropriate for the school context. More specifically, the data indicate that the separation of production and process in the rubric facilitates observation by the assessor. From the point of view of transposing the grid into teaching practice, the participants emphasised that production is easier to plan and observe in students than in the process. This difference is reinforced by a lack of knowledge about certain concepts such as innovation or risktaking in schools. Finally, the qualitative results indicate that the addition of multiple levels of competencies to the OECD rubric would allow for better implementation in the classroom. Conclusion: The identification by the students of the elements allowing the evaluation of creativity in the school environment generates an innovative approach to the training contents. These first data, from the test phase of our research, demonstrate the difficulty that exists between the implementation of an evaluation model in a training program and its potential transposition by future teachers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=creativity" title="creativity">creativity</a>, <a href="https://publications.waset.org/abstracts/search?q=evaluation" title=" evaluation"> evaluation</a>, <a href="https://publications.waset.org/abstracts/search?q=schooling" title=" schooling"> schooling</a>, <a href="https://publications.waset.org/abstracts/search?q=training" title=" training"> training</a> </p> <a href="https://publications.waset.org/abstracts/155400/training-to-evaluate-creative-activity-in-a-training-context-analysis-of-a-learner-evaluation-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/155400.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">95</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">33</span> Evolutionary Methods in Cryptography </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wafa%20Slaibi%20Alsharafat">Wafa Slaibi Alsharafat</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Genetic algorithms (GA) are random algorithms as random numbers that are generated during the operation of the algorithm determine what happens. This means that if GA is applied twice to optimize exactly the same problem it might produces two different answers. In this project, we propose an evolutionary algorithm and Genetic Algorithm (GA) to be implemented in symmetric encryption and decryption. Here, user's message and user secret information (key) which represent plain text to be transferred into cipher text. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=GA" title="GA">GA</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=decryption" title=" decryption"> decryption</a>, <a href="https://publications.waset.org/abstracts/search?q=crossover" title=" crossover"> crossover</a> </p> <a href="https://publications.waset.org/abstracts/21507/evolutionary-methods-in-cryptography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21507.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">445</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">32</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">31</span> Animated Poetry-Film: Poetry in Action</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Linette%20van%20der%20Merwe">Linette van der Merwe</a> </p> <p class="card-text"><strong>Abstract:</strong></p> It is known that visual artists, performing artists, and literary artists have inspired each other since time immemorial. The enduring, symbiotic relationship between the various art genres is evident where words, colours, lines, and sounds act as metaphors, a physical separation of the transcendental reality of art. Simonides of Keos (c. 556-468 BC) confirmed this, stating that a poem is a talking picture, or, in a more modern expression, a picture is worth a thousand words. It can be seen as an ancient relationship, originating from the epigram (tombstone or artefact inscriptions), the carmen figuratum (figure poem), and the ekphrasis (a description in the form of a poem of a work of art). Visual artists, including Michelangelo, Leonardo da Vinci, and Goethe, wrote poems and songs. Goya, Degas, and Picasso are famous for their works of art and for trying their hands at poetry. Afrikaans writers whose fine art is often published together with their writing, as in the case of Andries Bezuidenhout, Breyten Breytenbach, Sheila Cussons, Hennie Meyer, Carina Stander, and Johan van Wyk, among others, are not a strange phenomenon either. Imitating one art form into another art form is a form of translation, transposition, contemplation, and discovery of artistic impressions, showing parallel interpretations rather than physical comparison. It is especially about the harmony that exists between the different art genres, i.e., a poem that describes a painting or a visual text that portrays a poem that becomes a translation, interpretation, and rediscovery of the verbal text, or rather, from the word text to the image text. Poetry-film, as a form of such a translation of the word text into an image text, can be considered a hybrid, transdisciplinary art form that connects poetry and film. Poetry-film is regarded as an intertwined entity of word, sound, and visual image. It is an attempt to transpose and transform a poem into a new artwork that makes the poem more accessible to people who are not necessarily open to the written word and will, in effect, attract a larger audience to a genre that usually has a limited market. Poetry-film is considered a creative expression of an inverted ekphrastic inspiration, a visual description, interpretation, and expression of a poem. Research also emphasises that animated poetry-film is not widely regarded as a genre of anything and is thus severely under-theorized. This paper will focus on Afrikaans animated poetry-films as a multimodal transposition of a poem text to an animated poetry film, with specific reference to animated poetry-films in Filmverse I (2014) and Filmverse II (2016). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=poetry%20film" title="poetry film">poetry film</a>, <a href="https://publications.waset.org/abstracts/search?q=animated%20poetry%20film" title=" animated poetry film"> animated poetry film</a>, <a href="https://publications.waset.org/abstracts/search?q=poetic%20metaphor" title=" poetic metaphor"> poetic metaphor</a>, <a href="https://publications.waset.org/abstracts/search?q=conceptual%20metaphor" title=" conceptual metaphor"> conceptual metaphor</a>, <a href="https://publications.waset.org/abstracts/search?q=monomodal%20metaphor" title=" monomodal metaphor"> monomodal metaphor</a>, <a href="https://publications.waset.org/abstracts/search?q=multimodal%20metaphor" title=" multimodal metaphor"> multimodal metaphor</a>, <a href="https://publications.waset.org/abstracts/search?q=semiotic%20metaphor" title=" semiotic metaphor"> semiotic metaphor</a>, <a href="https://publications.waset.org/abstracts/search?q=multimodality" title=" multimodality"> multimodality</a>, <a href="https://publications.waset.org/abstracts/search?q=metaphor%20analysis" title=" metaphor analysis"> metaphor analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=target%20domain" title=" target domain"> target domain</a>, <a href="https://publications.waset.org/abstracts/search?q=source%20domain" title=" source domain"> source domain</a> </p> <a href="https://publications.waset.org/abstracts/166168/animated-poetry-film-poetry-in-action" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/166168.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">64</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> Efficient DCT Architectures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mr.%20P.%20Suryaprasad">Mr. P. Suryaprasad</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20Lalitha"> R. Lalitha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an efficient area and delay architectures for the implementation of one dimensional and two dimensional discrete cosine transform (DCT). These are supported to different lengths (4, 8, 16, and 32). DCT blocks are used in the different video coding standards for the image compression. The 2D- DCT calculation is made using the 2D-DCT separability property, such that the whole architecture is divided into two 1D-DCT calculations by using a transpose buffer. Based on the existing 1D-DCT architecture two different types of 2D-DCT architectures, folded and parallel types are implemented. Both of these two structures use the same transpose buffer. Proposed transpose buffer occupies less area and high speed than existing transpose buffer. Hence the area, low power and delay of both the 2D-DCT architectures are reduced. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=transposition%20buffer" title="transposition buffer">transposition buffer</a>, <a href="https://publications.waset.org/abstracts/search?q=video%20compression" title=" video compression"> video compression</a>, <a href="https://publications.waset.org/abstracts/search?q=discrete%20cosine%20transform" title=" discrete cosine transform"> discrete cosine transform</a>, <a href="https://publications.waset.org/abstracts/search?q=high%20efficiency%20video%20coding" title=" high efficiency video coding"> high efficiency video coding</a>, <a href="https://publications.waset.org/abstracts/search?q=two%20dimensional%20picture" title=" two dimensional picture"> two dimensional picture</a> </p> <a href="https://publications.waset.org/abstracts/33624/efficient-dct-architectures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33624.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">521</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> A Comparative Study of Series-Connected Two-Motor Drive Fed by a Single Inverter</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Djahbar">A. Djahbar</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20Bounadja"> E. Bounadja</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Zegaoui"> A. Zegaoui</a>, <a href="https://publications.waset.org/abstracts/search?q=H.%20Allouache"> H. Allouache</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, vector control of a series-connected two-machine drive system fed by a single inverter (CSI/VSI) is presented. The two stator windings of both machines are connected in series while the rotors may be connected to different loads, are called series-connected two-machine drive. Appropriate phase transposition is introduced while connecting the series stator winding to obtain decoupled control the two-machines. The dynamic decoupling of each machine from the group is obtained using the vector control algorithm. The independent control is demonstrated by analyzing the characteristics of torque and speed of each machine obtained via simulation under vector control scheme. The viability of the control techniques is proved using analytically and simulation approach. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=drives" title="drives">drives</a>, <a href="https://publications.waset.org/abstracts/search?q=inverter" title=" inverter"> inverter</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-phase%20induction%20machine" title=" multi-phase induction machine"> multi-phase induction machine</a>, <a href="https://publications.waset.org/abstracts/search?q=vector%20control" title=" vector control"> vector control</a> </p> <a href="https://publications.waset.org/abstracts/42943/a-comparative-study-of-series-connected-two-motor-drive-fed-by-a-single-inverter" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42943.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">480</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> Security Analysis and Implementation of Achterbahn-128 for Images Encryption</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aissa%20Belmeguenai">Aissa Belmeguenai</a>, <a href="https://publications.waset.org/abstracts/search?q=Oulaya%20Berrak"> Oulaya Berrak</a>, <a href="https://publications.waset.org/abstracts/search?q=Khaled%20Mansouri"> Khaled Mansouri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this work, efficiency implementation and security evaluation of the keystream generator of Achterbahn-128 for images encryption and decryption was introduced. The implementation for this simulated project is written with MATLAB.7.5. First of all, two different original images are used to validate the proposed design. The developed program is used to transform the original images data into digital image file. Finally, the proposed program is implemented to encrypt and decrypt images data. Several tests are done to prove the design performance, including visual tests and security evaluation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Achterbahn-128" title="Achterbahn-128">Achterbahn-128</a>, <a href="https://publications.waset.org/abstracts/search?q=keystream%20generator" title=" keystream generator"> keystream generator</a>, <a href="https://publications.waset.org/abstracts/search?q=stream%20cipher" title=" stream cipher"> stream cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20encryption" title=" image encryption"> image encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=security%20analysis" title=" security analysis"> security analysis</a> </p> <a href="https://publications.waset.org/abstracts/38107/security-analysis-and-implementation-of-achterbahn-128-for-images-encryption" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/38107.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">314</span> </span> </div> </div> <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=transposition%20cipher&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=transposition%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>