Faculty Profiles - NOGAMI Yasuyuki

Papers - NOGAMI Yasuyuki

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

Well Balanced Multi-value Sequence and its Properties over Odd Characteristic Field

M. Arshad Ali, Yuta Kodera, M. Fazle Rabbi, Takuya Kusaka, Yasuyuki Nogami, Satoshi Uehara, Robert H. Morelos-Zaragoza

Advances in Science, Technology and Engineering Systems 4 ( 4 ) 188 - 196 2019

Publishing type：Research paper (scientific journal)

The authors propose a well balanced multi-value sequence (including a binary sequence). All the sequence coefficients (except the zero) appear almost the same in number, thus, the proposed sequence is so called the well balanced sequence. This paper experimentally describes some prominent features regarding a sequence, for instance, its period, autocorrelation, and cross-correlation. The value of the autocorrelation and cross-correlation can be explicitly given by the authors formulated theorems. In addition, to ensure the usability of the proposed multi-value sequence, the authors introduce its flexibility by making it a binary sequence. Furthermore, this paper also introduces a comparison in terms of the linear complexity and distribution of bit patterns properties with their previous works. According to the comparison results, the proposed sequence holds better properties compared to our previous sequence.

DOI： 10.25046/aj040423

Multi-Value Sequence Generated over Sub Extension Field and Its Properties Reviewed

Md. Arshad Ali, Yuta Kodera, Takuya Kusaka, Satoshi Uehara, Yasuyuki Nogami, Robert H. Morelos-Zaragoza

Journal of Information Security 10 ( 03 ) 130 - 154 2019

A Comparative Implementation of GLV Technique on KSS-16 Curve Reviewed

Md Al Amin Khandaker, Yuki Nanjo, Takuya Kusaka, Yasuyuki Nogami

Proceedings - 2018 6th International Symposium on Computing and Networking, CANDAR 2018 106 - 112 2018.12

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

© 2018 IEEE. Pairing-based protocols are getting popular in many cryptographic applications. Pairing algorithms involve computations on elements in all three pairing groups, G 1 , G 2 and G 3 ; however, most protocols usually require additional scalar multiplication and exponentiation in any of these three groups. The Gallant-Lambert-Vanstone (GLV) method is an elegant technique to accelerate the scalar multiplication which can reduce the number of elliptic curve doubling by using Straus-Shamir simultaneous multi-scalar multiplication technique. However, efficiently computable endomorphisms are required to apply GLV for the elliptic curves. This paper shows the GLV technique by deriving efficiently computable endomorphism for Kachisa-Schaefer-Scott (KSS) curve defined over degree 16 extension field. In addition, the authors show explicit formulas to compute the GLV method together with Straus-Shamir simultaneous multi-scalar multiplication technique for 2, 4 and 8 dimensions in G 2 group. The comparative implementation shows that dimension 4 gives faster computational time than dimension 8 and 2.

DOI： 10.1109/CANDAR.2018.00021

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

Consideration of efficient pairing applying two construction methods of extension fields Reviewed

Yuki Nanjo, Md Al Amin Khandaker, Takuya Kusaka, Yasuyuki Nogami

Proceedings - 2018 6th International Symposium on Computing and Networking Workshops, CANDARW 2018 445 - 451 2018.12

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

© 2018 IEEE. In recent years, many innovative cryptography protocols based on the pairing. Finding out an efficient extension field construction is one of the prerequisites for a practical pairing implementation. The author tries to find an elegant extension field construction which will result in efficient pairing over Barreto-Naehrig (BN) curve. In this paper, two construction methods are considered for extension field of degree 12, and one of them results in an efficient exponentiation and the other enables to compute faster Miller loop than the former one. Therefore, a method which uses a basis conversion matrix between the two extension field is proposed. In comparison to the performance of Aranha et al.'s towering, the proposed implementation results in the efficient exponentiation in a multiplicative group, although pairing cost is slightly increased.

DOI： 10.1109/CANDARW.2018.00087

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

Identification of Dominant ICs for Electromagnetic Emission by Using Noise Source Amplitude Modulation and Correlation Analysis

Shimpei Yoshino, Chiaki Ishida, Kengo Iokibe, Yoshitaka Toyota, Yasuyuki Nogami

IEEE International Symposium on Electromagnetic Compatibility 2018-August 439 - 444 2018.10

Publishing type：Research paper (international conference proceedings)

