Faculty Profiles - NOGAMI Yasuyuki

Papers - NOGAMI Yasuyuki

Division display 121 - 140 of about 188 ／ All the affair displays >>

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, Ali Md. Arshad, Yasuyuki Nogami

IEICE Transactions 101-A ( 8 ) 1235 - 1244 2018

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

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

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

Consideration of Efficient Pairing Applying Two Construction Methods of Extension Fields. Reviewed

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

Sixth International Symposium on Computing and Networking 445 - 451 2018

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

2018 INTERNATIONAL SYMPOSIUM ON ELECTROMAGNETIC COMPATIBILITY (EMC EUROPE) 439 - 444 2018

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

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.

Evaluating the Maximum Order Complexity of a Uniformly distributed Sequence over Odd Characteristic

Yuta Kodera, Takuya Kusaka, Takeru Miyazaki, Yasuyuki Nogami, Satoshi Uehara, Robert H. Morelos-Zaragoza

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

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

This paper focuses on the Maximum Order Complexity of a pseudorandom sequence for security applications called NTU sequence. It shows the maximum feature on the nonlinear property and several properties have been theoretically proven. However, the NTU sequence requires a uniformization technique to overcome the drawback on its bits distribution. The technique has already proposed but the non-liear feature still has not investigated. Therefore, this paper evaluates the affects on the non-linear feature of the original NTU sequence by using Maximum Order Complexity.

Pseudo Random Ternary Sequence and Its Autocorrelation Property Over Finite Field

Md. Arshad Ali, Emran Ali, Md. Ahsan Habib, Md. Nadim, Takuya Kusaka, Yasuyuki Nogami

International Journal of Computer Network and Information Security 9 ( 9 ) 54 - 63 2017.9

Detecting falsification to MP3 audio signals for conference record using digital watermarking Reviewed

Tomoki Yoshida, Takeru Miyazaki, Shunsuke Araki, Satoshi Uehara, Yasuyuki Nogami

2017 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2017 253 - 254 2017.7

Language：English Publishing type：Research paper (international conference proceedings) Publisher：Institute of Electrical and Electronics Engineers Inc.

In this paper, we will propose a digital watermarking for voice signals recorded by a digital voice recorder especially in conferences. We will discuss some requirements for detecting falsifications in the voice signal, because the conference record has the probability that a conclusion is changed for only a falsification in a little time interval. Next, we will show a method of locating an altered place in the voice signal and a new idea applying a white Gaussian noise for guarantee of the valid voice signal without falsification. One characteristic of our proposal is an agitation depending on a peak spectrum for making it difficult to illegally change the embedded watermark.

DOI： 10.1109/ICCE-China.2017.7991091

Distribution of bit patterns on multi-value sequence over odd characteristics field Reviewed

Yuta Kodera, Takeru Miyazaki, Md Al Amin Khandaker, Ali Md Arshad, Yasuyuki Nogami, Satoshi Uehara

2017 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2017 137 - 138 2017.7

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

© 2017 IEEE. The Internet of Things (IoT) provides much convenient life for us, at the same time it has brought threats for our privacy. In this context, secure and efficient cryptosystem is required to which pseudorandom sequence plays an important role. Especially, the distribution of bit patterns in the pseudorandom sequence is one of important security aspects. This paper especially focuses on the bit patterns and the distribution in an NTU sequence. As a result of a lot of observation, an important assumption about the distribution of bit patterns in an NTU sequence is introduced. It will help to obtain the balanced NTU sequence in order to enhance the security of cryptosystem on IoT communications.

DOI： 10.1109/ICCE-China.2017.7991033

Security analysis of Raspberry Pi against Side-channel attack with RSA cryptography Reviewed

Akihiro Sanada, Yasuyuki Nogami, Kengo Iokibe, Md Al Amin Khandaker

2017 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2017 287 - 288 2017.7

Multi-value sequence generated by trace function and power residue symbol over proper sub extension field

Ali Md Arshad, Takeru Miyazaki, Yasuyuki Nogami, Satoshi Uehara, Robert Morelos-Zaragoza

2017 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2017 249 - 250 2017.7

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

The authors in this paper have proposed a multi-value sequence generated by a primitive polynomial, trace function, k-th power residue symbol, and a certain mapping function over the proper sub extension field. Here, the trace function actually maps an element of the extension field to an element of the proper sub extension field, which is actually a vector space. The distribution of numbers within the sequence becomes more balanced by considering the proper sub extension field. In addition, its period and autocorrelation properties also observed in this paper.

DOI： 10.1109/ICCE-China.2017.7991089

Solving 114-Bit ECDLP for a Barreto-Naehrig Curve. Reviewed

Takuya Kusaka, Sho Joichi, Ken Ikuta, Md. Al-Amin Khandaker, Yasuyuki Nogami, Satoshi Uehara, Nariyoshi Yamai, Sylvain Duquesne

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10779 LNCS 231 - 244 2017

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

