Faculty Profiles - NOGAMI Yasuyuki

Papers - NOGAMI Yasuyuki

Division display 81 - 100 of about 188 ／ All the affair displays >>

A Study on Low Level Quantizers for Block Turbo Decoding for Product Codes of Binary Linear Code

Shinichi Kageyama, Ken Ikuta, Takuya Kusaka, Yasuyuki Nogami

34th International Technical Conference on Circuits/Systems, Computers and Communications, ITC-CSCC 2019 233 - 236 2019.6

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

Block Turbo Decodings (BTDs) with Soft-In Soft-Out (SISO) decodings for two dimensional product codes of linear codes can achieve good error performance, however, large computational complexity of the BTDs can be a problem. Therefore, to reduce the computational complexity, quantization methods can be employed for the BTDs by sacrificing the error performance. In this paper, a study on design for low level quantizers for the BTD with S1SO Ordered Statistics Decoding for product codes of binary linear code is shown. From simulation results for a 4-level quantizer, the authors propose a new 5-level quantizer. The proposed 5-level quantizer achieves better error performance than 4-level quantizer.

DOI： 10.1109/ITC-CSCC.2019.8793409

Boundary for the Linear Complexity of Well Balanced NTU

Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami

2019 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2019 2019.5

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

A pseudorandom sequence has an inseparable role in various types of security applications. Especially, the linear complexity of a sequence is a measure of the randomness that should be large for secureness of a system. This paper considers the boundary of linear complexity of a geometric sequence called NTU sequence which is generated with a uniformization technique.

DOI： 10.1109/ICCE-TW46550.2019.8992029

A Consideration on Generating Uniform Binary Sequence with High Linear Complexity

Tomoya Tatara, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami

2019 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2019 2019.5

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

Pseudorandom sequences of having a uniform distribution of bit patterns and high linear complexity play a key role in many security applications. However, only a few pseudorandom sequence possesses both of these vital features. In this paper, the authors propose and evaluate a geometric sequence that has a uniform distribution and high linear complexity.

DOI： 10.1109/ICCE-TW46550.2019.8991711

NIST Statistical Test for Random Sequence Generated by Möbius Function

Fatema Akhter, Yuta Kodera, Yasuyuki Nogami, Takuya Kusaka

2019 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2019 2019.5

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

Random sequences play important roles in many security applications. Several security protocols have been developed based on random sequences. Hence, their generation is one of the topic of interests among many cryptographic researchers. Previously, the authors proposed a pseudo random sequence over odd characteristic field which is generated by applying primitive polynomial, trace function and Mobius function. Some important properties such as period, autocorrelation and cross-correlation have been presented in previous work. Randomness is generally measured by statistical tests and NIST Statistical Test Suite (NIST STS) is one of the most popular tools for randomness analysis. In this work, the randomness of the generated sequence is investigated by NIST STS.

DOI： 10.1109/ICCE-TW46550.2019.8992033

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 2019.3

Publishing type：Research paper (international conference proceedings)

© 2018 IEICE. 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

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 2019.3

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

© 2018 IEICE. 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

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

Development of Practicum in Cryptographic Hard-ware Security Using Commercial Microcontroller Module

Kengo Iokibe, Yoshinori Uetake, Toshiaki Teshima, Akihiro Sanada, Yasuyuki Nogami

Computer Software 36 ( 1 ) 30 - 36 2019

Language：Japanese Publisher：Japan Society for Software Science and Technology

The authors developed a practicum in the cryptographic technology, an indispensable technology to guar- A ntee information security in the upcoming IoT era. The practicum is composed of a lecture in a part of algebra and discrete mathematics that founds modern cryptography, hardware implementation of crypto-graphic algorithms, and the side-channel attack on cryptographic hardware. It aimed not only that students learned textbook knowledge of cryptographic algorithms but also they developed their knowledge of imple-menting cryptographic algorithms considering the threat of the side-channel attack through their experience implementing the algorithms on a commercial hardware and attacking them. The practicum was offered to the third- A nd fourth-year students, and most of them achieved the required goal of the practicum. They also realized improving their practical skills in the cryptographic technology according to their responses to the questionnaire.

DOI： 10.11309/jssst.36.30

Properties of Knuth's Quadratic Congruential Sequences with Modulus m = 2W p.

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

2019 9th International Workshop on Signal Design and its Applications in Communications, IWSDA 2019 1 - 5 2019

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

