Faculty Profiles - NOGAMI Yasuyuki

Papers - NOGAMI Yasuyuki

Division display 181 - 188 of about 188 ／ All the affair displays >>

Efficient Non Symmetric Pairing Groups on Ordinary Pairing Friendly Curve of Embedding Degree 1 Reviewed

Tetsuya Izuta, Yasuyuki Nogami, Yoshitaka Morikawa

2011 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC) 2011

Language：English Publishing type：Research paper (international conference proceedings) Publisher：IEEE

Recently, ordinary pairing-friendly elliptic curves whose embedding degree is 1 have been often focused on, for example some composite order pairing-based cryptographies do. In the case of non-symmetric pairings whose embedding degree is larger than 2, recent efficient pairing techniques such as Rate and Xate pairings adopt a certain special rational point group with an efficient isomorphic mapping and then accelerate pairing-related operations such as a pairing calculation and a scalar multiplication. Based on cubic, quartic, and sextic twists, this paper shows how to activate these efficient techniques together with point compression on pairing-friendly curves of embedding degree 1.

Web of Science

researchmap

Anonymous IEEE802.1X Authentication System Using Group Signatures.

Amang Sudarsono, Toru Nakanishi 0001, Yasuyuki Nogami, Nobuo Funabiki

J. Inf. Process. 18 63 - 76 2010

Publishing type：Research paper (scientific journal)

Recently, ubiquitous Internet-access services have been provided by Internet service providers (ISPs) by deploying wireless local area networks (LANs) in public spaces including stations, hotels, and coffee shops. The IEEE802.1X protocol is usually used for user authentications to allow only authorized users to access services. Then, although user personal information of access locations, services, and operations can be easily collected by ISPs and thus, their strict management has been demanded, it becomes very difficult when multiple ISPs provide roaming services by their corporations. In this paper, we present an anonymous IEEE802.1X authentication system using a group signature scheme to allow user authentication without revealing their identities. Without user identities, ISPs cannot collect personal information. As an efficient revocable group signature scheme, we adopt the verifier-local revocation (VLR) type with some modifications for use of the fast pairing computation. We show the implementation of our proposal and evaluation results where the practicality of our system is confirmed for up to 1,000 revoked users.

DOI： 10.2197/ipsjjip.18.63

Scopus

researchmap

Accelerating Twisted Ate Pairing with Frobenius Map, Small Scalar Multiplication, and Multi-pairing Reviewed

Yumi Sakemi, Shoichi Takeuchi, Yasuyuki Nogami, Yoshitaka Morikawa

INFORMATION SECURITY AND CRYPTOLOGY - ISISC 2009 5984 47 - 64 2010

Language：English Publishing type：Research paper (international conference proceedings) Publisher：SPRINGER-VERLAG BERLIN

In the case of Barreto-Naehrig pairing-friendly curves of embedding degree 12 of order r, recent efficient Ate pairings such as R-ate, optimal, and Xate pairings achieve Miller loop lengths of (1/4) left perpendicularlog(2) r right perpendicular]. On the other hand, the twisted Ate pairing requires (3/4) left perpendicularlog(2) r right perpendicular] loop iterations, and thus is usually slower than the recent efficient Ate pairings. This paper proposes an improved twisted Ate pairing using Frobenius maps and a small scalar multiplication. The proposal splits the Miller's algorithm calculation into several independent parts, for which multi-pairing techniques apply efficiently. The maximum number of loop iterations in Miller's algorithm for the proposed twisted Ate pairing is equal to the (1/4) left perpendicularlog(2) r right perpendicular] attained by the most efficient Ate pairings.

DOI： 10.1007/978-3-642-14423-3_4

Web of Science

Scopus

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/icisc/icisc2009.html#SakemiTNM09

Anonymous IEEE802.1X Authentication System Using Group Signatures

Sudarsono Amang, Nakanishi Toru, Nogami Yasuyuki, Funabiki Nobuo

Information and Media Technologies 5 ( 2 ) 751 - 764 2010

