D. Han

We propose a new variant of XTR cryptosystem over finite fields with characteristic three whose compression ratio is 1/6. Expand

We improved the speed of pairing over MICAz by using a new efficient multiplication specialized for ATmega128L, called the block comb method and several optimization techniques. Expand

Pairings on elliptic curves have been used as cryptographic primitives for the development of new applications such as identity based schemes. Expand

We show that a typical software implementation of NTRU is vulnerable to the simple power analysis and the correlation power analysis including a second-order power attack. Expand

In this paper, we study exponentiation in the specific finite fields F, with very special exponents such as those that occur in algorithms for computing square roots. Expand

We propose a novel attack against Ha-Moon’s countermeasure against side channel attacks in elliptic curve cryptosystems, and show that the counterme measure is vulnerable to the proposed attack. Expand

We deal with the radix-r representation used for the scalar multiplication of pairing-based cryptosystems with characteristic r and propose a secure countermeasure. Expand

In this paper, we revisit a generally accepted opinion: implementing Elliptic Curve Cryptosystem (ECC) over GF(2m) on sensor motes using small word size is not appropriate because XOR multiplication is not efficiently supported by current low-powered microprocessors. Expand

We propose the first SPA attack on an unprotected ring-LWE public-key scheme, which is optimized by the Roy et al. scheme. Expand