Faculty Profiles - NOGAMI Yasuyuki

Dynamic Job Scheduling Method Based on Expected Probability of Completion of Voting in Volunteer Computing

Yuto Miyakoshi, Shinya Yasuda, Kan Watanabe, Masaru Fukushi, Yasuyuki Nogami

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS E98D ( 12 ) 2132 - 2140 2015.12

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

DOI： 10.1587/transinf.2015PAP0027

Scopus

A Consideration on Trace Sequence over Finite Field (情報理論)

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

野上保之, 井納弘人, 土屋和由

電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 115 ( 214 ) 25 - 29 2015.9

Montgomery multiplication and squaring for Optimal Prime Fields

Hwajeong Seo, Zhe Liu, Yasuyuki Nogami, Jongseok Choi, Howon Kim

COMPUTERS & SECURITY 52 276 - 291 2015.7

Language：English Publisher：ELSEVIER ADVANCED TECHNOLOGY

Optimal Prime Fields (OPFs) are considered to be one of the best choices for lightweight elliptic curve cryptography implementations on resource-constraint embedded processors. In this paper, we revisit the efficient modular arithmetic over the special prime fields, and present improved implementations of modular multiplication and squaring for OPFs, called Optimal Prime Field Coarsely Integrated Operand Caching (OPF-CIOC) and Coarsely Integrated Sliding Block Doubling (OPF-CISBD) methods. The OPF-CIOC and OPF-CISBD methods follow the general ideas of (consecutive) operand caching and sliding block doubling techniques, respectively. The methods have been carefully optimized and redesigned for Montgomery multiplication and squaring in an integrated fashion. We then evaluate the practical performance of proposed methods on representative 8-bit AVR processor. Experimental results show that the proposed OPF-CIOC and OPF-CISBD methods outperform the previous best known results in ACNS'14 by a factor of 8% and 32%. Furthermore, our methods are implemented in a regular way which helps to reduce the leakage of side-channel information. (C) 2015 Elsevier Ltd. All rights reserved.

DOI： 10.1016/j.cose.2015.03.005

Scopus

Montgomery multiplication and squaring for Optimal Prime Fields

Hwajeong Seo, Zhe Liu, Yasuyuki Nogami, Jongseok Choi, Howon Kim

COMPUTERS & SECURITY 52 276 - 291 2015.7

Language：English Publisher：ELSEVIER ADVANCED TECHNOLOGY

DOI： 10.1016/j.cose.2015.03.005

A Consideration of NTRU Whose Modular Polynomial Is All One Polynomial

MISUMI Koki, NOGAMI Yasuyuki

Technical report of IEICE. ISEC 114 ( 471 ) 5 - 10 2015.3

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

Quantum computer will break most of recent public key cryptosystems by Shor's algorithm. Post-quantum cryptosystem which is not broken by them has been studied. NTRU is one of the post-quantum cryptosystems proposed by Hoffstein et al. This work considers a variant of NTRU with All One Polynomial Ring based on All One Polynomial. This work applies CVMA:Cyclic Vector Multiplication Algorithm. For the security evaluation, the same approach of the original NTRU can be applied to the proposed variant.

Efficient Calculation of Pairing with Supersingular Curve on 2-dimentional Extension Field

KUMANO Akito, NOGAMI Yasuyuki, SHIRASE Masaaki

Technical report of IEICE. ISEC 114 ( 471 ) 11 - 17 2015.3

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

Yoshida et al. have proposed the vector decomposition problem using supersingular curve whose embedding degree is 2. In order to apply the problem as a trapdoor of cryptosystem, it is necessary to speed up pairing calculations. This paper considers an efficient approach for Tate pairing with a supersingular curve on 2-dimentional extension field. This paper improves both Miller's algorithm and final exponentiation that is required for Tate pairing. In detail, one multiplication in the calculation of Miller's loop is eliminated by using twist map. This paper discusses how efficient the calculation of pairing becomes.

