研究者詳細 - 野上　保之

論文 - 野上　保之

分割表示 188 件中 61 - 80 件目／全件表示 >>

Implementation and Evaluation of Ate Pairings on Elliptic Curves with Embedding Degree 10 Applied Type-II All-One Polynomial Extension Field of Degree 5

Rikuya Matsumura, Yuto Takahashi, Yuki Nanjo, Takuya Kusaka, Yasuyuki Nogami

ITC-CSCC 2020 - 35th International Technical Conference on Circuits/Systems, Computers and Communications 336 - 341 2020年7月

An Implementation and Evaluation of a Pairing on Elliptic Curves with Embedding Degree 14

Zihao Song, Rikuya Matsumura, Yuto Takahashi, Yuki Nanjo, Takuya Kusaka, Yasuyuki Nogami, Tsutomu Matsumoto

ITC-CSCC 2020 - 35th International Technical Conference on Circuits/Systems, Computers and Communications 293 - 298 2020年7月

An Efficient File Hierarchy Attribute Based Encryption Using Optimized Tate Pairing Construction in Cloud Environment

Balaji Chandrasekaran, Yasuyuki Nogami, Ramadoss Balakrishnan

Journal of Applied Security Research 15 ( 2 ) 270 - 278 2020年4月

Secure Information Transmission Framework in Wireless Body Area Networks

Balaji Chandrasekaran, Ramadoss Balakrishnan, Yasuyuki Nogami

Journal of Applied Security Research 15 ( 2 ) 279 - 287 2020年4月

Evaluating Side-Channel Resistance Using Low Order Rational Points Against Curve25519 and an Associated Quadratic Twist

Keiji Yoshimoto, Yoshinori Uetake, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami

International Journal of Networking and Computing 10 ( 2 ) 144 - 158 2020年

A Performance Analysis and Evaluation of SIDH Applied Several Implementation-Friendly Quadratic Extension Fields

Nanjo Yuki, Shirase Masaaki, Kusaka Takuya, Nogami Yasuyuki

International Journal of Networking and Computing 10 ( 2 ) 227 - 241 2020年

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：IJNC編集委員会

It is well-known that quadratic extension fields (QEFs) based on optimal extension fields (OEFs) are typically used for supersingular isogeny Diffie-Hellman (SIDH) key exchange protocol. On the other hand, there is a possibility of the performance improvement of SIDH by employing other attractive choices of QEFs with efficient performing arithmetics which are based on all-one polynomial extension fields (AOPFs) and extension fields with normal basis representation (EFNs). Thus, the authors confirm that the applicability of the new candidates of QEFs for SIDH and evaluate SIDH applied the possible choices of QEFs. As a result of the experiment, the authors found that the performances of SIDH applied the QEFs based on AOPF and EFN are comparable to that of the previous QEF. Moreover, one of the QEFs based on EFN result in a new efficient implementation of the SIDH with SIDH-friendly prime given as p= 2^{e_A}3^{e_B}f+1 where e_A, e_B and $f$ are positive integers.

DOI： 10.15803/ijnc.10.2_227

CiNii Article

researchmap

その他リンク： https://dblp.uni-trier.de/db/journals/ijnc/ijnc10.html#NanjoSKN20

A Construction Method of an Isomorphic Map between Quadratic Extension Fields Applicable for SIDH

NANJO Yuki, SHIRASE Masaaki, KUSAKA Takuya, NOGAMI Yasuyuki

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 103 ( 12 ) 1403 - 1406 2020年

記述言語：英語掲載種別：研究論文（学術雑誌）出版者・発行元：一般社団法人電子情報通信学会

<p>A quadratic extension field (QEF) defined by F₁ = F_p[α]/(α²+1) is typically used for a supersingular isogeny Diffie-Hellman (SIDH). However, there exist other attractive QEFs F_i that result in a competitive or rather efficient performing the SIDH comparing with that of F₁. To exploit these QEFs without a time-consuming computation of the initial setting, the authors propose to convert existing parameter sets defined over F₁ to F_i by using an isomorphic map F₁ → F_i.</p>