To identify semiconductor devices that are dominant noise sources at low cost in order to reduce electromagnetic interference (EMI), we propose a method based on a noise source amplitude modulation technique and correlation analysis (NSM-CA). In this study, we applied the NSM-CA method to a printed circuit board (PCB) with multiple integrated circuits (ICs) and identified ICs dominantly contributing to EM emission. The switching currents produced in three of the ICs were modulated in amplitude with three different modulation signals. The noise source amplitude modulation was implemented in an FPGA, mounted on a PCB, by using three pseudorandom binary sequences (PRBSs) as modulation signals. During the modulations, EM emission was measured at frequencies where the emission exceeded the limit of EMI regulation. The temporal variation in the measured emission was correlated with each of the PRBSs. The ranking of the contributions of the ICs to the emission was determined by means of the resultant correlation coefficients. According to the ranking, the dominant ICs to which a combination of EMI reduction techniques should be primarily applied were identified. Moreover, we applied an EMI reduction technique to the dominant ICs and found a larger reduction in emission than when the technique was applied to low priority ICs.

DOI： 10.1109/EMCEurope.2018.8485011

Randomness of Binary Sequences with Long Period by Combining M-Sequence and Knuth's Quadratic Congruential Sequence

Kohei Kawase, Takeru Miyazaki, Shunsuke Araki, Satoshi Uehara, Yasuyuki Nogami

2018 IEEE International Conference on Consumer Electronics-Taiwan, ICCE-TW 2018 2018.8

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

Cryptography is one of the most important elements on the information security. In this paper, we propose a construction method of a long-period binary sequence with good randomness which plays an important role in cryptography. We generate the sequence by combining two types of binary sequences; one is the m-sequence and the other is a quadratic congruential sequence proposed by Knuth. It is well known that the m-sequence has good statistical properties, and Knuth's method can generate a long period sequence. However, both of these sequences cannot pass the almost NIST statistical tests by stand-alone. We derive a binary sequence combining these two sequences. In addition; we also consider the reasons why the proposed sequence has good randomness properties.

DOI： 10.1109/ICCE-China.2018.8448725

A Construction Method of a Binary Sequence Using a Logistic Map over F<inf>p</inf> for IoT Device

Takato Nagano, Takeru Mitazakit, Satoshi Uehara, Yasuyuki Nogami

2018 IEEE International Conference on Consumer Electronics-Taiwan, ICCE-TW 2018 2018.8

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

With the spread of loT, it is necessary to implement of encryption and decryption in order to secure information handled by each device. We focus on generating a sequence having random number property for a microcomputer with a short available bit length. We propose binary sequences combined from two random number sequences of 16 bits or less, one is an interleaving operation and the other is a combination by using a Gray code. In this paper, we discussed about how to generate a sequence and random number properties.

DOI： 10.1109/ICCE-China.2018.8448887

A Consideration of an Efficient Arithmetic over the Extension Field of Degree 3 for Elliptic Curve Pairing Cryptography

Xin Li, Yuta Kodera, Yoshinori Uetake, Takuya Kusaka, Yasuyuki Nogami

2018 IEEE International Conference on Consumer Electronics-Taiwan, ICCE-TW 2018 2018.8

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

This paper presents an efficient arithmetic in extension field based on Cyclic Vector Multiplication Algorithm that reduces calculation costs over cubic extension for elliptic curve pairing cryptography. In addition, we evaluate the calculation costs compared to Karatsuba-based method.

DOI： 10.1109/ICCE-China.2018.8448573

An extended generalized minimum distance decoding for binary linear codes on a 4-level quantization over an AWGN channel Reviewed

Shunsuke Ueda, Ken Ikuta, Takuya Kusaka, Md Al Amin Khandaker, Md Arshad Ali, Yasuyuki Nogami

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E101A ( 8 ) 1235 - 1244 2018.8

Language：English Publishing type：Research paper (scientific journal) Publisher：IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG

Copyright © 2018 The Institute of Electronics, Information and Communication Engineers. Generalized Minimum Distance (GMD) decoding is a well-known soft-decision decoding for linear codes. Previous research on GMD decoding focused mainly on unquantized AWGN channels with BPSK signaling for binary linear codes. In this paper, a study on the design of a 4-level uniform quantizer for GMD decoding is given. In addition, an extended version of a GMD decoding algorithm for a 4-level quantizer is proposed, and the effectiveness of the proposed decoding is shown by simulation.

DOI： 10.1587/transfun.E101.A.1235

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

An ECC Implementation with a Twisted Montgomery Curve over Fq32 on an 8-Bit Microcontroller Reviewed

Yuta Hashimoto, Md Al Amin Khandaker, Yuta Kodera, Taehwan Park, Takuya Kusaka, Howon Kim, Yasuyuki Nogami

Proceedings - 2017 5th International Symposium on Computing and Networking, CANDAR 2017 2018-January 445 - 450 2018.4

Publishing type：Research paper (international conference proceedings)

