Faculty Profiles - NOGAMI Yasuyuki

Skew Frobenius Map and Efficient Scalar Multiplication for Pairing-Based Cryptography

An Implementation of Anonymous IEEE802.1X Authentication System for Wireless Networks

A. Sudarsono, T. Nakanishi, Y. Nogami, N. Funabiki

Proc. the 10th Industrial Electronics Seminar 2008 (IES2008) 2008

Yumi Sakemi, Yasuyuki Nogami, Katsuyuki Okeya, Hidehiro Kato, Yoshitaka Morikawa

CRYPTOLOGY AND NETWORK SECURITY 5339 226 - + 2008

Language：English Publisher：SPRINGER-VERLAG BERLIN

This paper considers a new skew Frobenius endomorphism with pairing-friendly elliptic curve E(F-p) defined over prime field F-p. Then, using the new skew Frobenius map, an efficient scalar multiplication method for pairing-friendly elliptic curve E(F-p) is shown. According to the simulation result, a scalar multiplication by the proposed method with multi-exponentiation technique is about 40% faster than that by plain binary method.

DOI： 10.1007/978-3-540-89641-8_16

Other Link： https://dblp.uni-trier.de/db/conf/cans/cans2008.html#SakemiNOKM08

An Improvement of Twisted Ate Pairing with Barreto-Naehrig Curve by using Frobenius Mapping

Yumi Sakemi, Hidehiro Kato, Yasuyuki Nogami, Yoshitaka Morikawa

Third 2008 International Conference on Convergence and Hybrid Information Technology, Vol 2, Proceedings 2 406 - 410 2008

Language：English Publisher：IEEE COMPUTER SOC

This paper proposes an improvement of twisted-Ate pairing with Barreto-Naehrig curve so as to efficiently use Frobenius mapping with respect to prime field. Then, this paper shows some simulation results by which it is shown that the improvement accelerates twisted-Ate pairing.

DOI： 10.1109/ICCIT.2008.193

Efficient Pairings on Twisted Elliptic Curve

Yasuyuki Nogami, Masataka Akane, Yumi Sakemi, Yoshitaka Morikawa

THIRD 2008 INTERNATIONAL CONFERENCE ON CONVERGENCE AND HYBRID INFORMATION TECHNOLOGY, VOL 2, PROCEEDINGS 2 430 - + 2008

Language：English Publisher：IEEE COMPUTER SOC

This paper proposes an efficient implementation of Ate pairing on twisted elliptic curve. Suppose that a pairing-friendly elliptic curve E has a twisted elliptic curve E' of degree d, and let psi(d) be an isomorphic map from E'(F-p(e)) to the corresponding subgroup of E(F-p(k)). Then, consider G' = psi(-1)(d) (G1) and G(2)' = psi(-1)(d) (G(2)) for G(1), G(2) at Ate pairing alpha. Let P is an element of G(1), Q is an element of G(2), P' is an element of G'(1) and Q' is an element of G'(2), the authors have shown alpha(Q,P) = F-t-q,F-Q (P)((pk-1)/r) = f(t-1,Q')(P')((pk-1)/r). This paper shows that this new Ate pairing, namely cross twisted (Xt) Ate pairing, provides an quite efficient implementation.

DOI： 10.1109/ICCIT.2008.172

An Improvement of Cyclic Vector Multiplication Algorithm

Hidehiro Kato, Yasuyuki Nogami, Tomoki Yoshida, Kenta Nekado, Shoichi Takeuchi, Yoshitaka Morikawa

Third 2008 International Conference on Convergence and Hybrid Information Technology, Vol 2, Proceedings 2 401 - 405 2008

Language：English Publisher：IEEE COMPUTER SOC

This paper first introduces cyclic vector multiplication algorithm (CVMA) that is a multiplication algorithm in extension field. Then, it is also introduced that CVMA is useful under the tight restrictions of pairing-based cryptographies. Then, this paper points out a problem about the calculation cost of CVMA. For this problem, this paper proposes an improvement. According to some simulation results, it is shown that the improvement makes CVMA much more efficient.

DOI： 10.1109/ICCIT.2008.166

A method for constructing a pseudo self-dual normal basis

Hiroaki Nasu, Yasuyuki Nogami, Satoshi Uehara, Ryo Namba, Yoshitaka Morikawa

CYBERNETICS AND SYSTEMS 39 ( 6 ) 563 - 582 2008

Language：English Publisher：TAYLOR & FRANCIS INC

Self-dual normal basis is efficient for the arithmetic operations in extension field and especially trace calculation. However, self-dual normal bases do not exist in [image omitted] when characteristic p is odd and degree m is even. This paper proposes a method to construct an efficient normal basis for trace calculation when extension degree is even. In this paper, we call it pseudo self-dual normal basis.

DOI： 10.1080/01969720802188201

Integer Variable chi-Based Ate Pairing

Generating Irreducible Self-reciprocal Polynomials by Using Even Polynomial over Fq

Shigeki Kobayashi, Yasuyuki Nogami, Tatsuo Sugimura

The 23rd International Technical Conference on Circuits/Systems, Computers and Communications 121 - 124 2008

An improvement of twisted ate pairing using integer variable with small hamming weight

SAKEMI Y.

2008 Symposium on Cryptography and Information Security (SCIS2008), Jan. 269 - 272 2008

Fast Squaring in TypeI All One Polynomial Field

Hidehiro Kato, Yasuyuki Nogami, Yoshitaka Morikawa

The 23rd International Technical Conference on Circuits/Systems, Computers and Communications 273 - 276 2008

