This paper proposes a new block cipher termed as “Modular Arithmetic based Block Cipher with Varying Key-Spaces (MABCVK)” that uses private key-spaces of varying lengths to encrypt data files. There is a simple but intelligent use of theory of modular arithmetic in the scheme of the cipher. Based on observed implementation of the proposed cipher on a set of real data files of several types, all...

An iterated block cipher can be regarded as a means of producing a set of permutations of a message space. Some properties of the group generated by the round functions of such a cipher are known to be of cryptanalytic interest. It is shown here that if this group acts imprimitively on the message space then there is an exploitable weakness in the cipher. It is demonstrated that a weakness of t...

A new hash function HeW: A hash function based on light weight block cipher FeW is proposed in this paper. The compression function of HeW is based on block cipher FeW. It is believed that key expansion algorithm of block cipher slows down the performance of the overlying hash function. Thereby, block ciphers become a less favourable choice to design a compression function. As a countermeasure,...

In this article, we propose a new method to protect block cipher implementations against Differential Fault Attacks (DFA). Our strategy, so-called “Tweak-in-Plaintext”, ensures that an uncontrolled value (‘tweak-in’) is inserted into some part of the block cipher plaintext, thus effectively rendering DFA much harder to perform. Our method is extremely simple yet presents many advantages when co...

We propose a block-cipher mode of operation, EAX, for authenticated-encryption with associateddata (AEAD). Given a nonce N , a message M , and a header H, the mode protects the privacy of M and the authenticity of both M and H. Strings N, M, H E {0, 1} are arbitrary, and the mode uses 2→M/n∈ + →H/n∈ + →N/n∈ block-cipher calls when these strings are nonempty and n is the block length of the unde...

An AES-like lightweight block cipher, namely Zorro, was proposed in CHES 2013. While it has a 16-byte state, it uses only 4 S-Boxes per round. This weak nonlinearity was widely criticized, insofar as it has been directly exploited in all the attacks on Zorro reported by now, including the weak key, reduced round, and even full round attacks. In this paper, using some properties discovered by Wa...

We propose a block-cipher mode of operation, EAX, for solving the problem of authenticated-encryption with associated-data (AEAD). Given a nonce N , a message M , and a header H , our mode protects the privacy of M and the authenticity of bothM andH . StringsN ,M , andH are arbitrary bit strings, and the mode uses 2djM j=ne + djHj=ne + djN j=ne block-cipher calls when these strings are nonempty...

block ciphers have wide applications for hardware and software implementations. in this paper, a new block cipher algorithm with provable security is proposed. the whole structure of the algorithm is novel and has a good encryption and decryption performance. additionally, it has good security with few number of rounds. the structure of the proposed algorithm consists of 4-rounds feistel-like w...

Input Output Chaining (IOC) is an authenticated encryption (AE) mode that can be used with any block cipher. IOC main interest is that each message block is ciphered just once, as when only implementing confidentiality, while the added complexity by the accompanying integrity service is negligible. The core integrity concept in IOC is based on a novel, minimal and appealing chaining mechanism a...