The security of cryptographic protocols which are based on elliptic curve cryptography relies on the intractability of elliptic curve discrete logarithm problem (ECDLP). In this paper, the authors describe techniques applied to solve 114-bit ECDLP in Barreto-Naehrig (BN) curve defined over the odd characteristic field. Unlike generic elliptic curves, BN curve holds an especial interest since it is well studied in pairing-based cryptography. Till the date of our knowledge, the previous record for solving ECDLP in a prime field was 112-bit by Bos et al. in Certicom curve ‘secp112r1’. This work sets a new record by solving 114-bit prime field ECDLP of BN curve using Pollard’s rho method. The authors utilized sextic twist property of the BN curve to efficiently carry out the random walk of Pollard’s rho method. The parallel implementation of the rho method by adopting a client-server model, using 2000 CPU cores took about 6 months to solve the ECDLP.

DOI： 10.1007/978-3-319-78556-1_13

Some properties of Z4 sequences obtained by using the gray code mapping from two binary m-sequences. Reviewed

Masahiro Goto, Satoshi Uehara, Yasuyuki Nogami

Eighth International Workshop on Signal Design and Its Applications in Communications, IWSDA 2017, Sapporo, Japan, September 24-28, 2017 182 - 186 2017

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

This paper shows some of fundamental properties of Z4 sequences of combining each element of a preferred pair of binary m-sequences by using the Gray code mapping. The distribution of elements {0,1,2,3} within one period can be exactly derived from auto/cross-correlation values of Gold sequences or Gold-like sequences. In addition, this paper shows properties such that the Z4 sequences have near-optimum correlation properties.

DOI： 10.1109/IWSDA.2017.8097082

Linear complexity of pseudo random binary sequence generated by trace function and Legendre symbol over proper sub extension field. Reviewed

Ali Md. Arshad, Takeru Miyazaki, Shoji Heguri, Yasuyuki Nogami, Satoshi Uehara, Robert Morelos-Zaragoza

Eighth International Workshop on Signal Design and Its Applications in Communications, IWSDA 2017, Sapporo, Japan, September 24-28, 2017 84 - 88 2017

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

The authors have proposed an approach for generating a pseudo random binary sequence by using primitive polynomial, trace function, and Legendre symbol over the proper sub extension field. There are many uses of pseudo random binary sequence in security applications. The linear complexity of a sequence is considered as the most important property to be analyzed in these types of applications. In this paper, the authors have restricted the discussion on the linear complexity and linear complexity profile properties of the proposed sequence based on some experimental results. According to the results, the proposed sequence always holds a maximum value of the linear complexity.

DOI： 10.1109/IWSDA.2017.8095741

Linear complexity of generalized NTU sequences. Reviewed

Kazuyoshi Tsuchiya, Chiaki Ogawa, Yasuyuki Nogami, Satoshi Uehara

Eighth International Workshop on Signal Design and Its Applications in Communications, IWSDA 2017, Sapporo, Japan, September 24-28, 2017 74 - 78 2017

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

Pseudorandom number generators are required to generate pseudorandom numbers which have not only good statistical properties but also unpredictability in cryptography. A geometric sequence is a sequence given by applying a nonlinear feedforward function to an m-sequence. Nogami, Tada and Uehara proposed a geometric sequence whose nonlinear feedforward function is given by the Legendre symbol, and showed the period, periodic autocorrelation and linear complexity of the sequence. Furthermore, Nogami et al. proposed a generalization of the sequence (this sequence is referred to as the generalized NTU sequence), and showed the period and periodic autocorrelation. In this paper, we investigate the linear complexity of the generalized NTU sequences. Under some conditions, we can ensure that generalized NTU sequences have large linear complexity from the results on linear complexity of Sidel'nikov sequences.

DOI： 10.1109/IWSDA.2017.8095739

An Efficient Implementation of Trace Calculation over Finite Field for a Pseudorandom Sequence. Reviewed

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

Fifth International Symposium on Computing and Networking, CANDAR 2017, Aomori, Japan, November 19-22, 2017 2018-January 451 - 455 2017

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

Trace function is a well known index of finite field theory and practically, it is used for some security applications. However, present trace calculation with binary method is far from the practice on an IoT device. This paper considers an efficient trace calculation without vector multiplication by focusing on the matrix representation and the linearity of trace function. By using pre-computation, a trace calculation is executed by m times multiplication and the memory consumption is 4m bytes. This paper especially uses a pseudorandom generator called NTU sequence to show the efficiency because it has paid much attention as a random generator for security applications. When considering 128-bit length of periodic sequence with NTU sequence for security applications, parameters will be p = 7 and m = 50. From the experimental results, a trace calculation with them will be executed within 5[μs], and the memory consumption is 200 bytes which is 0:625% of the storage in Arduino Uno. Therefore, this work contributes to implementing an efficient trace calculation on an IoT device with low memory consumption.