Yasuyuki Nogami, Masataka Akane, Yumi Sakemi, Hidehiro Kato, Yoshitaka Morikawa

PAIRING-BASED CRYPTOGRAPHY - PAIRING 2008 5209 178 - + 2008

Language：English Publisher：SPRINGER-VERLAG BERLIN

In implementing an efficient pairing calculation, it is said that the lower bound of the number of iterations of Miller's algorithm is log(2)r/phi(k), where phi(.) is the Euler's function. Ate pairing reduced the number of the loops of Miller's algorithm of Tate pairing from left perpendicularlog(2)rright perpendicular to left perpendicularlog(2)(t - 1)right perpendicular. Recently, it is known to systematically prepare a pairing-friendly elliptic curve whose parameters are given by a polynomial of integer variable "chi". For the curve, this paper gives integer variable chi-based Ate pairing that achieves the lower bound by reducing it to left perpendicularlog(2) chi right perpendicular.

DOI： 10.1007/978-3-540-85538-5_13

Other Link： https://dblp.uni-trier.de/db/conf/pairing/pairing2008.html#NogamiASKM08

Basis translation matrix between two isomorphic extension fields via optimal normal basis

Yasuyuki Nogami, Ryo Namba, Yoshitaka Morikawa

ETRI Journal 30 ( 2 ) 326 - 334 2008

Language：English Publisher：ETRI

This paper proposes a method for generating a basis translation matrix between isomorphic extension fields. To generate a basis translation matrix, we need the equality correspondence of a basis between the isomorphic extension fields. Consider an extension field Fpm where p is characteristic. As a brute force method, when pm is small, we can check the equality correspondence by using the minimal polynomial of a basis element
however, when pm is large, it becomes too difficult The proposed methods are based on the fact that Type I and Type II optimal normal bases (ONBs) can be easily identified in each isomorphic extension field. The proposed methods efficiently use Type I and Type II ONBs and can generate a pair of basis translation matrices within 15 ms on Pentium 4 (3.6 GHz) when mlog2p = 160.

DOI： 10.4218/etrij.08.0107.0182

Cyclic vector multiplication algorithm based on a special class of Gauss period normal basis

Hidehiro Kato, Yasuyuki Nogami, Tomoki Yoshida, Yoshitaka Morikawa

ETRI JOURNAL 29 ( 6 ) 769 - 778 2007.12

Language：English Publisher：ELECTRONICS TELECOMMUNICATIONS RESEARCH INST

This paper proposes a multiplication algorithm for F-pm, which can be efficiently applied to many pairs of characteristic p and extension degree m except for the case that 8p divides m(p-1). It uses a special class of type-< k, m > Gauss period normal bases. This algorithm has several advantages: it is easily parallelized; Frobenius mapping is easily carried out since its basis is a normal basis; its calculation cost is clearly given; and it is sufficiently practical and useful when parameters k and m are small.

DOI： 10.4218/etrij.07.0107.0040

An Implementation of a Pairing-Based Group Signature Scheme with Verifier-Local Revocation

HIRA Yuta, KATO Hidehiro, NAKANISHI Toru, NOGAMI Yasuyuki, FUNABIKI Nobuo, MORIKAWA Yoshitaka

IEICE technical report 107 ( 209 ) 69 - 76 2007.8

Language：Japanese Publisher：The Institute of Electronics, Information and Communication Engineers

Group signature scheme is one of signature schemes which keep signer's identity information secret. A pairing-based group signature scheme which can make a signer sign without any revocation information and has the short length of the signature was proposed. However this scheme has a problem that the anonymity cannot be proved in case of using the twisted pairing which is known for an efficient implementation of pairing. Then, in this paper, we extend the previous scheme to have the provable anonymity in case of using twisted pairing. In addition, we efficiently implemented the extended scheme by transforming some equations and introducing parallel processing, and then we show that the extended scheme can be executed for a practical time on a server with multi-core CPU even if about 500 members are revoked.

CiNii Article

CiNii Books

Constructing Self-Dual Normal Bases in Odd-Degree Extension Field

SAKEMI Yumi, NASU Hiroaki, NANBA Ryo, NOGAMI Yasuyuki, MORIKAWA Yoshitaka

IEICE technical report 107 ( 143 ) 23 - 27 2007.7

Language：Japanese Publisher：The Institute of Electronics, Information and Communication Engineers

A self-dual normal basis only exists in odd-degree extension field when characteristic p is an odd prime. However, a method to construct it systematically has not been given. In this paper, we show a method for constructing a self-dual normal basis in an arbitrary extension field F_<p^m> such that 4p does not divide m(p-1) and m is odd by using a special class of Gauss period normal bases. Then, it is also shown that the vector representations with the self-dual and Gauss period normal bases are easily translated to each other.

CiNii Article

CiNii Books

Normal Basis Efficient for Trace Calculation in Odd Characteristic Extension Field of Even Degree

NEKADO Kenta, NASU Hiroaki, NANBA Ryo, NOGAMI Yasuyuki, MORIKAWA Yoshitaka

IEICE technical report 107 ( 143 ) 19 - 22 2007.7

Language：Japanese Publisher：The Institute of Electronics, Information and Communication Engineers

Some public-key cryptographies require an extension field as the definition field. When we implement arithmetic operations in the extension field, we need to prepare an efficient basis. In this paper, we deal with normal bases efficient for trace calculations. First, we go over that there are no self-dual normal bases [2]-[4] in odd characteristic extension fields of even degree. Then, we introduce a normal basis in odd characteristic extension field of degree 2 as efficient as self-dual normal basis.

CiNii Article

CiNii Books