Faculty Profiles - NOGAMI Yasuyuki

An Improvement of Scalar Multiplication by Skew Frobenius Map with Multi-Scalar Multiplication for KSS Curve.

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

Md. Al-Amin Khandaker, Yasuyuki Nogami

IEICE Transactions 100-A ( 9 ) 1838 - 1845 2017

Authorship：Lead author Language：English Publisher：IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG

Scalar multiplication over higher degree rational point groups is often regarded as the bottleneck for faster pairing based cryp-tography. This paper has presented a skew Frobenius mapping technique in the sub-field isomorphic sextic twisted curve of Kachisa-Schaefer-Scott (KSS) pairing friendly curve of embedding degree 18 in the context of Ate based pairing. Utilizing the skew Frobenius map along with multi-scalar multiplication procedure, an efficient scalar multiplication method for KSS curve is proposed in the paper. In addition to the theoretic proposal, this paper has also presented a comparative simulation of the proposed approach with plain binary method, sliding window method and non-adjacent form (NAF) for scalar multiplication. The simulation shows that the proposed method is about 60 times faster than plain implementation of other compared methods.

DOI： 10.1587/transfun.E100.A.1838

A Comparative Study of Twist Property in KSS Curves of Embedding Degree 16 and 18 from the Implementation Perspective.

Md. Al-Amin Khandaker, Taehwan Park, Yasuyuki Nogami, Howon Kim

J. Inform. and Commun. Convergence Engineering 15 ( 2 ) 97 - 103 2017

Language：English

Implementation of faster pairing calculation is the basis of efficient pairing-based cryptographic protocol implementation. Generally, pairing is a costly operation carried out over the extension field of degree k ≥ 12. But the twist property of the pairing friendly curve allows us to calculate pairing over the sub-field twisted curve, where the extension degree becomes k/d and twist degree d = 2, 3, 4, 6. The calculation cost is reduced substantially by twisting but it makes the discrete logarithm problem easier if the curve parameters are not carefully chosen. Therefore, this paper considers the most recent parameters setting presented by Barbulescu and Duquesne [1] for pairing-based cryptography; that are secure enough for 128- bit security level; to explicitly show the quartic twist (d = 6) and sextic twist (d = 4) mapping between the isomorphic rational point groups for KSS (Kachisa-Schaefer-Scott) curve of embedding degree k = 16 and k = 18, receptively. This paper also evaluates the performance enhancement of the obtained twisted mapping by comparing the elliptic curve scalar multiplications.

DOI： 10.6109/jicce.2017.15.2.97

Binary field multiplication on ARMv8

移動ロボットにおけるCANの脆弱性をついたDOS攻撃となりすましの実証

藤井建人, 亀川哲志, 野上保之, 五福明夫

日本機械学会ロボティクス・メカトロニクス講演会講演論文集(CD-ROM) 2017 2017

奇標数体上の原始多項式を用いた多値擬似乱数系列における係数分布

小川千晶, 小寺雄太, 宮崎武, 上原聡, 日下卓也, 野上保之

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

擬似乱数生成のための効率的なトレース計算法に関する考察

小寺雄太, 小川千晶, 村岡英之, 荒木俊輔, 宮崎武, 上原聡, 日下卓也, 野上保之

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

Improvement of Noise Source Amplitude Modulation Method to Identify Source Devices of Electromagnetic Interference

石田千晶, 吉野慎平, 小川千晶, 五百旗頭健吾, 豊田啓孝, 野上保之

電子情報通信学会技術研究報告 117 ( 319(EMCJ2017 64-75) ) 2017

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

SECURITY AND COMMUNICATION NETWORKS 9 ( 13 ) 2051 - 2058 2016.9

Language：English Publisher：WILEY-HINDAWI

In this paper, we show efficient implementations of binary field multiplication over ARMv8. We exploit an advanced 64-bit polynomial multiplication (PMULL) supported by ARMv8 and conduct multiple levels of asymptotically faster Karatsuba multiplication for polynomial multiplication. Finally, our method completed binary field multiplication within 57 and 153 clock cycles for B-251 and B-571 cases, respectively. Proposed method improves the speed-performance by a factor of 4.5 times than previous techniques on same target platform. Copyright (c) 2016 John Wiley & Sons, Ltd.

DOI： 10.1002/sec.1462

Hybrid Montgomery Reduction

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

ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS 15 ( 3 ) 2016.7

Language：English Publisher：ASSOC COMPUTING MACHINERY

In this article, we present a hybrid method to improve the performance of the Montgomery reduction by taking advantage of the Karatsuba technique. We divide the Montgomery reduction into two sub-parts, including one for the conventional Montgomery reduction and the other one for Karatsuba-aided multiplication. This approach reduces the multiplication complexity of n-limb Montgomery reduction from theta(n(2) + n) to asymptotic complexity theta(7n(2)/8 + n). Our practical implementation results over an 8-bit microcontroller also show performance enhancements by 11%.

DOI： 10.1145/2890502

Hybrid Montgomery Reduction

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

ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS 15 ( 3 ) 58 - 13 2016.7

Language：English Publisher：ASSOC COMPUTING MACHINERY

DOI： 10.1145/2890502

Hybrid Montgomery Reduction

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

ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS 15 ( 3 ) 2016.7

Language：English Publisher：ASSOC COMPUTING MACHINERY

DOI： 10.1145/2890502

FPGA Implementation of Various Elliptic Curve Pairings over Odd Characteristic Field with Non Supersingular Curves

Yasuyuki Nogami, Hiroto Kagotani, Kengo Iokibe, Hiroyuki Miyatake, Takashi Narita

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS E99D ( 4 ) 805 - 815 2016.4

Authorship：Lead author Language：English Publisher：IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG

Pairing-based cryptography has realized a lot of innovative cryptographic applications such as attribute-based cryptography and semi homomorphic encryption. Pairing is a bilinear map constructed on a torsion group structure that is defined on a special class of elliptic curves, namely pairing-friendly curve. Pairing-friendly curves are roughly classified into supersingular and non supersingular curves. In these years, non supersingular pairing-friendly curves have been focused on from a security reason. Although non supersingular pairing-friendly curves have an ability to bridge various security levels with various parameter settings, most of software and hardware implementations tightly restrict them to achieve calculation efficiencies and avoid implementation difficulties. This paper shows an FPGA implementation that supports various parameter settings of pairings on non supersingular pairing-friendly curves for which Montgomery reduction, cyclic vector multiplication algorithm, projective coordinates, and Tate pairing have been combinatorially applied. Then, some experimental results with resource usages are shown.

DOI： 10.1587/transinf.2015ICP0018