Faculty Profiles - NOGAMI Yasuyuki

Other Link： https://dblp.uni-trier.de/db/journals/ieicet/ieicet92a.html#NogamiSONAM09

Scalar Multiplication Using Frobenius Expansion over Twisted Elliptic Curve for Ate Pairing Based Cryptography

Yasuyuki Nogami, Yumi Sakemi, Takumi Okimoto, Kenta Nekado, Masataka Akane, Yoshitaka Morikawa

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES E92A ( 1 ) 182 - 189 2009.1

Language：English Publisher：IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG

DOI： 10.1587/transfun.E92.A.182

How to Generate a Secure Composite Order Ordinary Pairing-friendly Curve of Embedding Degree 3

Y.Nogami, K.Nishii, Y.Sakemi, H.Kato, Y.Morikawa

ITC-CSCC2009 1474 - 1447 2009

Thread Computing for Miller's algorithm of Pairing

Shoichi Takeuchi, Yumi Sakemi, Yasuyuki Nogami, Yoshitaka Morikawa

ISCE: 2009 IEEE 13TH INTERNATIONAL SYMPOSIUM ON CONSUMER ELECTRONICS, VOLS 1 AND 2 587 - 591 2009

Language：English Publisher：IEEE

This paper shows an improvement of Miller's algorithm so as to be efficient for thread programming by using divisor theorem. Then, this paper implements a thread program of the improved Miller's algorithm by which it is shown that the proposed technique is more efficient than ordinary Miller's algorithm.

DOI： 10.1109/ISCE.2009.5156956

Cost Evaluation of The Improvement of Twisted Ate Pairing That Uses Integer Variable X of Small Hamming Weight

Sakemi Yumi, Kato hidehiro, Nogami Yasuyuki, Morikawa Yoshikawa

Memoirs of the Faculty of Engineering, Okayama University 43 ( 15 ) 113 - 116 2009

A High-Speed Square Root Algorithm for Extension fields -Especially for Fast Extension Fields-

Kato Hidehiro, Nogami Yasuyuki, Morikawa Yoshitaka

Memoirs of the Faculty of Engineering, Okayama University 43 99 - 107 2009

Inversion with Normal Bases in Tower Field F_{((2^{2})^{2})^2} for S-Box of AES

