Настоящая книга посвящена перспективному направлению в области защиты
информации, математическую основу которого составляет теория эллиптических …

In this paper, three small classes of finite fields GF (2^m) are found for which low complexity
bit-parallel multipliers are proposed. The proposed multipliers have lower complexities …

This work presents a novel scalable multiplication algorithm for a type-t Gaussian normal
basis (GNB) of GF (2 m). Utilizing the basic characteristics of MSD-first and LSD-first …

In this paper, an efficient high‐speed architecture of Gaussian normal basis (GNB)
multiplierover binary finite field GF (2m) is presented. The structure is constructed by using …

We present a new approach to fault tolerant public key cryptography based on redundant
arithmetic in finite rings. Redundancy is achieved by embedding non-redundant field or ring …

Push! Music is a novel mobile music listening and sharing system, where users
automatically receive songs that have autonomously recommended themselves from nearby …

Using the self duality of an optimal normal basis (ONB) of type II, we present a bit parallel
systolic multiplier over GF (2/sup m/), which has a low hardware complexity and a low …

Fast arithmetic for characteristic three finite fields is desirable in pairing-based cryptography
because there is a suitable family of elliptic curves over having embedding degree 6. In this …

Efficient implementation of finite field multipliers based on a reordered normal basis (RNB) is
highly desirable in the current/emerging cryptosystems since it offers almost free realization …

This paper presents a new bit-parallel multiplier for the finite field GF (2/sup m/) defined by
an irreducible all-one polynomial. In order to reduce the complexity of the multiplier, we …