DOI： 10.1109/CANDAR.2017.86

An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication Reviewed

Khandaker, Md Al-Amin, Ono, Hirotaka, Nogami, Yasuyuki, Shirase, Masaaki, Duquesne, Sylvain

INFORMATION SECURITY AND CRYPTOLOGY - ICISC 2016 10157 208 - 219 2017

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

Acceleration of a pairing calculation of an Ate-based pairing such as Optimal Ate pairing depends not only on the optimization of Miller algorithm's loop parameter but also on efficient elliptic curve arithmetic operation and efficient final exponentiation. Some recent works have shown the implementation of Optimal Ate pairing over Kachisa-Schaefer-Scott (KSS) curve of embedding degree 18. Pairing over KSS curve is regarded as the basis of next generation security protocols. This paper has proposed a pseudo 12-sparse multiplication to accelerate Miller's loop calculation in KSS curve by utilizing the property of rational point groups. In addition, this papers has showed an enhancement of the elliptic curve addition and doubling calculation in Miller's algorithm by applying implicit mapping of its sextic twisted isomorphic group. Moreover this paper has implemented the proposal with recommended security parameter settings for KSS curve at 192 bit security level. The simulation result shows that the proposed pseudo 12-sparse multiplication gives more efficient Miller's loop calculation of an Optimal Ate pairing operation along with recommended parameters than pairing calculation without sparse multiplication.

DOI： 10.1007/978-3-319-53177-9_11

Other Link： https://dblp.uni-trier.de/db/conf/icisc/icisc2016.html#KhandakerONSD16

Distribution of Bit Patterns on Multi-value Sequence over Odd Characteristics Field Reviewed

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

2017 IEEE INTERNATIONAL CONFERENCE ON CONSUMER ELECTRONICS - TAIWAN (ICCE-TW) 137 - 138 2017

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

The Internet of Things (IoT) provides much convenient life for us, at the same time it has brought threats for our privacy. In this context, secure and efficient cryptosystem is required to which pseudorandom sequence plays an important role. Especially, the distribution of bit patterns in the pseudorandom sequence is one of important security aspects. This paper especially focuses on the bit patterns and the distribution in an NTU sequence. As a result of a lot of observation, an important assumption about the distribution of bit patterns in an NTU sequence is introduced. It will help to obtain the balanced NTU sequence in order to enhance the security of cryptosystem on IoT communications.

DOI： 10.1109/ICCE-China.2017.7991033

Security Analysis of Raspberry Pi Against Side-Channel Attack with RSA Cryptography Reviewed

Sanada, Akihiro, Nogami, Yasuyuki, Iokibe, Kengo, Khandaker, Md. Al-Amin

2017 IEEE INTERNATIONAL CONFERENCE ON CONSUMER ELECTRONICS - TAIWAN (ICCE-TW) 287 - 288 2017

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

In this paper, the authors apply two modular exponentiation algorithms such as left-to-right binary method and Montgomery powering ladder algorithm on Raspberry Pi and evaluate their security against Side-channel attack.

DOI： 10.1109/ICCE-China.2017.7991108

Efficient Optimal Ate Pairing at 128-bit Security Level. Reviewed

Md. Al-Amin Khandaker, Yuki Nanjo, Loubna Ghammam, Sylvain Duquesne, Yasuyuki Nogami, Yuta Kodera

IACR Cryptology ePrint Archive 2017 1174 - 1174 2017

Parallel Implementations of SIMON and SPECK, Revisited. Reviewed

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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10763 LNCS 283 - 294 2017

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

In this paper, we revisited the parallel implementation of SIMON and SPECK block ciphers. The performances of SIMON and SPECK are significantly improved by using ARM NEON SIMD (Single Instruction Multiple Data) parallel computing and OpenMP SIMT (Single Instruction Multiple Thread). We optimized the implementation on ARM NEON architecture. For optimized NEON, we reduced the number of registers for round key and increased the number of registers for plaintexts. Furthermore, we proposed the efficient forward and backward alignment methods. Finally, we maximize the performance by using SIMT (Single Instruction Multiple Threads). In the case of performance of proposed methods and proposed methods with SIMT, SIMON 128/128 encryption within 32.4, 14.3 cycles/byte, SIMON 128/192 encryption within 30.1, 15.9 cycles/byte, SIMON 128/256 encryption within 32.4, 16.9 cycles/byte, SPECK 128/128 encryption within 9.7, 5.1 cycles/byte, SPECK 128/192 encryption within 10.4, 5.6 cycles/byte, SPECK 128/256 encryption within 11.0, and 5.6 cycles/byte respectively on ARM Cortex-A53 environment.

DOI： 10.1007/978-3-319-93563-8_24

　 PREV - NEXT 　

1
2
3
4
5
6
7
8
9
10