| FullText URL | fulltext.pdf |
|---|---|
| Author | He, Yixuan| Kodera, Yuta| Nogami, Yasuyuki| Huda, Samsul| |
| Keywords | proactive secret sharing user revocation threshold homomorphic encryption non-interactive |
| Published Date | 2025-12-11 |
| Publication Title | Cryptography |
| Volume | volume9 |
| Issue | issue4 |
| Publisher | MDPI AG |
| Start Page | 80 |
| ISSN | 2410-387X |
| Content Type | Journal Article |
| language | English |
| OAI-PMH Set | 岡山大学 |
| Copyright Holders | © 2025 by the authors. |
| File Version | publisher |
| DOI | 10.3390/cryptography9040080 |
| Web of Science KeyUT | 001646191700001 |
| Related Url | isVersionOf https://doi.org/10.3390/cryptography9040080 |
| FullText URL | fulltext.pdf |
|---|---|
| Author | Rahayu, Maya| Hossain, Md. Biplob| Huda, Samsul| Nogami, Yasuyuki| |
| Keywords | VANET security blockchain integrated authentication server Kerberos authentication Vehicular Ad Hoc Network |
| Published Date | 2025-10-30 |
| Publication Title | Sensors |
| Volume | volume25 |
| Issue | issue21 |
| Publisher | MDPI AG |
| Start Page | 6651 |
| ISSN | 1424-8220 |
| Content Type | Journal Article |
| language | English |
| OAI-PMH Set | 岡山大学 |
| Copyright Holders | © 2025 by the authors. |
| File Version | publisher |
| PubMed ID | 41228874 |
| DOI | 10.3390/s25216651 |
| Web of Science KeyUT | 001613035900001 |
| Related Url | isVersionOf https://doi.org/10.3390/s25216651 |
| FullText URL | fulltext.pdf |
|---|---|
| Author | Huda, Samsul| Musthafa, Muhammad Bisri| Shamim, S. M.| Nogami, Yasuyuki| |
| Keywords | agricultural IoT Zeek IDS intrusion detection systems open-source security tools Agriculture 4.0 cybersecurity Raspberry Pi |
| Published Date | 2025-10-16 |
| Publication Title | Journal of Computational and Cognitive Engineering |
| Volume | volume5 |
| Issue | issue1 |
| Publisher | BON VIEW PUBLISHING PTE |
| Start Page | 133 |
| End Page | 142 |
| ISSN | 2810-9503 |
| Content Type | Journal Article |
| language | English |
| OAI-PMH Set | 岡山大学 |
| Copyright Holders | © The Author(s) 2025. |
| File Version | publisher |
| DOI | 10.47852/bonviewjcce52026303 |
| Related Url | isVersionOf https://doi.org/10.47852/bonviewjcce52026303 |
| FullText URL | fulltext.pdf |
|---|---|
| Author | Musthafa, Muhammad Bisri| Huda, Samsul| Nguyen, Tuy Tan| Kodera, Yuta| Nogami, Yasuyuki| |
| Keywords | Internet of things intrusion detection system stacked lstm pruning model optimizing model quantization model raspberry pi real-time detection apache kafka |
| Published Date | 2025-06-30 |
| Publication Title | IEEE Access |
| Volume | volume13 |
| Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| Start Page | 113544 |
| End Page | 113556 |
| ISSN | 2169-3536 |
| Content Type | Journal Article |
| language | English |
| OAI-PMH Set | 岡山大学 |
| Copyright Holders | © 2025 The Authors. |
| File Version | publisher |
| DOI | 10.1109/access.2025.3584373 |
| Web of Science KeyUT | 001522917600018 |
| Related Url | isVersionOf https://doi.org/10.1109/access.2025.3584373 |
| FullText URL | fulltext.pdf |
|---|---|
| Author | Nguyen, Hien| Huda, Samsul| Nogami, Yasuyuki| Nguyen, Tuy Tan| |
| Keywords | Post-quantum cryptography lattice-based cryptography number theoretic transform hardware and software implementation |
| Published Date | 2025-05-19 |
| Publication Title | IEEE Access |
| Volume | volume13 |
| Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| Start Page | 89003 |
| End Page | 89024 |
| ISSN | 2169-3536 |
| Content Type | Journal Article |
| language | English |
| OAI-PMH Set | 岡山大学 |
| Copyright Holders | © 2025 The Authors. |
| File Version | publisher |
| DOI | 10.1109/access.2025.3571307 |
| Web of Science KeyUT | 001498285200014 |
| Related Url | isVersionOf https://doi.org/10.1109/access.2025.3571307 |
| FullText URL | fulltext.pdf |
|---|---|
| Author | Santoso, Andri| Huda, Samsul| Kodera, Yuta| Nogami, Yasuyuki| |
| Keywords | facial privacy protection selective facial encryption multi-user access control deep-learning applications online photo platform |
| Published Date | 2025-03-11 |
| Publication Title | Future Internet |
| Volume | volume17 |
| Issue | issue3 |
| Publisher | MDPI |
| Start Page | 124 |
| ISSN | 1999-5903 |
| Content Type | Journal Article |
| language | English |
| OAI-PMH Set | 岡山大学 |
| Copyright Holders | © 2025 by the authors. |
| File Version | publisher |
| DOI | 10.3390/fi17030124 |
| Web of Science KeyUT | 001452302000001 |
| Related Url | isVersionOf https://doi.org/10.3390/fi17030124 |
| FullText URL | fulltext.pdf |
|---|---|
| Author | Rahayu, Maya| Hossain, Md. Biplob| Huda, Samsul| Kodera, Yuta| Ali, Md. Arshad| Nogami, Yasuyuki| |
| Keywords | Vehicular Ad-Hoc Network Kerberos authentication blockchain |
| Published Date | 2024-11-21 |
| Publication Title | Sensors |
| Volume | volume24 |
| Issue | issue23 |
| Publisher | MDPI |
| Start Page | 7428 |
| ISSN | 1424-8220 |
| Content Type | Journal Article |
| language | English |
| OAI-PMH Set | 岡山大学 |
| Copyright Holders | © 2024 by the authors. |
| File Version | publisher |
| PubMed ID | 39685965 |
| DOI | 10.3390/s24237428 |
| Web of Science KeyUT | 001378182500001 |
| Related Url | isVersionOf https://doi.org/10.3390/s24237428 |
| FullText URL | fulltext.pdf |
|---|---|
| Author | Nasu, Hiroaki| Kodera, Yuta| Nogami, Yasuyuki| |
| Keywords | business-to-business data collaboration industrial supply chain blockchain homomorphic encryption |
| Published Date | 2022-06-29 |
| Publication Title | Sensors |
| Volume | volume22 |
| Issue | issue13 |
| Publisher | MDPI |
| Start Page | 4909 |
| ISSN | 1424-8220 |
| Content Type | Journal Article |
| language | English |
| OAI-PMH Set | 岡山大学 |
| Copyright Holders | © 2022 by the authors. |
| File Version | publisher |
| PubMed ID | 35808403 |
| DOI | 10.3390/s22134909 |
| Web of Science KeyUT | 000825497700001 |
| Related Url | isVersionOf https://doi.org/10.3390/s22134909 |
| FullText URL | fulltext.pdf |
|---|---|
| Author | Kodera, Yuta| Sato, Ryoichi| Ali, Md Arshad| Kusaka, Takuya| Nogami, Yasuyuki| |
| Keywords | true random number generator ring oscillator Markov process hypothesis testing |
| Published Date | 2022-05-31 |
| Publication Title | Entropy |
| Volume | volume24 |
| Issue | issue6 |
| Publisher | MDPI |
| Start Page | 780 |
| ISSN | 1099-4300 |
| Content Type | Journal Article |
| language | English |
| OAI-PMH Set | 岡山大学 |
| Copyright Holders | © 2022 by the authors. |
| File Version | publisher |
| PubMed ID | 35741501 |
| DOI | 10.3390/e24060780 |
| Web of Science KeyUT | 000816552500001 |
| Related Url | isVersionOf https://doi.org/10.3390/e24060780 |
| FullText URL | fulltext.pdf |
|---|---|
| Author | Sato, Ryoichi| Kodera, Yuta| Ali, Md. Arshad| Kusaka, Takuya| Nogami, Yasuyuki| Morelos-Zaragoza, Robert H.| |
| Keywords | entropy field programmable gate array true random number generator period ring oscillator stomatic process state transition XOR gate |
| Published Date | 2021-09-05 |
| Publication Title | Entropy |
| Volume | volume23 |
| Issue | issue9 |
| Publisher | MDPI |
| Start Page | 1168 |
| ISSN | 1099-4300 |
| Content Type | Journal Article |
| language | English |
| OAI-PMH Set | 岡山大学 |
| Copyright Holders | © 2021 by the authors. |
| File Version | publisher |
| PubMed ID | 34573793 |
| DOI | 10.3390/e23091168 |
| Web of Science KeyUT | 000699789000001 |
| Related Url | isVersionOf https://doi.org/10.3390/e23091168 |
| JaLCDOI | 10.18926/49322 |
|---|---|
| FullText URL | mfe_047_025_032.pdf |
| Author | Nekado, Kenta| Takai, Yusuke| Nogami, Yasuyuki| |
| Abstract | Pairing–based cryptosystems are well implemented with Ate–type pairing over Barreto–Naehrig (BN) curve. Then, for instance, their securities depend on the difficulty of Discrete Logarithm Problem (DLP) on the so–denoted G3 over BN curve. This paper, in order to faster solve the DLP, first proposes to utilize Gauss period Normal Basis (GNB) for Pollard’s rho method, and then considers to accelerate the solving by an adoption of lazy random walk, namely tag tracing technique proposed by Cheon et al. |
| Publication Title | Memoirs of the Faculty of Engineering, Okayama University |
| Published Date | 2013-01 |
| Volume | volume47 |
| Start Page | 25 |
| End Page | 32 |
| ISSN | 1349-6115 |
| language | English |
| Copyright Holders | Copyright © by the authors |
| File Version | publisher |
| NAID | 120005232374 |
| JaLCDOI | 10.18926/49321 |
|---|---|
| FullText URL | mfe_047_019_024.pdf |
| Author | Nogami, Yasuyuki| Sumo, Taichi| |
| Abstract | Recent efficient pairings such as Ate pairing use two efficient rational point subgroups such that π(P) = P and π(Q) = [p]Q, where π, p, P, and Q are the Frobenius map for rational point, the characteristic of definition field, and torsion points for pairing, respectively. This relation accelerates not only pairing but also pairing–related operations such as scalar multiplications. It holds in the case that the embedding degree k divides r − 1, where r is the order of torsion rational points. Thus, such a case has been well studied. Alternatively, this paper focuses on the case that the degree divides r + 1 but does not divide r − 1. Then, this paper shows a multiplicative representation for r–torsion points based on the fact that the characteristic polynomial f(π) becomes irreducible over Fr for which π also plays a role of variable. |
| Keywords | pairing–friendly curve torsion point group structure rank |
| Publication Title | Memoirs of the Faculty of Engineering, Okayama University |
| Published Date | 2013-01 |
| Volume | volume47 |
| Start Page | 19 |
| End Page | 24 |
| ISSN | 1349-6115 |
| language | English |
| Copyright Holders | Copyright © by the authors |
| File Version | publisher |
| NAID | 120005232373 |
| JaLCDOI | 10.18926/46982 |
|---|---|
| FullText URL | mfe_37_2_073_087.pdf |
| Author | Nogami, Yasuyuki| Morikawa, Yoshitaka| |
| Abstract | Public key cryptosystem has many uses, such as to sign digitally, to realize electronic commerce. Especially, RSA public key cryptosystem has been the most widely used, but its key for ensuring sufficient security reaches about 2000 bits long. On the other hand, elliptic curve cryptosystem(ECC) has the same security level with about 7-fold smaller length key. Accordingly, ECC has been received much attention and implemented on various processors even with scarce computation resources. In this paper, we deal with an elliptic curve which is defined over extension field F(p2c) and has a prime order, where p is the characteristic and c is a non negative integer. In order to realize a fast software implementation of ECC adopting such an elliptic curve, a fast implementation method of definition field F(p2c) especially F(p8) is proposed by using a technique called successive extension. First, five fast implementation methods of base field F(p2) are introduced. In each base field implementation, calculation costs of F(p2)-arithmetic operations are evaluated by counting the numbers of F(p)-arithmetic operations. Next, a successive extension method which adopts a polynomial basis and a binomial as the modular polynomial is proposed with comparing to a conventional method. Finally, we choose two prime numbers as the characteristic, and consider several implementations for definition field F(p8) by using five base fields and two successive extension methods. Then, one of these implementations is especially selected and implemented on Toshiba 32-bit micro controller TMP94C251(20MHz) by using C language. By evaluating calculation times with comparing to previous works, we conclude that proposed method can achieve a fast implementation of ECC with a prime order. |
| Publication Title | Memoirs of the Faculty of Engineering, Okayama University |
| Published Date | 2003-03 |
| Volume | volume37 |
| Issue | issue2 |
| Start Page | 73 |
| End Page | 87 |
| ISSN | 0475-0071 |
| language | English |
| File Version | publisher |
| NAID | 80015999992 |
| JaLCDOI | 10.18926/44500 |
|---|---|
| FullText URL | mfe_045_054_059.pdf |
| Author | Nekado, Kenta| Takai, Yusuke| Nogami, Yasuyuki| Morikawa, Yoshitaka| |
| Abstract | Recently, pairing–based cryptographies have attracted much attention. For fast pairing calculation, not only pairing algorithms but also arithmetic operations in extension field should be efficient. Especially for final exponentiation included in pairing calculation, squaring is more important than multiplication. This paper considers squaring algorithms efficient for cubic extension field which is often used for pairing implementaions. |
| Publication Title | Memoirs of the Faculty of Engineering, Okayama University |
| Published Date | 2011-01 |
| Volume | volume45 |
| Start Page | 54 |
| End Page | 59 |
| ISSN | 1349-6115 |
| language | English |
| Copyright Holders | Copyright © by the authors |
| File Version | publisher |
| NAID | 80021759252 |
| JaLCDOI | 10.18926/44499 |
|---|---|
| FullText URL | mfe_045_046_053.pdf |
| Author | Nogami, Yasuyuki| Yanagi, Erika| Izuta, Tetsuya| Morikawa, Yoshitaka| |
| Abstract | Recently, composite order pairing–based cryptographies have received much attention. The composite order needs to be as large as the RSA modulus. Thus, they require a certain pairing–friendly elliptic curve that has such a large composite order. This paper proposes an efficient algorithm for generating an ordinary pairing–friendly elliptic curve of the embedding degree 1 whose order has two large prime factors as the RSA modulus. In addition, the generated pairing–friendly curve has an efficient structure for the Gallant–Lambert–Vanstone (GLV) method. |
| Publication Title | Memoirs of the Faculty of Engineering, Okayama University |
| Published Date | 2011-01 |
| Volume | volume45 |
| Start Page | 46 |
| End Page | 53 |
| ISSN | 1349-6115 |
| language | English |
| Copyright Holders | Copyright © by the authors |
| File Version | publisher |
| NAID | 120002905955 |
| JaLCDOI | 10.18926/19961 |
|---|---|
| FullText URL | Mem_Fac_Eng_OU_44_69.pdf |
| Author | Nekado, Kenta| Kato, Hidehiro| Nogami, Yasuyuki| Morikawa, Yoshitaka| |
| Abstract | Recently, pairing–based cryptographies have attracted much attention. For fast pairing calculation, not only pairing algorithms but also arithmetic operations in extension field should be efficient. Especially for final exponentiation included in pairing calculation, squaring is more important than multiplication. This paper proposes an efficient squaring algorithm in extension field for Freeman curve. |
| Publication Title | Memoirs of the Faculty of Engineering, Okayama University |
| Published Date | 2010-01 |
| Volume | volume44 |
| Start Page | 69 |
| End Page | 72 |
| ISSN | 1349-6115 |
| language | English |
| File Version | publisher |
| NAID | 120002309070 |
| JaLCDOI | 10.18926/19960 |
|---|---|
| FullText URL | Mem_Fac_Eng_OU_44_60.pdf |
| Author | Nogami, Yasuyuki| Morikawa, Yoshitaka| |
| Abstract | This paper proposes a method for generating a certain composite order ordinary pairing–friendly elliptic curve of embedding degree 3. In detail, the order has two large prime factors such as the modulus of RSA cryptography. The method is based on the property that the order of the target pairing–friendly curve is given by a polynomial as r(X) of degree 2 with respect to the integer variable X. When the bit size of the prime factors is about 500 bits, the proposed method averagely takes about 15 minutes on Core 2 Quad (2.66Hz) for generating one. |
| Publication Title | Memoirs of the Faculty of Engineering, Okayama University |
| Published Date | 2010-01 |
| Volume | volume44 |
| Start Page | 60 |
| End Page | 68 |
| ISSN | 1349-6115 |
| language | English |
| File Version | publisher |
| NAID | 120002309063 |
| JaLCDOI | 10.18926/17853 |
|---|---|
| FullText URL | Mem_Fac_Eng_OU_43_113.pdf |
| Author | Sakemi, Yumi| Kato, hidehiro| Nogami, Yasuyuki| Morikawa, Yoshikawa| |
| Abstract | Barreto–Naehrig (BN) curve has been introduced as an efficient pairing-friendly elliptic curve over prime field F(p) whose embedding degree is 12. The characteristic and Frobenius trace are given as polynomials of integer variable X. The authors proposed an improvement of Miller's algorithm of twisted Ate pairing with BN curve by applying X of small hamming weight in ITC–CSCC2008; however, its cost evaluation has not been explicitly shown. This paper shows the detail of the cost evaluation. |
| Publication Title | Memoirs of the Faculty of Engineering, Okayama University |
| Published Date | 2009-01 |
| Volume | volume43 |
| Start Page | 113 |
| End Page | 116 |
| ISSN | 1349-6115 |
| language | English |
| File Version | publisher |
| NAID | 120002308945 |
| JaLCDOI | 10.18926/17851 |
|---|---|
| FullText URL | Mem_Fac_Eng_OU_43_108.pdf |
| Author | Nekado, Kenta| Kato, Hidehiro| Nogami, Yasuyuki| Morikawa, Yoshitaka| |
| Abstract | Recently, pairing-based cryptographies such as ID-based cryptography and group signature have been studied. For fast pairing calculation, not only pairing algorithms but also arithmetic operations in extension field must be efficiently carried out. The authors show efficient arithmetic operations of extension field for Xate pairing especially with Freeman curve. |
| Publication Title | Memoirs of the Faculty of Engineering, Okayama University |
| Published Date | 2009-01 |
| Volume | volume43 |
| Start Page | 108 |
| End Page | 112 |
| ISSN | 1349-6115 |
| language | English |
| File Version | publisher |
| NAID | 120002308904 |
| JaLCDOI | 10.18926/17849 |
|---|---|
| FullText URL | Mem_Fac_Eng_OU_43_99.pdf |
| Author | Kato, Hidehiro| Nogami, Yasuyuki| Morikawa, Yoshitaka| |
| Abstract | A square root (SQRT) algorithm in extension field F(p(m))(m = r(0)r(1)･･･r(n−1)･2(d), r(i) : odd prime, d : positive integer) is proposed in this paper. First, a conventional SQRT algorithm, the Tonelli-Shanks algorithm, is modified to compute the inverse SQRT in F(p(2d)), where most of the computations are performed in the corresponding subfields F(p(2i)) for 0 ≤ i ≤ d-1. Then the Frobenius mappings with addition chain are adopted for the proposed SQRT algorithm, in which a lot of computations in a given extension field F(p(m)) are also reduced to those in a proper subfield by the norm computations. Those reductions of the field degree increase efficiency in the SQRT implementation. The Tonelli-Shanks algorithm and the proposed algorithm in F(p(6)) and F(p(10)) were implemented on a Core2 (2.66 GHz) using the C++ programming language. The computer simulations showed that, on average, the proposed algorithm accelerated the SQRT computation by 6 times in F(p(6)), and by 10 times in F(p(10)), compared to the Tonelli-Shanks algorithm. |
| Publication Title | Memoirs of the Faculty of Engineering, Okayama University |
| Published Date | 2009-01 |
| Volume | volume43 |
| Start Page | 99 |
| End Page | 107 |
| ISSN | 1349-6115 |
| language | English |
| File Version | publisher |
| NAID | 120002308980 |