Evaluation of parallelization for multiple-precision Cyclic Vector Multiplication Algorithm using CUDA

Associative Rational Points for Improving Random Walkswith Collision-based Attack on Elliptic Curve Discrete Logarithm Problem

Yasuyuki Nogami, Thomas H. Austin

International Journal of Computer and Information Technology 2015

Associative Rational Points for Improving Random Walkswith Collision-based Attack on Elliptic Curve Discrete Logarithm Problem

Yasuyuki Nogami, Thomas H. Austin

International Journal of Computer and Information Technology 2015

A Relation between Autocorrelations of Sequences Generated by the Logistic Map over Prime Fields and Loops whose Periods are Almost Same as Precisions

宮崎武, 荒木俊輔, 上原聡, 野上保之

電子情報通信学会技術研究報告 114 ( 470(IT2014 62-101) ) 2015

素体上のロジスティック写像による生成系列の連続増加・減少回数について

宮崎武, 荒木俊輔, 上原聡, 野上保之

情報理論とその応用シンポジウム予稿集(CD-ROM) 38th 2015

奇標数体上の多値擬似乱数系列の値の分布について

小池将太, 野上保之, 土屋和由, 上原聡

情報理論とその応用シンポジウム予稿集(CD-ROM) 38th 2015

奇標数体上の非原始多項式を用いた擬似乱数系列の生成

小川千晶, 野上保之, 土屋和由, 上原聡

情報理論とその応用シンポジウム予稿集(CD-ROM) 38th 2015

逐次拡大体F_x(x=(2⁴)²)における演算の効率化について

實井識人, 野上保之, 日下卓也

情報理論とその応用シンポジウム予稿集(CD-ROM) 38th 2015

制御変数が4である有限体上のロジスティック写像による最大周期系列に対する線形複雑度プロファイル

土屋和由, 野上保之

日本応用数理学会年会講演予稿集(CD-ROM) 2015 2015

HARAMURA Satoshi, KAGOTANI Hiroto, NOGAMI Yasuyuki, SUGIYAMA Yuji

IEICE technical report 113 ( 418 ) 109 - 112 2014.1

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

Recently, studies on implementation of cryptographical algorithms on GPUs are widely conducted as GPGPU development environment provides easy access to GPUs for non-graphics programming. In this paper, we implement cyclic vector multiplication algorithm, or an efficient multiplication algorithm on extension fields, that will accelerate pairing cryptography. Since we adopt 256-bit characteristic for the base fields, we also implement Montgomery multiplication for 256-bit operands on GPU. As the result of implementation on NVIDIA GeForce GTX680, it is over 10 times slower than implementation on Core i7 3970X.

Evaluation of parallelization for multiple-precision Cyclic Vector Multiplication Algorithm using CUDA

HARAMURA Satoshi, KAGOTANI Hiroto, NOGAMI Yasuyuki, SUGIYAMA Yuji

IEICE technical report. Computer systems 113 ( 417 ) 109 - 112 2014.1

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

Evaluation of parallelization for multiple-precision Cyclic Vector Multiplication Algorithm using CUDA

HARAMURA Satoshi, KAGOTANI Hiroto, NOGAMI Yasuyuki, SUGIYAMA Yuji

Technical report of IEICE. VLD 113 ( 416 ) 109 - 112 2014.1

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

An Implementation of Elliptic Curve Scalar Multiplication with Improved Quadrupling of Rational Point

Gegerihu, NOGAMI Yasuyuki, SHIRASE Masaaki

IEICE technical report. Information theory 113 ( 411 ) 45 - 49 2014.1

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

This paper introduces a fast implementation of elliptic curve scalar multiplication with an improved quadrupling in Jacobian coordinates, since one quadrupling is more efficient than two doublings for which the scalar needs to be represented in double-base chains form. For point additions, this paper applies coordinates conversion technique which can save one field multiplication in each term of point addition in Mixed coordinates. After that, some experimental results on 256 bit elliptic curve cryptography are shown.