This paper presents a performance comparison of newly created matrix power function (MPF) based symmetric cipher realized in cipher-block chaining mode (CBC) with two other standardized ciphers namely AES-128 and triple DES. The encryption rate is compared using 64 bits arithmetic operations. It shown that the proposed has significant advantage against ciphers. achieved by consuming more memory...

uses a known decryption process to recover the sender’s original message. If Abstract: In this article, a new symmetric block cipher named MSEA is proposed. MSEA is based on ARX cryptographic design technique. MSEA is simple in nature due to the use of combinations of elementary operations like modular addition, bit-wise rotation and bit-wise XOR. In MSEA, plain text block, secret key, and numb...

Different adder circuits are elementary blocks in many contemporary integrated circuits, which are not only employed to perform addition operations, but also other arithmetic operations such as subtraction, multiplication and division. Full adder is the basic building block of any adder circuit. Area, speed and power are the three main design metrics for any VLSI circuit. In this work, eight di...

Algorithms are called cache oblivious, if they are designed to benefit from any kind of cache hierarchy—regardless of its size or number of cache levels. In linear algebra computations, block recursive approaches are a common approach that, by construction, lead to inherently local data access pattern, and thus to an overall good cache performance[3]. In this article, we present block recursive...

Efficient implementation of bit-level matrix transpose operations using a new family of perfect shuffle instructions in a word-based micro-processor architecture is investigated. Using a tensor representation of the perfect shuffle index mapping, we show how bit matrix of arbitrary size may be transposed using a minimal sequence of shuffle and pack instructions, and prove the correctness of the...

a typical iranian carbonate matrix block surrounded by an open fracture was modeled in order to understand the fracture-matrix interaction and realize how to model the interaction best. the modeling was carried out by using a fine-scaled eclipse model in the single porosity mode (the fractures were explicitly modeled). the model was extended to a stack of 6 matrix blocks to understand block-to-...

We show that an arbitrary Hankel matrix of a nite rank admits a Vandermonde decomposition: H = V T DV , where V is a con-uent Vandermonde matrix and D is a block diagonal matrix. This result was rst derived by Vandevoorde; our contribution here is a presentation that uses only linear algebra, speciically, the Jordan canonical form. We discuss the choices for computing this decomposition in only...