A comparative study of hardware implementations of Elliptic Curve Cryptography (ECC) in Wireless Sensor Networks (WSN) is presented in this paper. The study covers important parameters like the underlying finite field, representation basis, occupied chip area, consumed power, and time performances of these implementations. Additionally, most of the reviewed implementations were implemented on A...

We may not be able to make you love reading, but guide to fpga implementation of arithmetic functions will lead you to love reading starting from now. Book is the window to open the new world. The world that you want is in the better stage and level. World will always guide you to even the prestige stage of the life. You know, this is some of how reading will give you the kindness. In this case...

This article presents a novel optimal pairing over supersingular genus-2 binary hyperelliptic curves. Starting from Vercauteren’s work on optimal pairings, we describe how to exploit the action of the 2-th power Verschiebung in order to further reduce the loop length of Miller’s algorithm compared to the genus-2 ηT approach. As a proof of concept, we detail an optimized software implementation ...

This paper presents a solution for secure remote reconfiguration of FPGAs. Communicating the bitstream has to be done in a secure manner to prevent an attacker from reading or altering the bitstream. We propose a setup in which the FPGA is the single device in the system’s zone-of-trust. The result is an FPGA architecture that is divided into a static and a dynamic region. The static region hol...

In this paper we present the development and implementation of an intravenous inf~ision controller system based on fpga’s. The system receives irEformation of an infision drop sensor and controls the drop flow by giving the direction and number of steps of a stepper motor, which compress the drip-feed hose. The system consists of a mixed implementation of sofnvare and hardware. The software was...

A function f : P ! P , P = f0; 1; : : : ; p 1g is kdecomposable i f can be represented as f(X1;X2) = g(h1(X1); h2(X1); : : : ; hk(X1);X2), where (X1; X2) is a bipartition of input variables. This paper introduces the notion of totally k-undecomposable functions. By using this concept, we can drastically reduce the search space to nd k-decompositions. A systematic method to nd the bipartitions o...