Language：English Publisher：Information and Media Technologies Editorial Board

DOI： 10.11185/imt.5.751

CiNii Article

researchmap

Two Improvements of Twisted Ate Pairing with Barreto-Naehrig Curve by Dividing Miller's Algorithm Reviewed

Yumi Sakemi, Hidehiro Kato, Shoichi Takeuchi, Yasuyuki Nogami, Yoshitaka Morikawa

ICCIT: 2009 FOURTH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCES AND CONVERGENCE INFORMATION TECHNOLOGY, VOLS 1 AND 2 1180 - 1186 2009

Language：English Publishing type：Research paper (international conference proceedings) Publisher：IEEE

This paper shows two improvements of twisted te pairing with Barreto Naehrig curve so as to be efficiently carried out by dividing the calculation loops of Miller's algorithm based on divisor theorem. Then, this paper shows some experimental results from which it is shown that each improvements accelerate twisted- te pairing.

DOI： 10.1109/ICCIT.2009.203

Web of Science

Scopus

researchmap

Thread computing for Miller's algorithm of pairing Reviewed

Shoichi Takeuchi, Yumi Sakemi, Yasuyuki Nogami, Yoshitaka Morikawa

Digest of Technical Papers - IEEE International Conference on Consumer Electronics 182 - 186 2009

Language：English Publishing type：Research paper (international conference proceedings)

This paper shows an improvement of Miller's algorithm so as to be effcient 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 ef.cient than ordinary Miller's algorithm. ©2009 IEEE.

DOI： 10.1109/ISCE.2009.5156956

Scopus

researchmap

Fast implementation of extension fields with Typell ONB and cyclic vector multiplication algorithm Reviewed

Yasuyuki Nogami, Shigeru Shinonaga, Yoshitaka Morikawa

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E88-A ( 5 ) 1200 - 1208 2005

Language：English Publishing type：Research paper (scientific journal) Publisher：Institute of Electronics, Information and Communication, Engineers, IEICE

This paper proposes an extension field named TypeII AOPF. This extension field adopts TypeII optimal normal basis, cyclic vector multiplication algorithm, and Itoh-Tsujii inversion algorithm. The calculation costs for a multiplication and inversion in this field is clearly given with the extension degree. For example, the arithmetic operations in TypeII AOPF Fp5 is about 20% faster than those in OFF Fp5, Then, since CVMA is suitable for parallel processing, we show that Typell AOPF is superior to AOPF as to parallel processing and then show that a multiplication in TypeII AOPF becomes about twice faster by parallelizing the CVMA computation in TypeII AOPF. Copyright © 2005 The Institute of Electronics, Information and Communication Engineers.

DOI： 10.1093/ietfec/e88-a.5.1200

Scopus

researchmap

Watermarking Method Using PN Diffusion and 1D-Fourier Transform of Multi-Resolution Approximation for Image

TSUGE Koichiro, NOGAMI Yasuyuki, MORIKAWA Yoshitaka

ITE Technical Report 25 ( 83 ) 49 - 54 2001.12

Language：Japanese Publisher：The Institute of Image Information and Television Engineers

In this paper, we propose image digital watermark method which has robustness against image compression and clipping. In this method, we first at first take discrete wavelet transform of original image, and get out multi-resolution approximation (MRA). Next, we spread spectrum of the MRA by Pseudo Noise (PN) sequence, and then take 1D-discrete Fourier transform (DFT) of each column. We vary the DFT coefficients according to each bit of watermark information. This method has the features which the third eavesdropper, who don't know the PN sequence, can not decipher the information data and alter them. In detection process, we take the DFT difference between PT-spread MRA of original image and that of watermark-embedded image and calculate shift of the DFT coefficients. Therefore, this method has the advantage that we can detect the watermark information even from the clipping image.

DOI： 10.11485/itetr.25.83.0_49

CiNii Article

CiNii Books

researchmap

　 PREV - NEXT 　

< NOGAMI Yasuyuki >

Papers - NOGAMI Yasuyuki