In this paper, we give some important characteristics of Knuth's quadratic congruential sequences with a particular modulus as a pseudorandom number generator. For modulus m = 2W p where p is an odd prime, we derive some periodic relations of the sequence by using analysis results shown by Iwasaki and Umeno for their one-stroke polynomial. Accordingly, we have theoretical analysis for randomness of these sequences and evaluate pseudorandom number outputs by these sequences by the NIST statistical tests.

DOI： 10.1109/IWSDA46143.2019.8966096

Other Link： https://dblp.uni-trier.de/db/conf/iwsda/iwsda2019.html#MiyazakiAKUN19

Decomposing the Inverse of a Masked Vector in an Isomorphic Galois Field for Perfectly Masked S-Box.

Yuta Kodera, Yuki Taketa, Takuya Kusaka, Yasuyuki Nogami

Proceedings - 2019 7th International Symposium on Computing and Networking, CANDAR 2019 157 - 163 2019

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

The increment of opportunities for using machine learning (ML) technologies has brought a new threat to cryptosystems. As a remarkable example, the ML technologies have gradually been employed in the side-channel attack (SCA) to obtain sensitive information. In this paper, the authors focus on the structure of a masked S-Box in AES, which aims to equip the SCA resistance even for the attacks using the ML technologies. More precisely, this paper analyzes the mathematical structure of the inverse operation over F(24)2 which is an isomorphic field for obtaining efficient arithmetic for the AES, so that all functions in the encryption scheme can handle masked data as it is. The mathematical structure is realized by introducing several mathematical tools such as the Gauss periods and the Itoh-Tsujii inversion algorithm, and as a result, we clarified the factors of the coefficients of A-1 for an element A F(24)2. It enables us to generate the corresponding element directly, which allows canceling the mask even after processing the SubBytes.

DOI： 10.1109/CANDAR.2019.00027

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

A Construction of a Keyword Search to Allow Partial Matching with a Block Cipher

Yuta Kodera, Minoru Kuribayashi, Takuya Kusaka, Yasuyuki Nogami

Information Security Applications 11402 LNCS 241 - 252 2019

Publishing type：Part of collection (book) Publisher：Springer International Publishing

This paper considers a new construction of a keyword search including partial matching on an encrypted document. Typically, an index-based searchable symmetric encryption has been investigated. However, it makes a partial keyword matching difficult without a designated trapdoor. Thus, our objective is to propose a keyword search scheme which enables us to search a part of a keyword only by building trapdoors of each original keyword. The main idea is to insulate each character of a keyword into a bitstream of the sequence generated by a pseudorandom number generator. It achieves a partial search by giving a restriction on the length of a keyword.

DOI： 10.1007/978-3-030-17982-3_19

Distribution of Bit Patterns in Binary Sequence Generated Over Sub Extension Field

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

Advances in Science, Technology and Engineering Systems Journal 4 ( 2 ) 370 - 379 2019

Publishing type：Research paper (scientific journal) Publisher：ASTES Journal

The distribution of bit patterns is an important measure to check the randomness of a sequence. The authors of this paper observed this crucial property in a binary sequence which generated by using a primitive polynomial, trace function, and Legendre symbol defined over the sub extension field. The authors create a new dimension in the sequence generation research area by considering the sub extension field, whereas all our previous works are focused in the prime field. In terms of distribution of bit patterns property, this research work has notable outcomes more specifically the binary sequence (defined over the sub extension field) holds much better (close to uniform) bit distribution than the previous binary sequence (defined over the prime field). Furthermore, the authors theoretically proved the distribution of bit property in this paper.

DOI： 10.25046/aj040246

Efficient ate-based pairing over the attractive classes of BN curves Reviewed

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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 11402 LNCS 55 - 67 2019

Publishing type：Research paper (international conference proceedings)

© Springer Nature Switzerland AG 2019. This paper proposes two attractive classes of Barreto-Naehrig curve for ate-based pairing by imposing certain condition χ ≡ 7, 11 (mod 12) on the integer χ that parameterizes the curve settings. The restriction results in an unparalleled way to determine a BN curve, its twisted curve coefficients, and obvious generator points. The proposed χ ≡ 11 (mod 12) are found to be more efficient than χ ≡ 7 (mod 12) together with pseudo 8-sparse multiplication in Miller's algorithm. The authors also provide comparative implementations for the proposal.

