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.

An Analysis of Individual Differences for a Computer Self-Regulated Reading Comprehension Task

Recent developments in brain imagery have made it possible to explore links between brain functions and psychological phenomena, opening a window between mind, brain and behavior. However, behavior cannot be understood solely by looking at the brain alone; the roles of the context, task, and practice are potent forces in shaping behavior. According to these ideas, we present a work experience to reflect on: 1) the variations of how people learn, 2) the learning potential of students with learning disabilities, and 3) computers as a tool to learn and to analyze student’s reading comprehension processes. In this vein, we present and discuss an example of how different types of readers (average, dyslexia, and hemispherectomy) undertake a computer self-regulated reading comprehension task. This is not an experimental research study and results cannot be generalized. Theoretical and educational implications are discussed in line with the proposed aims.