DOI： 10.1587/transfun.2020TAL0002

その他リンク： https://dblp.uni-trier.de/db/journals/ieiceta/ieiceta103.html#NanjoSKN20

Equivalent Keys of a Nonlinear Filter Generator Using a Power Residue Symbol.

Yuta Kodera, Yuki Taketa, Takuya Kusaka, Yasuyuki Nogami, Satoshi Uehara

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 12231 LNCS 23 - 36 2020年

An Approach for Attacking Speck on Microcontroller with Correlation Power Analysis.

Jianjie Tang, Kengo Iokibe, Takuya Kusaka, Yasuyuki Nogami

Proceedings - 2020 8th International Symposium on Computing and Networking Workshops, CANDARW 2020 368 - 372 2020年

Specific Congruence Classes of Integer Parameters for Generating BLS Curves for Fast Pairings.

Yuki Nanjo, Masaaki Shirase, Takuya Kusaka, Yasuyuki Nogami

Proceedings - 2020 8th International Symposium on Computing and Networking Workshops, CANDARW 2020 348 - 354 2020年

Improvement of Bit Distribution of Binary Sequence Generated by Alternative Trace Map Function.

Fatema Akhter, Tomoya Tatara, Yasuyuki Nogami, Takuya Kusaka, Nobuo Funabiki

Proceedings - 2020 8th International Symposium on Computing and Networking Workshops, CANDARW 2020 302 - 306 2020年

Analysis of a method to eliminate fruitless cycles for Pollard's rho method with skew Frobenius mapping over a Barreto-Naehrig curve.

Hiromasa Miura, Rikuya Matsumura, Takuya Kusaka, Yasuyuki Nogami

Proceedings - 2020 8th International Symposium on Computing and Networking, CANDAR 2020 160 - 166 2020年

A Study on Randomness of Sequences Obtained from Piecewise Logistic Map over Integers.

Sota Eguchi, Takeru Miyazaki, Shunsuke Araki, Satoshi Uehara, Yasuyuki Nogami

Proceedings of 2020 International Symposium on Information Theory and its Applications, ISITA 2020 451 - 455 2020年

A Parallel Blum-Micali Generator Based on the Gauss Periods.

Yuta Kodera, Tomoya Tatara, Takuya Kusaka, Yasuyuki Nogami, Satoshi Uehara

Proceedings of 2020 International Symposium on Information Theory and its Applications, ISITA 2020 447 - 450 2020年

A Study on Binary Sequences Located in Hadamard Matrices of Order 2n.

Kasumi Nakano, Kako Takahashi, Satoshi Uehara, Takeru Miyazaki, Shunsuke Araki, Yasuyuki Nogami

Proceedings of 2020 International Symposium on Information Theory and its Applications, ISITA 2020 460 - 464 2020年

Mutual relationship between the neural network model and linear complexity for pseudorandom binary number sequence 査読

Yuki Taketa, Yuta Kodera, Shogo Tanida, Takuya Kusaka, Yasuyuki Nogami, Norikazu Takahashi, Satoshi Uehara

Proceedings of the Seventh International Symposium on Computing and Networking Workshops 394 - 400 2019年11月

An Implementation and Evaluation of Pairing Library ELiPS for BLS Curve with Several Techniques

Yuto Takahashi, Yuki Nanjo, Takuya Kusaka, Yasuyuki Nogami, Tadaki Kanenari, Tomoya Tatara

34th International Technical Conference on Circuits/Systems, Computers and Communications, ITC-CSCC 2019 296 - 299 2019年6月

記述言語：英語掲載種別：研究論文（国際会議プロシーディングス）出版者・発行元：IEEE

