Faculty Profiles - NOGAMI Yasuyuki

Papers - NOGAMI Yasuyuki

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

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

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

Pairing-based cryptography has received much attention as an encryption method for realizing advanced cryptography such as ID-based encryption and searchable encryption. In a pairing-friendly elliptic curve of embedding degree 10, calculation cost of multiplication and squaring on extension fields of degree 5 are related to efficiency of pairing. Therefore, it is necessary to select an efficient multiplication and squaring algorithms on the extension field of degree 5. To apply these algorithms, the authors implement a pairing on an elliptic curve of embedding degree 10 with type-II all-one polynomial extension field (AOPF) of degree of 5 and optimal extension field (OEF) of degree of 5. As a result, the computational complexity of pairing with the expanded AOPF of degree 5 are almost 7.4% efficient than that of the expanded OEF of degree 5.

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

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

As the computer architecture technology evolves, communication protocols have been demanded not only having reliable security but also flexible functionality. Advanced cryptography has been expected as a new generation cryptography which suffices such the requirements. A pairing is one of the key technologies of the cryptography and the pairing has been known as having a substantial amount of construction parameters. Recently, the elliptic curve with embedding degree 14 is evaluated as one of the efficient curves for pairing. In the paper, we implement an optimal ate pairing on the elliptic curve by applying several variants of multiplication algorithms of extension field of degree 7 on multiple devices. The best multiplication algorithm among the candidates is derived. Besides, for efficient calculations, we propose a pseudo 7-sparse algorithm and a fast calculation method of final exponentiation. As a result, we discover the proper multiplication algorithm bases on the rate of addition and multiplications on several different computer platforms. Our proposed pseudo 7-sparse algorithm is approximately 1.54% faster than a regular algorithm on almost all tested platforms. Eventually, for the total execution time of pairing we record 9.33ms on Corei5-9500.

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

Language：English Publishing type：Research paper (scientific journal) Publisher：TAYLOR & FRANCIS INC

One of the most preferred encryption techniques for data sharing in cloud environment is Ciphertext-Policy Attribute Based Encryption (CP-ABE). An efficient File Hierarchy CP-ABE (FH-CP-ABE) scheme using an integrated access structure was proposed by Wang and colleagues. Their working construction was based on symmetric pairing. In this article, we propose an efficient Asymmetric File Hierarchy Ciphertext-Policy Attribute Based Encryption (AFH-CP-ABE) which is based on an asymmetric pairing construction using denominator elimination and twist mapping. We apply this optimized Tate pairing in the proposed AFH-CP-ABE to find out its computational costs for encryption and decryption using gmp 6.0.0 library and then compared with existing schemes.

DOI： 10.1080/19361610.2019.1649534

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

Language：English Publishing type：Research paper (scientific journal) Publisher：TAYLOR & FRANCIS INC

Secured information transmission is one of the critical challenges in Wireless Body Area Networks (WBAN). The main motivation of this paper is secure transmission of highly sensitive patient information with reduced computation cost and storage requirements. In this paper, we integrate Ciphertext-Policy Attribute Based Encryption (CPABE) with Constant Size Ciphertext (CPABE-CSC) and Blowfish algorithm for secure transmission of sensitive patient information. The experimental results show the efficiency of the proposed scheme in terms of computation cost and ciphertext size when compared with existing schemes.

DOI： 10.1080/19361610.2019.1669987

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

Language：English Publishing type：Research paper (scientific journal) Publisher：IJNC Editorial Committee

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

Other Link： 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

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

<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

Other Link： 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

Language：English Publishing type：Research paper (international conference proceedings) Publisher：SPRINGER INTERNATIONAL PUBLISHING AG