DOI： 10.1007/978-3-030-17982-3_5

A Preliminary Study on Methods to Eliminate Short Fruitless Cycles for Pollard's Rho Method for ECDLP over BN Curves.

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

Proceedings - 2019 7th International Symposium on Computing and Networking Workshops, CANDARW 2019 353 - 359 2019

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

This paper discusses the conditions of fruitless cycles for Pollard's rho method with skew Frobenius mapping for elliptic curve discrete logarithm problem (ECDLP) over a Barreto-Naehrig (BN) curve. When a random walk pass achieves a fruitless cycle, the random walk pass must restart with a different starting point. There can be several methods to eliminate fruitless cycles of short lengths for BN curves based on the construction of a random walk table. Therefore, in this research, the authors give an analysis of the previous methods for a BN curve of order 349 with the mapping with experiments. The results show that several fruitless cycles of length two and three cannot be eliminated by the previous methods. The authors investigated the reason for degradation. As a result of the analysis, a new condition where a part of the fruitless cycles of any lengths occur is derived, and a new method to eliminate the fruitless cycles is proposed.

DOI： 10.1109/CANDARW.2019.00068

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

Evaluating a Side-Channel Resistance against Order 4 Rational Points in Arduino Cryptography Library.

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

Proceedings - 2019 7th International Symposium on Computing and Networking, CANDAR 2019 245 - 250 2019

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

Curve25519 has been used in various security protocols for its efficiency and rapidity. However, Curve25519 is known to have rational points whose orders are 2, 4, and 8. In this research, the authors focus on rational points of order 4 and demonstrate a side-channel attack (SCA) against a scalar multiplication algorithm for Curve25519. It purposes to compare two scalar multiplication algorithms in terms of the difficulty of estimating a secret key via the SCA, where the algorithms are differentiated whether it uses a conditional swap function or not. Furthermore, we examine to attack an open-source library for Arduino UNO which includes the scalar multiplication algorithm using a conditional swap function in practice. Since this library takes a countermeasure against the SCA during key exchange, we can use this secure library as a protocol tool. However, there is a threat when we implement a scalar multiplication by using some functions in this library without considering the SCA.

DOI： 10.1109/CANDAR.2019.00040

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

A Side-Channel Attack Using Order 8 Rational Points against Curve25519 on an 8-Bit Microcontroller.

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

Proceedings - 2019 7th International Symposium on Computing and Networking, CANDAR 2019 225 - 231 2019

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

Among the increasing evolution of IoT devices, practical applications need reliable secure protocols to communicate with each other. A major issue for modern cryptosystems is an implementation of secure and trustworthy mechanisms to rely on. A side-channel attack against these cryptosystems may overturn the guarantee of security against conventional cyber-attacks. Elliptic curve cryptography is public-key cryptography based on elliptic curves, and one of the well-known curves is Curve25519 which is used for TLS protocols as a recommended curve. This curve is mainly implemented on limited resource devices such as microcontrollers. However, this curve poses a weakness for low-order points during a Diffie-Hellman key exchange is employed. This research demonstrates possible exploitation of a threat of order 8 rational points of Curve25519 and shows results of the side-channel attacks using order 8 rational points on an embedded system. The results indicate the order 8 rational points might be applied to key extraction as attacker sides.

DOI： 10.1109/CANDAR.2019.00037

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

A Performance Analysis and Evaluation of SIDH with Implementation-Friendly Classes of Quadratic Extension Fields.

Yuki Nanjo, Masaaki Shirase, Takuya Kusaka, Yasuyuki Nogami

Proceedings - 2019 7th International Symposium on Computing and Networking, CANDAR 2019 178 - 184 2019

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

It is well-known that the class of binomial extension fields is widely used to construct quadratic extension fields (QEFs) of supersingular isogeny Diffie-Hellman (SIDH) key exchange protocol. There is a possibility to improve the performance of SIDH by employing other classes of QEFs, i.e., extension fields with normal basis and all-one polynomial extension fields, without sacrificing the range of primes. In this paper, the authors confirm that the applicability of the other classes for SIDH and evaluate the computational complexity of the large-degree isogenies required for SIDH. The results of the experiments show that the performances with the classes are comparable to the QEF with a binomial x2+1.

DOI： 10.1109/CANDAR.2019.00030

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

