#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2008

2012

- This year (0)
- Last 5 years (5)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Kenta Nekado, Yasuyuki Nogami, Kengo Iokibe
- IWSEC
- 2012

- Kenta Nekado, Yasuyuki Nogami, Hidehiro Katou, Yoshitaka Morikawa
- IEICE Transactions
- 2011

- Yasuyuki Nogami, Kenta Nekado, Tetsumi Toyota, Naoto Hongo, Yoshitaka Morikawa
- IEICE Transactions
- 2011

- Yasuyuki Nogami, Yumi Sakemi, Takumi Okimoto, Kenta Nekado, Masataka Akane, Yoshitaka Morikawa
- IEICE Transactions
- 2009

- Yasuyuki Nogami, Hidehiro Katou, Kenta Nekado, Satoshi Uehara, Yoshitaka Morikawa
- IEEE Transactions on Information Theory
- 2012

Several methods for finding a basis conversion matrix between two different bases in an extension field have been proposed. Among them, the one based on Gauss period normal basis (GNB) is on average the most efficient. However, since it needs to construct a certain tower field , some inefficient cases in which the towering degree becomes large have been… (More)

In recent years, pairing-based cryptographies such as ID-based cryptography [1] and group signature [2] have been studied. For their implementations, pairings such as Weil pairing [1], Tate pairing, Ate pairing [3] and Xate pairing [4] have been used. In order to implement these pairings, several kinds of ordinary pairing-friendly curves such as… (More)

Pollard's rho method is well-known as an efficient method for solving discrete logarithm problem (DLP). This paper adopts the DLP on the so-denoted G<sub>3</sub> over Barreto-Naehrig curve, together with XTR group. Then, this paper shows this idea with the proposed algorithm, and the experimental computation time of solving the DLP is reduced by about 15%.

- Kenta Nekado, Tatsuya Yuasa, Yasuyuki Nogami, Yoshitaka Morikawa
- 2010 13th International Conference on Network…
- 2010

Many public-key cryptographers have recently focused on cryptographic schemes based on pairing, which is a bilinear map from two elliptic curve groups to a group in an extension field. In order to provide efficient pairings, several kinds of pairing-friendly curves have been proposed. Since most of the pairing-friendly curves are defined over a certain… (More)

Recent cryptographic applications such as elliptic curve cryptography and pairing-based cryptography often need arithmetic operations, especially vector multiplications in a certain extension field of large order. Thus, the authors have proposed cyclic vector multiplication algorithm (CVMA) with prime Gauss period normal basis (GNB) for accelerating… (More)