Abstract Can conjunctive propositions be identical without their conjuncts being identical? universally quantified instances On a common conception of propositions, on which they inherit the logical structure sentences express them, answer is negative both times. Here, it will shown that such to questions inconsistent, assuming standard type-theoretic formalization theorizing about propositions...

The masking countermeasure is an efficient method to protect cryptographic algorithms against Differential Power Analysis (DPA) and similar attacks. For symmetric cryptosystems, two techniques are commonly used: Boolean masking and arithmetic masking. Conversion methods have been proposed for switching from Boolean masking to arithmetic masking, and conversely. The way conversion is applied dep...

We present an approximate logarithmic multiplier with two-stage operand trimming, which prioritises area and energy consumption while retains acceptable accuracy. The trims the least significant parts of input operands in first stage mantissas obtained operands' approximations second stage. evaluated multiplier's efficiency terms error, energy, utilisation using NanGate 45nm. experimental resul...

In this paper, it is shown that every architecture proposed for modulo addition of operands that follow the diminished-1 representation can also be used in the design of modulo adders for operands that follow the weighted representation. This is achieved by the addition of a constant-time operator composed of a simplified carry-save adder stage. The experimental results indicate that many archi...

Several algorithms for Public Key Cryptography (PKC), such as RSA, Diffie-Hellman, and Elliptic Curve Cryptography are used for secure communications. These algorithms require modular exponentiation as their basic operation. Modular exponentiation implies repeated modular multiplication which is computationally very costly as the large operands are used. Therefore computation time is very large...

The first part of this report presents the concepts of C+++, an extension of C++ allowing the programmer to define new operator symbols with user-defined priorities by specifying a partial precedence relationship. Furthermore, so-called fixary operator combinations consisting of a sequence of associated operator symbols to connect a fixed number of operands as well as flexary operators connecti...