Traditional Serial-Serial multiplier addresses the high data sampling rate. It is effectively considered as the entire partial product matrix with n data sampling cycle for n×n multiplication function instead of 2n cycles in the conventional multipliers. The existing Serial-Serial multiplier is the first bit serial structure. Newly developed serial-serial multiplier design is capable of process...

We present a new type of differential that is particularly suited to analyzing ciphers that use modular multiplication as a primitive operation. These differentials are partially inspired by the differential used to break Nimbus, and we generalize that result. We use these differentials to break the MultiSwap cipher that is part of the Microsoft Digital Rights Management subsystem, to derive a ...

let $r$ be a right artinian ring or a perfect commutative‎‎ring‎. ‎let $m$ be a noncosingular self-generator $sum$-lifting‎‎module‎. ‎then $m$ has a direct decomposition $m=oplus_{iin i} m_i$‎,‎where each $m_i$ is noetherian quasi-projective and each‎‎endomorphism ring $end(m_i)$ is local‎.

The incidence algebra of a partially ordered set (poset) supports in a natural way also a coalgebra structure, so that it becomes a m-weak bialgebra even a m-weak Hopf algebra with Möbius function as antipode. Here mweak means that multiplication and comultiplication are not required to be coalgebraor algebra-morphisms, respectively. A rich theory is obtained in computing modulo an equivalence ...

We suggest a programming realization of an algorithm for a verification of a given set of algebraic relations in the form of a supercommutator multiplication table for the Verma module, which is constructed according to a generalized Cartan procedure for a quadratic superalgebra and whose elements are realized as a formal power series with respect to noncommuting elements. To this end, we propo...

We find the universal module w(M) for functions (that need not be invariants) of finite matroids, defined on a minor-closed class M and with values in any module L over any commutative and unitary ring, that satisfy a parametrized deletion-contraction identity, F (M) = δeF (M r e) + γeF (M/e), when e is neither a loop nor a coloop. (F is called a (parametrized) weak Tutte function.) Within the ...

This paper explores the implications of integrating flexible module generation into a compiler for FPGAs. The objective is to improve the programmability of FPGAs, or in other words, the productivity of the FPGA programmer. We describe (1) the module generation library PAM-Blox II, the second generation of object-oriented module generators in C++, targeted at computing with FPGAs, and (2) examp...