Showing papers on "Two-square cipher published in 2018"
TL;DR: This work proposes POEx, a beyond-birthday-bound-secure on-line cipher which employs one call to a tweakable block cipher and onecall to a 2n-bit universal hash function per message block which builds upon the recently proposed XTX tweak extender by Iwata and Minematsu.
Abstract: On-line ciphers are convenient building blocks for realizing efficient single- pass encryption. In particular, the trend to limit the consequences of nonce reuses rendered them popular in recent authenticated encryption schemes. While encryption schemes, such as POE, COPE, or the ciphers within ElmE/ElmD concentrated on efficiency, their security guarantees and that of all earlier on-line ciphers is limited by the birthday bound, and so are those of the AE schemes built upon them. This work proposes POEx, a beyond-birthday-bound-secure on-line cipher which employs one call to a tweakable block cipher and one call to a 2n-bit universal hash function per message block. POEx builds upon the recently proposed XTX tweak extender by Iwata and Minematsu. We prove the security of our construction and discuss possible instantiations.
10 citations
1 Mar 2018
TL;DR: The objective is to show that ElGamal algorithm and Double Playfair algorithms are capable to encrypt an image file with an acceptable running time and encrypted file size while maintaining the level of security.
Abstract: In this paper, we present an implementation of an image file encryption using hybrid cryptography. We chose ElGamal algorithm to perform asymmetric encryption and Double Playfair for the symmetric encryption. Our objective is to show that these algorithms are capable to encrypt an image file with an acceptable running time and encrypted file size while maintaining the level of security. The application was built using C# programming language and ran as a stand alone desktop application under Windows Operating System. Our test shows that the system is capable to encrypt an image with a resolution of 500×500 to a size of 976 kilobytes with an acceptable running time.
9 citations
8 Oct 2018
TL;DR: This study modifies the classical Caesar cipher technique by incorporating randomized approaches to enhance security, dividing plain text into five-word groups, and rearranging letters without spaces, improving encryption strength.
Abstract: Cryptography is about constructing and analyzing protocol that prevents third parties or the publi c from reading private messages. There are two techniques for converting data into no readable form:1) Transposition technique 2) Substitution technique. Caesar cipher is an example of substitution method. Caesar cipher has various limitations. In this pa per we have focused on the well known Caesar cipher techniques. Here in this paper our aim was to induce some strength to the Caesar cipher encryption technique. This proposed technique blended classical encryption with the some more techniques and This me thod is better in terms of providing more security for any given text message. In our experiments we took Caesar Ciphers as reference of Classical Techniques. To make it more secure we have used some techniques like we have divided the given plain text in five word group each. With the given key rearrange the group of letters without giving the space https://www.ijiert.org/paper-details?paper_id=141194