Y. Nogami, M. Hagio(Oki Network LSI, E. Yanagi, Y. Morikawa

ITC-CSCC2009 1337 - 1338 2009

Cross Twisted Xate Pairing with Barreto-Naehrig Curve for Multi-pairing Technique

Yumi Sakemi, Yasuyuki Nogami, Hidehiro Kato, Yoshitaka Morikawa

2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4 2386 - 2390 2009

Language：English Publisher：IEEE

Recently, efficient pairings such as optimal-ate, R-ate, and Xate pairings have been proposed. On the other hand, some pairing-based cryptographic protocols need several pairing calculations for one procedure. Thus, multi-pairing technique will be efficiently applied. This paper optimizes Xate pairing for multi-pairing and then evaluates its efficiency with comparing to the other efficient pairings. Then, it is shown that the multi-pairing with the optimized Xate pairing is the most efficient.

DOI： 10.1109/ISIT.2009.5205994

Zero Correlation Distribution of ZCZ Sequences Obtained from a Perfect Sequence and a Unitary Matrix

Other Link： https://dblp.uni-trier.de/db/conf/isit/isit2009.html#SakemiMNK09

Determining Basis Conversion Matrix without Gauss Period Normal Basis

Y.Nogami, E.Yanagi, M.Hagio, Oki Network LSI, Y.Morikawa

ITC-CSCC2009 1331 - 1332 2009

Satoshi Uehara, Shuichi Jono, Yasuyuki Nogami

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES E91A ( 12 ) 3745 - 3748 2008.12

Language：English Publisher：IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG

A class of zero-correlation zone (ZCZ) sequences constructed by the recursive procedure from a perfect sequence and a unitary matrix was proposed by T, Nakamura, and Suehiro [1]. In the reference [1], three parameters, s.t., the Sequence length, the family size and the length of the ZCZ, were evaluated for a general estimate of the performance of the ZCZ sequences. In this letter, we give more detailed distributions of that correlation values are zero on their ZCZ sequence sets.

DOI： 10.1093/ietfec/e91-a.12.3745

Efficient Exponentiation in Extensions of Finite Fields without Fast Frobenius Mappings

Yasuyuki Nogami, Hidehiro Kato, Kenta Nekado, Yoshitaka Morikawa

ETRI JOURNAL 30 ( 6 ) 818 - 825 2008.12

Language：English Publisher：ELECTRONICS TELECOMMUNICATIONS RESEARCH INST

This paper proposes an exponentiation method with Frobenius mappings. The main target is an exponentiation in an extension field. This idea can be applied for scalar multiplication of a rational point of an elliptic curve defined over an extension field. The proposed method is closely related to so-called interleaving exponentiation. Unlike interleaving exponentiation methods, it can carry out several exponentiations of the same base at once. This happens in some pairing-based applications. The efficiency of using Frobenius mappings for exponentiation in an extension field was well demonstrated by Avanzi and Mihailescu. Their exponentiation method efficiently decreases the number of multiplications by inversely using many Frobenius mappings. Compared to their method, although the number of multiplications needed for the proposed method increases about 20%, the number of Frobenius mappings becomes small. The proposed method is efficient for cases in which Frobenius mapping cannot be carried out quickly.

DOI： 10.4218/etrij.08.0108.0178

A method for constructing a self-dual normal basis in odd characteristic extension fields

Yasuyuki Nogami, Hiroaki Nasu, Yoshitaka Morikawa, Satoshi Uehara

FINITE FIELDS AND THEIR APPLICATIONS 14 ( 4 ) 867 - 876 2008.11

Language：English Publisher：ACADEMIC PRESS INC ELSEVIER SCIENCE

This paper proposes a useful 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. In detail, when the characteristic p and extension degree in satisfies the following conditions (1) and either (2a) or (2b); (1) 2km + 1 is a prime number, (2a) the order of p in F2km+ 1 is 2km, (2b) 2 dagger km and the order of p in F2km + 1 is km, we can consider a class of Gauss period normal bases. Using this Gauss period normal basis, this paper shows a method to construct a self-dual normal basis in the extension field F-p(m). (C) 2008 Elsevier Inc. All rights reserved.

DOI： 10.1016/j.ffa.2008.04.001

A method for constructing a self-dual normal basis in odd characteristic extension fields

Yasuyuki Nogami, Hiroaki Nasu, Yoshitaka Morikawa, Satoshi Uehara

FINITE FIELDS AND THEIR APPLICATIONS 14 ( 4 ) 867 - 876 2008.11

Language：English Publisher：ACADEMIC PRESS INC ELSEVIER SCIENCE

DOI： 10.1016/j.ffa.2008.04.001

A Consideration on Efficient Exponentiation in Extension Field for Pairing-based Cryptography

YOSHIDA Tomoki, KATO Hidehiro, NEKADO Kenta, NOGAMI Yasuyuki, MORIKAWA Yoshitaka

IEICE technical report 108 ( 162 ) 101 - 107 2008.7

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

In recent years, pairing-based cryptographies such as ID-base cryptography and group signature have been studied. These cryptographies require exponentiations in multiplicative group G_T. In this paper, the author proposes an efficient exponentiation method for the case of Barreto-Naehrig (BN) curve. Additionally, the author shows implementation results of the proposed method with conventional techniques such as binary method, window method, NAF method and Avanzi method. Then, the author shows the proposed method carries out exponentiation fast.

CiNii Article

CiNii Books

A Consideration on Efficient Exponentiation in Extension Field for Pairing-based Cryptography

YOSHIDA Tomoki, KATO Hidehiro, NEKADO Kenta, NOGAMI Yasuyuki, MORIKAWA Yoshitaka

IPSJ SIG Notes 2008 ( 71 ) 235 - 241 2008.7

Language：Japanese Publisher：Information Processing Society of Japan (IPSJ)

In recent years, pairing-based cryptographies [2] such as ID-base cryptography [3] and group signature [1]have been studied. These cryptographies require exponentiations in multiplicative group G_T In this paper, the author proposes an efficient exponentiation method for the case of Barreto-Naehrig (BN) curve [9] . Additionally, the author shows implementation results of the proposed method with conventional techniques such as binary method, window method, NAF method and Avanzi method [12] [15]. Then, the author shows the proposed method carries out exponentiation fast.

CiNii Article

CiNii Books

Other Link： http://id.nii.ac.jp/1001/00044301/

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.4

Language：English Publisher：ELECTRONICS TELECOMMUNICATIONS RESEARCH INST

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 F-p(m) where p is characteristic. As a brute force method, when p(m) is small, we can check the equality correspondence by using the minimal polynomial of a basis element; however, when P, is large, it becomes too difficult. The proposed methods are based on the fact that Type I and Type H 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 mlog(2)p = 160.

DOI： 10.4218/etrij.08.0107.0182