The existence of equivalent keys for a secret key is an inseparable topic in cryptography. Especially for pseudorandom number generators for cryptographic applications, equivalent keys are not only a specific pair of keys that generate the same sequence but includes the one that gives simply the phase-shifted sequence. In this paper, the authors especially focus on a kind of nonlinear filter generator (NLFG) defined by using a power residue calculation over an odd characteristic. Generally speaking, an evaluation of NLFGs has conducted by the randomness of the sequence itself and the security of keys. Though the previous evaluations of the randomness of the target NLFG are studied and proven theoretically, the security aspects as a cryptosystem still have not discussed. Therefore, this paper would like to begin a new security evaluation by focusing on the existence of equivalent keys for the NLFG. As a result, the authors first show that sequences generated by the NLFG are classified into several types of sequences depending on the choice of a certain parameter. Owing to this, it is found that there exist equivalent keys concerning the parameter corresponding to the above. At the same time, we show that the equivalent keys are possible to eliminate by giving the restriction on the corresponding parameter adequately.

DOI： 10.1007/978-3-030-58208-1_2

Other Link： https://dblp.uni-trier.de/db/conf/iwsec/iwsec2020.html#KoderaTKNU20

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

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

In recent years, some lightweight cipher algorithms for IoT devices have been proposed. These algorithms can be applied to a variety of IoT devices without occupying too much memory and power consumption, and compared to traditional ciphers, such as AES, these algorithms have higher efficiency. The Speck algorithm is a lightweight block cipher, proposed by the NSA in June 2013, and it is specifically optimized for IoT microcontrollers. A few previous studies have shown that the Speck algorithm can be attacked through power analysis. Based on Arduino Uno as the implementation platform of the Speck 128/128 algorithm, in this paper, we propose a method to attack the Speck 128/128 algorithm. Our experiment results have shown that when the attack point in the last round of Speck 128/128 XOR operation, the round key can be successfully recovered by the Correlation Power Analysis attack.

DOI： 10.1109/CANDARW51189.2020.00076

Other Link： https://dblp.uni-trier.de/db/conf/ic-nc/candar2020w.html#TangIKN20

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

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

Pairings are widely used for innovative protocols such as ID-based encryption and group signature authentication. According to the recent works, the Barreto-Lynn-Scott (BLS) family of pairing-friendly elliptic curves are suggested for the pairings at the various security levels. The BLS family has specific polynomial parameters in terms of an integer x0 for generating the pairing-friendly elliptic curves with various embedding degrees k, which are called BLS curves. The important fact is that one can find congruence classes of x0 which give rise to the BLS curves having a benefit of an efficient performing field arithmetics. However, except for the BLS curves with k = 24, such the practical usable congruence classes of x0 have not been provided at this time. In this manuscript, the authors provide the specific congruence classes generating the practical subfamilies of the BLS curves with k = 2i • 3 and 3j with arbitrary positive integers i and j.

DOI： 10.1109/CANDARW51189.2020.00073

Other Link： https://dblp.uni-trier.de/db/conf/ic-nc/candar2020w.html#NanjoSKN20

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

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

Pseudo random binary sequences have been widely used in cryptographic applications due to their speedy construction, reproducibility and characteristics like true random sequence. Realization of modern cryptographic application and mathematical tools is inconceivable without random sequences. Previously, we proposed an alternative trace map function for generation of a pseudo random binary sequence that has long period, good correlation characteristics and high linear complexity that are attractive for security applications. However, it was found that the distribution of bits in sequence is not uniform which may lead to failure in randomness. In this paper, we propose a uniformization method using power of primitive root to improve uniformity of bit distribution in the sequence. Sequence of different lengths is generated using proposed sequence to verify the efficiency of the proposed uniformization method. By analyzing the bit distribution of generated sequences for different length of patterns, we show that the proposal achieves bit uniformity while maintaining randomness of the sequence.

DOI： 10.1109/CANDARW51189.2020.00066

Other Link： https://dblp.uni-trier.de/db/conf/ic-nc/candar2020w.html#AkhterTNKF20

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

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

