Pseudo-analysis is basing on the fact that instead of the usual field of real numbers a semiring is taken on a real interval of the extended real numbers with pseudo operations: pseudo-addition and pseudo-multiplication. Starting from the semiring structure, it is developed by Maslov and his group the so called idempotent analysis, and then in a more general setting (Sugeno, Murofushi, Pap, Kli...

In this paper we explore pseudo-random number generation on the IBM 4758 Secure Crypto Coprocessor. In particular we compare several variants of Gennaro's provably secure generator, proposed at Crypto 2000, with more standard techniques based on the SHA-1 compression function. Our results show how the presence of hardware support for modular multiplication and exponentiation aaects these algori...

We study functional clones, which are sets of non-negative pseudo-Boolean functions closed under (essentially) multiplication, summation and limits. Functional clones naturally form a lattice under set inclusion and are closely related to counting Constraint Satisfaction Problems (CSPs). We identify a sublattice of interesting functional clones and investigate the relationships and properties o...

Recently it has been shown that in Image Processing, the usual sum and product of the reals are not the only operations that can be used. Several other operations provided by fuzzy logic perform well in this application. We continue this line of research and we propose the use of a pair consisting of a uninorm and an absorbing norm determined by a continuous, strictly increasing generator inste...

We explored the impact of operand format (digit, word, pseudo-homophone) on single-digit addition and multiplication. Format manipulations are of theoretical interest because models of arithmetic knowledge differ with respect to predicted format effects. Latencies were shortest when operands were digits, and longest when they were pseudo-homophones. However, there was also an interaction of pro...

A rapid and proficient in power requirement multiplier is always vital in electronics industry like DSP, image processing and ALU in microprocessors. Multiplier is such an imperative block w ith respect to power consumption and area occupied in the system. In order to meet the demand for high speed, various parallel array multiplication algorithms have been proposed by a number of authors. The ...

We propose a new approach to assigning distance between fuzzy numbers. A pseudo-metric on the set of fuzzy numbers and a metric on the set of trapezoidal fuzzy numbers are described. The regular reducing functions and the Hausdorff metric are used to define the metric. Using this metric, we can approximate an arbitrary generalized left right fuzzy number with a trapezoidal one. Finally, powers ...

let r be a commutative ring with identity. let n and k be two submodules of a multiplication r-module m. thenn=im and k=jm for some ideals i and j of r. the product of n and k denoted by nk is defined by nk=ijm. inthis paper we characterize some particular cases of multiplication modules by using the product of submodules.

In this report, we describe three encodings of the multiple constant multiplication (MCM) problem to pseudo-boolean satisfiability (PBS), and introduce an algorithm to solve the MCM problem optimally. To the best of our knowledge, the proposed encodings and the optimization algorithm are the first formalization of the MCM problem in a PBS manner. This report evaluates the complexity of the prob...

An explicit class field theory for the real quadratic number fields is developed. The construction is based on the theory of the Hecke eigenforms (of weight two) and the notion of a pseudo-lattice with the real multiplication introduced by Yu. I. Manin. In particular, it is shown how to extend the domain of definition of the j-invariant to the quadratic irrational points at the boundary of the ...