In recent years, pairing encryption is receiving a lot of attention since it enables many innovative and multi-functional cryptographic applications based on pairing e.g. searchable encryption, broadcast encryption and so on. Pairing is a map from two additive rational point groups mathbb{G}{1}, mathrm{G}{2} to a multiplicative group mathbb{G}{3}, however, it requires complexity computation. Therefore, the author tries to develop a 128-bit security level pairing library ELiPS (Efficient Library for Pairing Systems) that incorporates various high-speed methods using BLS curves. As a result, scalar multiplications on mathbb{G}{1} and mathbb{G}{2}, exponentiation on mathbb{G}{3}, and optimal-ate pairing can be computed in 0.42[ms], 0.79[ms], 1.13[ms], and 3.12[ms], respectively.

DOI： 10.1109/ITC-CSCC.2019.8793376

Web of Science

Scopus

researchmap

A Comparison of Relic-toolkit and ELiPS Libraries for a Pairing-based Homomorphic Encryption

Tadaki Kanenari, Yuto Takahashi, Yuta Hashimoto, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami, Toru Nakanishi

34th International Technical Conference on Circuits/Systems, Computers and Communications, ITC-CSCC 2019 225 - 228 2019年6月

記述言語：英語掲載種別：研究論文（国際会議プロシーディングス）出版者・発行元：IEEE

In recent years, the number of companies are adopting cloud computing service for outsourcing is increasing. On the other hand, there are threats that are like falsification or leakage to data to be kept secret. Therefore, the technologies for managing encrypted data are the attractive topics in the cryptographic field. Among them, functional encryption which is constructed with pairing-based cryptography is closing to the practical stage because pairing operation is getting faster by the recent study of pairing. In addition, there are some pairing libraries which allow a user to introduce the pairing-based cryptography to their system. Nevertheless, they have some differences in several operations. In this paper, we reconstruct pairing-based homomorphic encryption by focusing on features of libraries and examine the performance evaluations of them.

DOI： 10.1109/ITC-CSCC.2019.8793446

Web of Science

Scopus

researchmap

Updating A Secret Key for MAC Implemented on CAN Using Broadcast Encryption Scheme

Tomoya Tatara, Hiroto Ogura, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami

34th International Technical Conference on Circuits/Systems, Computers and Communications, ITC-CSCC 2019 275 - 278 2019年6月

記述言語：英語掲載種別：研究論文（国際会議プロシーディングス）出版者・発行元：IEEE

In recent years, CAN is spread widely as the in-vehicle network. However, CAN protocol does not guarantee the security for traffics against falsification and spoofing. Therefore, the MAC is required for CAN so as to communicate exactly. MAC is the countermeasure for falsification and spoofing using the secret key. The problem is a method of delivering the secret key securely. This paper proposes a method to update the secret key using broadcast encryption over a non-supersingular elliptic curve. The method is implemented on Raspberry Pi and experimentally find out to be able to update the secret key efficiently.

DOI： 10.1109/ITC-CSCC.2019.8793298

Web of Science

Scopus

researchmap

Analysis of the fruitless cycle of Pollard's rho method based attack for solving ECDLP over Barreto-Naehrig curves

Hiromasa Miura, Ken Ikuta, Sho Joichi, Takuya Kusaka, Yasuyuki Nogami

34th International Technical Conference on Circuits/Systems, Computers and Communications, ITC-CSCC 2019 237 - 240 2019年6月

記述言語：英語掲載種別：研究論文（国際会議プロシーディングス）出版者・発行元：IEEE

This paper focuses on the computational security of elliptic curve discrete logarithm (ECDLP), which can evaluate by an actual attack. The authors apply Pollard's rho method to a Barreto-Naehrig curve with minimum parameters for solving an ECDLP. An analysis of the structure for all combinations of a select of seed and starting points are given. Then, we propose the method for selecting a set of efficient seed points for a random walk for the rho method.

DOI： 10.1109/ITC-CSCC.2019.8793449

<野上 保之>

論文 - 野上 保之

<野上　保之>

論文 - 野上　保之