Relations Between Evaluations of NIST Tests and Lyapunov Exponents of Sequences Generated by the Piecewise Logistic Map over Integers.

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

2019 9th International Workshop on Signal Design and its Applications in Communications, IWSDA 2019 1 - 5 2019

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

In this paper, we focus on binary sequences obtained from piecewise logistic map over integers, and show the relation between the Lyapunov exponents of the maps and results of the NIST tests for the sequences. When the Lyapunov exponent is a negative value, we confirm that the branch diagram is sparse and the bit occurrence rate is also greatly biased. We also give a sample of that the positive/negative signs of the Lyapunov exponents mostly coincide on the evaluations of the NIST tests. From the branching diagram of the piecewise logistic map, we can moreover find that there are many good pseudorandom sequences generated by the individual control parameters of the map.

DOI： 10.1109/IWSDA46143.2019.8966109

Other Link： https://dblp.uni-trier.de/db/conf/iwsda/iwsda2019.html#EguchiMAUN19

An Analysis of Computational Complexity of Low Level Quantizers for Block Turbo Decoding for Product Codes of Binary Linear Code.

Shinichi Kageyama, Ken Ikuta, Yuki Nanjo, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami

Proceedings - 2019 7th International Symposium on Computing and Networking Workshops, CANDARW 2019 425 - 429 2019

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

Block Turbo Decodings (BTDs) with Soft-In SoftOut (SISO) decodings for two-dimensional product codes of linear codes can achieve good error performance. However, since large computational complexity of the BTDs can be a problem, a method which can reduce average computational complexity is needed. In this research, the authors focus on an early termination condition as the method for the reduction on the computational complexity. From the tendency of the output of SISO ordered statistics decoding, a condition is proposed. Based on simulation results for the two-dimensional product code of the (32,26,4) Reed-Muller code, analysis on a parameter of the condition are given. The results show that the computational complexity can be reduced to more than one fourth at the SN ratios higher than 7[dB] of Eb/No without degradation on error performance by choosing an appropriate parameter.

DOI： 10.1109/CANDARW.2019.00080

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

Binary Sequence Generated by Alternative Trace Map Function and Its Properties.

Fatema Akhter, Yasuyuki Nogami, Takuya Kusaka, Yuki Taketa, Tomoya Tatara

Proceedings - 2019 7th International Symposium on Computing and Networking Workshops, CANDARW 2019 408 - 411 2019

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

In this paper, we propose a new pseudo random binary sequence generated from a primitive polynomial over an extension field. The sequence has maximum period and high linear complexity suitable for security applications. While generation, a new mapping function is proposed which is faster than conventional trace map and translates extension field elements to prime field elements. The output of mapping function is a p-ary sequence with elements 0~ (p-1) that is balanced in pattern distribution and has ideal autocorrelation. Then, a binarization method is utilized to derive binary sequence from p-ary sequence. Period, autocorrelation, linear complexity and computation time of the proposed sequence are studied and experimental results are presented. Finally, the efficiency of the proposal is verified by comparing with existing sequences in terms of period, linear complexity and generation time for sequences of different length.

DOI： 10.1109/CANDARW.2019.00076

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

Recognition of parking spaces on dry and wet road surfaces using received light intensity of laser for ultra small EVs.

Tatsuya Kamiyama, Shoichi Maeyama, Kazuya Okawa, Keigo Watanabe, Yasuyuki Nogami

Proceedings of the 2019 IEEE/SICE International Symposium on System Integration, SII 2019 494 - 501 2019

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

Research and development of automatic driving technology has been actively conducted in recent years. Under this background, it is considered that the car parking problem is expected to be developed for supporting drivers to complete automatic parking. Many parking lots in an urban area prepare parking spaces with asphalt road surface drawn by white paint. Research to recognize parking spaces using camera images has been conducted so far. However, camera images are known to be not robust to environmental conditions such as nighttime and a backlight. Therefore, a method of recognizing parking spaces is proposed so that it can be used even when the use time is day or night, irrespective of whether the road surface is dry or wet. In the proposed method, the road surface is classified using the statistical model of the received light intensity value of laser range scanner. Then, the target parking position is estimated by Hough transformation.

DOI： 10.1109/SII.2019.8700344

Other Link： https://dblp.uni-trier.de/db/conf/sii/sii2019.html#KamiyamaMOWN19

　 PREV - NEXT 　

1
2
3
4
5
6
7
8
9
10