Key distribution in Wireless Sensor Networks (WSNs) is challenging. Symmetric
cryptosystems can perform it efficiently, but they often do not provide a perfect trade-off …

This paper surveys bit-parallel multipliers for finite field GF (2 n) according to i) quadratic and
subquadratic arithmetic complexities of the underlying algorithms, ii) various bases used for …

The realization that software has a far reaching impact on politics, society and the
environment is not new. However, only recently software impact has been explicitly …

This paper presents a design-space exploration of an application-specific instruction-set
processor (ASIP) for the computation of various cryptographic pairings over Barreto-Naehrig …

This paper describes the design of a fast multi-core library for the cryptographic Tate pairing
over supersingular elliptic curves. For the computation of the reduced modified Tate pairing …

This paper presents a novel method for designing compact yet efficient hardware
implementations of the Tate pairing over supersingular curves in small characteristic. Since …

The initial definition of XP resulted in many people interpreting the on-site customer to be a
single person. We have conducted extensive qualitative research studying XP teams, and …

The assurance, reuse, and recertification of legacy safety-critical computer systems are
problems affecting government and industry. The assurance and recertification processes …

We describe a high-speed software implementation of the η T pairing over binary
supersingular curves at the 128-bit security level. This implementation explores two types of …

This paper is devoted to the design of fast parallel accelerators for the cryptographic\eta_T
pairing on supersingular elliptic curves over finite fields of characteristics two and three. We …