High-speed polynomial basis multipliers over GF(2(m)) for special pentanomial.

Efficient hardware implementations of arithmetic operations in the Galois field are highly desirable for several applications, such as coding theory, computer algebra and cryptography. Among these operations, multiplication is of special interest because it is considered the most important building block. Therefore, high-speed algorithms and hardware architectures for computing multiplication are highly required. In this paper, bit-parallel polynomial basis multipliers over the binary field GF(2(m)) generated using type II irreducible pentanomials are considered. The multiplier here presented has the lowest time complexity known to date for similar multipliers based on this type of irreducible pentanomials.

Optimization of Enzymes Inactivation in High Pressure Processes

The demand of highest quality foods in terms of taste and their properties preservation without the use of additives is constantly increasing. Consequently, new approaches to food processing have been developed, as for example high-pressure technology which has proven to be very valuable because it allows to maintain good properties of food like some vitamins and, at the same time, to reduce some undesirable bacteria. This technology avoids the use of high temperatures during the process (not like Pasteurization), which may have adverse effect on some nutritional properties of the food, its flavour, etc. The models for some enzymatic inactivations, which depend on the pressure and temperature profiles are presented. This work deals with the optimization of the inactivation of certain enzymes when high pressure treatment on food processing is applied. The optimization algorithms will minimize the inactivation not only of a certain isolated enzyme but also to several enzymes that can be involved simultaneously in the high-pressure process.