Faculty Profiles - KODERA Yuuta

Papers - KODERA Yuuta

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

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

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

The 34th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC) 166 - 169 2019.6

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

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

The 34th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC) 158 - 161 2019.6

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

Fatema Akhter, Yuta Kodera, Yasuyuki Nogami, Takuya Kusaka

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

A Consideration on Generating Uniform Binary Sequence with High Linear Complexity Reviewed

Tomoya Tatara, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami

2019 IEEE International Conference on Consumer Electronics - Taiwan 2019.5

Boundary for the Linear Complexity of Well Balanced NTU Reviewed

Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami

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

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

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.4

Language：English 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

Scopus

researchmap

Bit Distribution of Binary Sequence Generated by Trace Function and Legendre Symbol Over Sub Extension Field Reviewed

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

The 6th International Conference on Information Technology: IoT and Smart City 92 - 96 2018.12

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

The authors of this paper have observed the distribution of bit patterns property of a binary sequence which is generated by using a primitive polynomial, trace function, and Legendre symbol over the sub extension field. However, one of the most important measure for evaluating the randomness of a sequence which is so called the distribution of bit patterns still has not been investigated. This paper focused on the distribution of bit patterns based on some experimental results. After observing many experimental results, the authors found that the number of appearance of each bit pattern is related to the number of zeros contained in each bit pattern. Furthermore, the authors formulated an equation to explain the distribution of bit patterns in a binary sequence.

DOI： 10.1145/3301551.3301562

Scopus

researchmap

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

Yuta Kodera, Minoru Kuribayashi, Takuya Kusaka, Yasuyuki Nogami

The Sixth International Symposium on Computing and Networking Workshops (CANDARW) 292 - 297 2018.11

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

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

Web of Science

researchmap

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

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

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E101-A ( 9 ) 1525 - 1536 2018.9

An Implementation of ECC with Twisted Montgomery Curve over 32nd Degree Tower Field on Arduino Uno. Reviewed

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

International Journal of Networking and Computing 8 ( 2 ) 341 - 350 2018.7

Linear Complexity of Pseudo-random Binary Sequence Generated Over Proper Sub Extension Field Reviewed

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

The 33th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC) 448 - 451 2018.7

Relation between the Irreducible Polynomials that Generates the Same Binary Sequence Over Odd Characteristic Field Reviewed

Md. Arshad Ali, Yuta Kodera, Taehwan Park, Takuya Kusaka, Yasuyuki Nogmi, Howon Kim

Journal of information and communication convergence engineering 16 ( 3 ) 166 - 172 2018.6

Language：English Publishing type：Research paper (scientific journal)

A pseudo-random sequence generated by using a primitive polynomial, trace function, and Legendre symbol has been researched in our previous work. Our previous sequence has some interesting features such as period, autocorrelation, and linear complexity. A pseudo-random sequence widely used in cryptography. However, from the aspect of the practical use in cryptographic systems sequence needs to generate swiftly. Our previous sequence generated by utilizing a primitive polynomial, however, finding a primitive polynomial requires high calculating cost when the degree or the characteristic is large. It's a shortcoming of our previous work. The main contribution of this work is to find some relation between the generated sequence and irreducible polynomials. The purpose of this relationship is to generate the same sequence without utilizing a primitive polynomial. From the experimental observation, it is found that there are (p - 1)/2 kinds of polynomial, which generates the same sequence. In addition, some of these polynomials are non-primitive polynomial. In this paper, these relationships between the sequence and the polynomials are shown by some examples. Furthermore, these relationships are proven theoretically also.

DOI： 10.6109/jicce.2018.16.3.166

Scopus

researchmap

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

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

2018 IEEE International Conference on Consumer Electronics – Taiwan 2018.5

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

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

2018 IEEE International Conference on Consumer Electronics – Taiwan 2018.5

Uniform Binary Sequence Generated over Odd Characteristic Field Reviewed

Yuta Kodera, Takuya Kusaka, Ali Md. Arshad, Yasuyuki Nogami, Takeru Miyazak, Satoshi Uehara

International Journal of Information and Electronics Engineering 8 ( 1 ) 5 - 9 2018.3

Efficient Optimal Ate Pairing at 128-Bit Security Level Reviewed

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

INDOCRYPT 2017 LNCS 10698 186 - 205 2017.12

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

Following the emergence of Kim and Barbulescu's new number field sieve (exTNFS) algorithm at CRYPTO'16 [21] for solving discrete logarithm problem (DLP) over the finite field; pairing-based cryptography researchers are intrigued to find new parameters that confirm standard security levels against exTNFS. Recently, Barbulescu and Duquesne have suggested new parameters [3] for well-studied pairing-friendly curves i.e., Barreto-Naehrig (BN) [5], Barreto-Lynn-Scott (BLS12) [4] and Kachisa-Schaefer-Scott (KSS-16) [19] curves at 128-bit security level (twist and sub-group attack secure). They have also concluded that in the context of Optimal-Ate pairing with their suggested parameters, BLS-12 and KSS-16 curves are more efficient choices than BN curves. Therefore, this paper selects the atypical and less studied pairingfriendly curve in literature, i.e., KSS-16 which offers quartic twist, while BN and BLS-12 curves have sextic twist. In this paper, the authors optimize Miller's algorithm of Optimal-Ate pairing for the KSS-16 curve by deriving efficient sparse multiplication and implement them. Furthermore, this paper concentrates on the Miller's algorithm to experimentally verify Barbulescu et al.'s estimation. The result shows that Miller's algorithm time with the derived pseudo 8-sparse multiplication is most efficient for KSS-16 than other two curves. Therefore, this paper defends Barbulescu and Duquesne's conclusion for 128-bit security.

DOI： 10.1007/978-3-319-71667-1_10

Web of Science

researchmap

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

The Fifth International Symposium on Computing and Networking 283 - 294 2017.11

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

The Fifth International Symposium on Computing and Networking 451 - 455 2017.11

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 2017.6

Efficient Optimal Ate Pairing at 128-Bit Security Level.

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

Progress in Cryptology - INDOCRYPT 2017 - 18th International Conference on Cryptology in India(INDOCRYPT) 186 - 205 2017

　 PREV - NEXT 　

< KODERA Yuuta >

Papers - KODERA Yuuta