© 2017 IEEE. The security of Internet of Things (IoT) devices is one of the most important problems. The processing ability of IoT devices is limited, therefore a more light-weight and secure cryptography is necessary. This paper shows the implementation of 256-bit Elliptic Curve Cryptography (ECC) on an 8-bit microcontroller by applying towering for extension field of degree 32. The authors use a twisted Montgomery curve with a Montgomery ladder which enables fast calculations without inverse elements. In addition to that, this implementation is considered resistant to the Side Channel Attack (SCA) since it applies the Montgomery ladder for the scalar multiplication (SCM). This ECC implementation on Arduino UNO, an 8-bit microcontroller board, takes 3 seconds for an SCM which can be made faster by careful assembly implementation.

DOI： 10.1109/CANDAR.2017.90

Distribution of Digit Patterns in Multi-Value Sequence over the Odd Characteristic Field. Reviewed

Yuta Kodera, Takeru Miyazaki, Md. Al-Amin Khandaker, Ali Md. Arshad, Takuya Kusaka, Yasuyuki Nogami, Satoshi Uehara

IEICE Transactions 101-A ( 9 ) 1525 - 1536 2018

Language：English Publishing type：Research paper (scientific journal) Publisher：IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG

The authors have proposed a multi-value sequence called an NTU sequence which is generated by a trace function and the Legendre symbol over a finite field. Most of the properties for NTU sequence such as period, linear complexity, autocorrelation, and cross-correlation have been theoretically shown in our previous work. However, the distribution of digit patterns, which is one of the most important features for security applications, has not been shown yet. In this paper, the distribution has been formulated with a theoretic proof by focusing on the number of 0's contained in the digit pattern.

DOI： 10.1587/transfun.E101.A.1525

A Study on the Parameter Size of the Montgomery Trick for ECDLP. Reviewed

Ken Ikuta, Sho Joichi, Kazuya Kobayashi, Md. Al-Amin Khandaker, Takuya Kusaka, Yasuyuki Nogami

Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018 623 - 627 2018

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

In this research, the choice of the parameter of the Montgomery trick in Pollard's Rho method to solve the elliptic curve discrete logarithm problem for Barreto-Naehrig (BN) curves is shown. The average number of generated rational points per unit time is chosen as a measure of the effectiveness of the choice of the parameter of the Montgomery trick. The results are derived from a sufficient number of experiments with several BN curves.

DOI： 10.23919/ISITA.2018.8664242

Efficient Parallel Simeck Encryp tion with GPGPU and OpenCL Reviewed

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

2018 IEEE INTERNATIONAL CONFERENCE ON CONSUMER ELECTRONICS-TAIWAN (ICCE-TW) 2018

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

Simeck family block cipher was proposed in CHES 2015. It is a kind of lightweight block cipher provide various block and key size. In this paper, we proposed efficient parallel implementation of Simeck with GPGPU by using OpenCL and present performance of Simeck parallel implementation.

Efficient Pairing-Based Cryptography on Raspberry Pi. Reviewed

Yuki Nanjo, Md. Al-Amin Khandaker, Takuya Kusaka, Yasuyuki Nogami

JCM 13 ( 2 ) 88 - 93 2018

Publishing type：Research paper (scientific journal)

In the age of IoT, pairing-based cryptography (PBC) can play an important role as a public key cryptography since it enables several innovative protocols such as anonymous encryption, certificate less authentication and so on. However, due to the computation complexity, PBC is often regarded computationally unfeasible for IoT devices. Therefore, this paper tries to push that limit by efficiently calculating pairing operation together with scalar multiplication and exponentiation over Barreto-Naehrig (BN) curve by applying the state of art techniques. In addition to the theoretic explanation of the applied techniques, the authors also show a high-level implementation using C programming on a raspberry pi model 3 B, instead of hardware specific implementation.

DOI： 10.12720/jcm.13.2.88-93

Advanced Searchable Encryption: Keyword Search for Matrix-Type Storage. Reviewed

Yuta Kodera, Minoru Kuribayashi, Takuya Kusaka, Yasuyuki Nogami

Sixth International Symposium on Computing and Networking, CANDAR Workshops 2018, Takayama, Japan, November 27-30, 2018 292 - 297 2018

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

The recent development of IoT technologies and cloud storages, many types of information including private information have been gradually outsourced. For such a situation, new convenient functionalities such as arithmetic and keyword search on ciphertexts are required to allow users to retrieve information without leaking any information. Especially, searchable encryptions have been paid much attention to realize a keyword search on an encrypted domain. In addition, an architecture of searchable symmetric encryption (SSE) is a suitable and efficient solution for data outsourcing. In this paper, we focus on an SSE scheme which employs a secure index for searching a keyword with optimal search time. In the conventional studies, it has been widely considered that the scheme searches whether a queried keyword is contained in encrypted documents. On the other hand, we additionally take into account the location of a queried keyword in documents by targeting a matrix-type data format. It enables a manager to search personal information listed per line or column in CSV-like format data.