Pollard’s rho method is one of the most efficient methods for solving elliptic curve discrete logarithm problem (ECDLP) in elliptic curve cryptography. Pollard’s rho method with skew Frobenius mapping can solve ECDLP over a Barreto-Naehrig (BN) curve efficiently. Pollard’s rho method may result in an unsolvable cycle called a fruitless cycle. When a random walk pass results in a fruitless cycle, the random walk pass must restart with a different starting point. However, an effective method for eliminating the fruitless cycle has been not proposed yet. This paper proposes a method for eliminating the fruitless cycle in Pollard’s rho method with skew Frobenius mapping. In addition, the authors apply the proposed method to a BN curve with 17-bit parameters and confirm the effectiveness.

DOI： 10.1109/CANDAR51075.2020.00029

Other Link： https://dblp.uni-trier.de/db/conf/ic-nc/candar2020.html#MiuraMKN20

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

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

We have been studying a design of the pseudo-random number generator by generated sequences with the logistic map over integers. Although it has already been presented that such properties of the generation sequences are good, the range of control parameters that satisfy the properties is not enough wide. To improve this problem, Wang et al. proposed the piecewise logistic map. It is method for increasing the range of control parameters that can generate good sequences for the pseudorandom number generator. However, it is not suitable for computer implementation, because it is defined over real numbers. In this paper, we will propose a piecewise logistic map over integers that uses an integer arithmetic and computers can calculate the map correctly. We will also show some results of numerical experiments for the sequences generated from this map.

Other Link： https://dblp.uni-trier.de/conf/isita/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

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

In this paper, the authors propose an algorithm to generate a sequence of bits in parallel to enhance the generating performance of the Blum-Micali method which is for constructing a pseudorandom number generator. More precisely, since the classical definition needs to refer the previous state to generate the next bit, we modify the generation steps in an alternative way by introducing the feature of the Gauss periods. It gives us a unique representation of elements as if a primitive element generates those elements as the powers and this mechanism realizes the parallel algorithm. As a result, the generator achieves to mimic the main concept of the Blum-Micali method in parallel and it is thought to be secure if the discrete logarithm problem is hard to solve.

Other Link： https://dblp.uni-trier.de/conf/isita/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

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

We show some properties of binary sequences located in Hadamard matrices of order 2〈n〉 represented by Sylvester's matrices. The Kronecker product is a method for expanding Hadamard matrix, and a set of sequences with orthogonal properties is extended by concatenation or interleaving. From these expanding methods and properties related to constructions, we discuss the increase of the set of orthogonal sequences. Finally, we show the characteristic polynomials of binary sequences located in Hadamard matrices of order 2〈n〉.

Other Link： https://dblp.uni-trier.de/conf/isita/2020

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

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

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

Machine learning (ML) technology has been getting popular in many applications where ML purposes to analyze or classify data, or predicting the phenomenon follows from the previous conditions, for example. However, the spread of ML technologies allows an attacker to use them into the attack for the sake of sniffing secret information. Since the randomness has been used for an inseparable part of the cryptographic applications to ensure the security, the resistance of a random sequence against analysis based on the ML technologies have to be required. The authors anticipate having the mutual relationship between the classical properties of the randomness, linear complexity (LC) in particular, and the structure of a neural network (NN), which is a class of ML. In this research, the authors find that the strength of each connection between nodes in the NN is relevant to the linear recurrence relation of the target sequence by observing parameters after complete learning. In other words, the difficulty of predicting the next bits from a given sequence would be discussed based on the LC of a sequence in most cases. The experimental results are introduced to clarify the black box in this research.

DOI： 10.1109/CANDARW.2019.00074

Other Link： https://dblp.uni-trier.de/db/conf/ic-nc/candar2019w.html#TaketaKTKNTU19

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

Language：English Publishing type：Research paper (international conference proceedings) Publisher：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

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

Language：English Publishing type：Research paper (international conference proceedings) Publisher：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

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

Language：English Publishing type：Research paper (international conference proceedings) Publisher：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

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

Language：English Publishing type：Research paper (international conference proceedings) Publisher：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

　 PREV - NEXT 　

1
2
3
4
5
6
7
8
9
10