DOI： 10.1109/CANDARW.2018.00061

Linear Complexity of Geometric Sequences Defined by Cyclotomic Classes and Balanced Binary Sequences Constructed by the Geometric Sequences. Reviewed

Kazuyoshi Tsuchiya, Chiaki Ogawa, Yasuyuki Nogami, Satoshi Uehara

CoRR abs/1809.04957 2018

Side-Channel Attack using Order 4 Element against Curve25519 on ATmega328P.

Yoshinori Uetake, Akihiro Sanada, Takuya Kusaka, Yasuyuki Nogami, Leo Weissbart, Sylvain Duquesne

Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018 618 - 622 2018

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

With the matter of secure communication between devices, and especially for IoT devices, more and more applications need trustful protocols to communicate using public key cryptography. Elliptic curve cryptography is nowadays a very secure and efficient public key cryptography method. One of the most recent and secure curve is Curve25519 and one of its failure is attack on low-order elements during a Diffie-Hellman key exchange. This document demonstrates that an attack using an order 4 point is possible on an embedded system with a simple power analysis, pointing out every IoT using Curve255119 as a cryptographic method, a potential target to side-channel attacks.

DOI： 10.23919/ISITA.2018.8664293

Other Link： https://dblp.uni-trier.de/db/conf/isita/isita2018.html#UetakeSKNWD18

Design of a Message Authentication Protocol for CAN FD Based on Chaskey Lightweight MAC.

Guillaume Carel, Ryunosuke Isshiki, Takuya Kusaka, Yasuyuki Nogami, Shunsuke Araki

Proceedings - 2018 6th International Symposium on Computing and Networking Workshops, CANDARW 2018 267 - 271 2018

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

The development of the autonomous driving and the connected services severely increase security threats on old automotive technologies that are still present on-board vehicles since the long incremental process were employed. For example, the Controller Area Network (CAN) bus, which was standardized in 1991, can be connected to modern Linux embedded computer nodes where evil attacker might be able to exploit a vulnerability on the nodes. However, it is not easy to implement countermeasures on the CAN bus, since the strict requirements and limited performances of CAN specification. That is one of the major reason for the new standard CAN Flexible Data-rate (CAN FD) has been released in 2012 by Bosch to fill the gap between these challenges and the CAN protocol. In this research, a new simple authentication protocol for CAN FD is proposed, and the protocol is evaluated by experiments. The results show that the proposed protocol prevents infected nodes from usurping identity of a critical node and forge messages, with practical computational complexity on modern low-power embedding boards.

DOI： 10.1109/CANDARW.2018.00057

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

A Study on the Parameter of the Distinguished Point Method in Pollard's Rho Method for ECDLP. Reviewed

Ken Ikuta, Sho Joichi, Kazuya Kobayashi, Md. Al-Amin Khandaker, Takuya Kusaka, Yasuyuki Nogami

Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018 628 - 632 2018

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

In this research, the choice of the parameter for a method to generate distinguished rational points in Pollard's Rho method to solve the elliptic curve discrete logarithm problem for Barreto-Naehrig (BN) curves is shown. The structures of random walk paths are confirmed by experiments for several BN curves. From the results, the authors clarify the conditions in which the Rho method does not stop during an attack, and the authors also show an indication for the choice of the parameter for the method to generate distinguished points with large bits of ECDLP.

DOI： 10.23919/ISITA.2018.8664405

Development of an Omnidirectional Cooperative Transportation System Using Two Mobile Robots with Two Independently Driven Wheels.

Masanari Morishita, Shoichi Maeyama, Yasuyuki Nogami, Keigo Watanabe

Proceedings - 2018 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2018 2018 1711 - 1715 2018

Language：English Publisher：IEEE

In recent years, with the increase in physical distribution volume, unmanned transportation robots are expected as an alternative means of transporting baggage in factories and warehouses. The development of a control system for cooperative transportation by multiple robots is important when the objects to be transported are long and exceed the size and the weight limit. From this, we develop a control system for cooperative transportation using two robots independently driven by two wheels. In this paper, a communication system between two mobile robots and a host PC is constructed by using ROS, and a sub-goal is generated to each robot to realize a cooperative running with two robots. The effectiveness of the proposed method is verified through an experiment that the controlled point of an object is subject to a movement along the square of 1 m.

DOI： 10.1109/SMC.2018.00296

Other Link： https://dblp.uni-trier.de/db/conf/smc/smc2018.html#MorishitaMNW18

　 PREV - NEXT 　

1
2
3
4
5
6
7
8
9
10