2024/10/23 更新

写真a

ノガミ ヤスユキ
野上 保之
NOGAMI Yasuyuki
所属
環境生命自然科学学域 教授
職名
教授
外部リンク

学位

  • 博士(工学) ( 信州大学 )

研究キーワード

  • Information Security

  • Cryptography

  • Information Theory

  • Elliptic curve cryptography

  • Random Numbers

  • Post Quantum Cryptography

  • Pairing-based Cryptography

  • IoT Security

研究分野

  • ものづくり技術(機械・電気電子・化学工学) / 通信工学  / 情報セキュリティ

  • 情報通信 / 情報セキュリティ  / 暗号技術

学歴

  • 信州大学博士課程   工学系研究科   システム開発工学

    1996年4月 - 1999年3月

      詳細を見る

    国名: 日本国

    researchmap

  • 信州大学修士課程   工学系研究科   電気電子工学専攻

    1994年4月 - 1996年3月

      詳細を見る

  • 信州大学   Faculty of Engineering   Electrical and Electronic Engineering

    1990年4月 - 1994年3月

      詳細を見る

    国名: 日本国

    researchmap

経歴

  • 岡山大学・学術研究院・環境生命自然科学学域 教授

    2023年4月 - 現在

      詳細を見る

  • 岡山大学グリーンイノベーションセンター   グリーンバイデジタル部門   部門長

    2022年4月 - 現在

      詳細を見る

  • 岡山大学   DX推進・情報セキュリティ担当副理事

    2021年4月 - 現在

      詳細を見る

  • 岡山大学自然科学研究科 教授

    2017年4月 - 2023年3月

      詳細を見る

  • 岡山大学自然科学研究科 准教授

    2010年4月 - 2017年3月

      詳細を見る

所属学協会

  • IEEE

    1999年6月 - 現在

      詳細を見る

  • 電子情報通信学会

    1996年6月 - 現在

      詳細を見る

委員歴

  • 電子情報通信学会 情報理論研究会   委員長  

    2024年5月 - 2026年4月   

      詳細を見る

    団体区分:学協会

    researchmap

  • おかやまデジタルイノベーション創出プラットフォーム   会長  

    2024年4月 - 現在   

      詳細を見る

  • セキュアIoTプラットフォーム協議会   会員  

    2023年 - 現在   

      詳細を見る

    団体区分:学協会

    researchmap

  • 電子情報通信学会 情報理論研究専門委員会   副委員長  

    2022年5月 - 2024年4月   

      詳細を見る

    団体区分:学協会

    researchmap

  • 電子情報通信学会   基礎・境界ソサイエティ 特別委員  

    2019年6月 - 2021年6月   

  • 電子情報通信学会   基礎・境界ソサイエティ 特別委員  

    2019年5月 - 2021年6月   

      詳細を見る

    団体区分:学協会

    researchmap

  • 電子情報通信学会   代議員会 代議員  

    2019年5月 - 2020年6月   

      詳細を見る

    団体区分:学協会

    researchmap

  • 電子情報通信学会   代議員会 代議員  

    2019年4月 - 2020年3月   

  • 電子情報通信学会   ハードウェアセキュリティ研究専門委員会 委員  

    2018年4月 - 2022年6月   

      詳細を見る

    団体区分:学協会

  • 電子情報通信学会   ハードウェアセキュリティ研究専門委員会 委員  

    2018年4月 - 2022年4月   

      詳細を見る

    団体区分:学協会

    researchmap

  • 電子情報通信学会   著作権管理委員会 委員  

    2017年5月 - 2019年6月   

  • 電子情報通信学会   基礎・境界ソサイエティ 庶務幹事  

    2017年5月 - 2019年6月   

  • 電子情報通信学会   基礎・境界ソサイエティ 庶務幹事  

    2017年5月 - 2019年6月   

      詳細を見る

    団体区分:学協会

    researchmap

  • 電子情報通信学会   著作権管理委員会 委員  

    2017年5月 - 2019年6月   

      詳細を見る

    団体区分:学協会

    researchmap

  • 電子情報通信学会   基礎・境界ソサイエティ 会計幹事  

    2011年5月 - 2013年6月   

      詳細を見る

    団体区分:学協会

    researchmap

  • 電子情報通信学会   基礎・境界ソサイエティ 会計幹事  

    2011年5月 - 2013年5月   

  • 電子情報通信学会   情報理論研究専門委員会 委員  

    2007年5月 - 2013年6月   

      詳細を見る

    団体区分:学協会

    researchmap

  • 電子情報通信学会   情報理論研究専門委員会 委員  

    2007年5月 - 2013年5月   

  • 電子情報通信学会   情報セキュリティ研究専門委員会 委員  

    2006年5月 - 2021年6月   

  • 電子情報通信学会   情報セキュリティ研究専門委員会 委員  

    2006年5月 - 2021年6月   

      詳細を見る

    団体区分:学協会

    researchmap

  • 岡山県高度情報化推進協議会   岡山県高度情報化推進協議会幹事  

      詳細を見る

    団体区分:自治体

    researchmap

  • NICT テストベッド分科会   NICT テストベッド分科会 委員  

      詳細を見る

    団体区分:学協会

    researchmap

  • 安全安心インターネット推進協議会   安全安心インターネット推進協議会 会員  

      詳細を見る

    団体区分:学協会

    researchmap

  • 中国経済連合会SecurityWG   中国経済連合会SecurityWG 委員  

      詳細を見る

    団体区分:その他

    researchmap

▼全件表示

 

論文

  • Optimizing IoT Intrusion Detection Using Balanced Class Distribution, Feature Selection, and Ensemble Machine Learning Techniques

    Muhammad Bisri Musthafa, Samsul Huda, Yuta Kodera, Md Arshad Ali, Shunsuke Araki, Jedidah Mwaura, Yasuyuki Nogami

    Sensors   24 ( 13 )   2024年7月

     詳細を見る

    掲載種別:研究論文(学術雑誌)  

    Internet of Things (IoT) devices are leading to advancements in innovation, efficiency, and sustainability across various industries. However, as the number of connected IoT devices increases, the risk of intrusion becomes a major concern in IoT security. To prevent intrusions, it is crucial to implement intrusion detection systems (IDSs) that can detect and prevent such attacks. IDSs are a critical component of cybersecurity infrastructure. They are designed to detect and respond to malicious activities within a network or system. Traditional IDS methods rely on predefined signatures or rules to identify known threats, but these techniques may struggle to detect novel or sophisticated attacks. The implementation of IDSs with machine learning (ML) and deep learning (DL) techniques has been proposed to improve IDSs’ ability to detect attacks. This will enhance overall cybersecurity posture and resilience. However, ML and DL techniques face several issues that may impact the models’ performance and effectiveness, such as overfitting and the effects of unimportant features on finding meaningful patterns. To ensure better performance and reliability of machine learning models in IDSs when dealing with new and unseen threats, the models need to be optimized. This can be done by addressing overfitting and implementing feature selection. In this paper, we propose a scheme to optimize IoT intrusion detection by using class balancing and feature selection for preprocessing. We evaluated the experiment on the UNSW-NB15 dataset and the NSL-KD dataset by implementing two different ensemble models: one using a support vector machine (SVM) with bagging and another using long short-term memory (LSTM) with stacking. The results of the performance and the confusion matrix show that the LSTM stacking with analysis of variance (ANOVA) feature selection model is a superior model for classifying network attacks. It has remarkable accuracies of (Formula presented.) and (Formula presented.) and overfitting values of (Formula presented.) and (Formula presented.) on the two datasets, respectively. The model’s ROC is also shaped with a sharp bend, with AUC values of (Formula presented.) and (Formula presented.) for the UNSW-NB15 dataset and the NSL-KD dataset, respectively.

    DOI: 10.3390/s24134293

    Scopus

    PubMed

    researchmap

  • Optimizing IoT Intrusion Detection Using Balanced Class Distribution, Feature Selection, and Ensemble Machine Learning Techniques.

    Muhammad Bisri Musthafa, Samsul Huda, Yuta Kodera, Md. Arshad Ali, Shunsuke Araki, Jedidah Mwaura, Yasuyuki Nogami

    Sensors   24 ( 13 )   4293 - 4293   2024年7月

     詳細を見る

    掲載種別:研究論文(学術雑誌)  

    DOI: 10.3390/s24134293

    researchmap

  • Tolerance Evaluation Against Deep Learning Side-Channel Attack on AES in Automotive Microcontroller With Uncertain Leakage Model

    Masaki Himuro, Naoto Kawahara, Yoshiyuki Amanuma, Kengo Iokibe, Yasuyuki Nogami, Yoshitaka Toyota

    2024 IEEE Joint International Symposium on Electromagnetic Compatibility, Signal & Power Integrity: EMC Japan / Asia-Pacific International Symposium on Electromagnetic Compatibility (EMC Japan/APEMC Okinawa)   2024年5月

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    DOI: 10.23919/emcjapan/apemcokinaw58965.2024.10584961

    researchmap

  • A Secure Authentication for Plant Monitoring System Sensor Data Access

    Samsul Huda, Yasuyuki Nogami, Md. Biplob Hossain, Yang Jie, Le Hoang Anh, Muhammad Bisri Musthafa, Maya Rahayu, Takuma Akada

    2024 IEEE International Conference on Consumer Electronics (ICCE)   2024年1月

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    DOI: 10.1109/icce59016.2024.10444465

    researchmap

  • Performance Analysis of ELiPS-Based CP-ABE with Optimized Decryption Functions

    Le Hoang Anh, Yuta Kawada, Samsul Huda, Yuta Kodera, Yasuyuki Nogami

    Smart Innovation, Systems and Technologies   404 SIST   345 - 354   2024年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    CP-ABE emerges as an advanced cryptographic method that offers secure and precise access control in Internet of Things and cloud storage applications. Nevertheless, the original CP-ABE algorithm relied on the PBC library with a security level limited to 80 bits and is now outdated, making it vulnerable to attacks. To address this issue, we have introduced ELiPS-based CP-ABE, which boosts the level of security to 128 bits using the ELiPS library. While this enhancement improved the overall performance, the decryption functions remained computationally intensive. To tackle this, we previously optimized the decryption function by minimizing final exponentiations and inversions. In this paper, we evaluate and analyze the impact of these optimizations on decryption efficiency. Moreover, we compare the ELiPS-based CP-ABE with these improvements to the initial version and the original PBC-based CP-ABE. As a result, the combination of both optimization techniques resulted in an average 43.06% overall reduction in decryption time compared to the initial version of the ELiPS-based CP-ABE scheme, while in total execution, it led to a 25.27% improvement. Furthermore, there was an average 53.81% overall reduction in total execution time compared to the original PBC-based CP-ABE method.

    DOI: 10.1007/978-981-97-5810-4_30

    Scopus

    researchmap

  • Securing Data Transmission in Noisy Channels: A Synergistic Approach using Kyber and BCH Codes

    Linh Nguyen, Andri Santoso, Samsul Huda, Yasuyuki Nogami, Tuy Tan Nguyen

    11th IEEE International Conference on Consumer Electronics - Taiwan, ICCE-Taiwan 2024   399 - 400   2024年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    The proliferation of the Internet of Things leads to the sharing of more data among diverse stakeholders, ranging from individual users to large enterprises. However, ensuring the security of this data exchange while simultaneously minimizing errors during transmission presents a complex challenge. Due to the involvement of numerous devices and users capable of data sharing, the dynamic and heterogeneous nature of the environment leads to constant changes. In this paper, we integrate the Kyber algorithm for post-quantum security with Bose-Chaudhuri-Hocquenghem (BCH) codes for error correction. We validate our approach by transmitting images from the widely- used CIFAR-10 dataset in encrypted mode over noisy communication channels. The system demonstrates effective image encryption and robust error correction capabilities.

    DOI: 10.1109/ICCE-Taiwan62264.2024.10674282

    Scopus

    researchmap

  • Optimizing CRYSTALS-Dilithium in Rust: Radix-4 NTT and Assembly-level Comparison with Official C Implementation

    Shunri Kudo, Yasuyuki Nogami, Samsul Huda, Yuta Kodera

    11th IEEE International Conference on Consumer Electronics - Taiwan, ICCE-Taiwan 2024   395 - 396   2024年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    Post-Quantum Cryptography (PQC) is becoming popular since it offers protection against quantum attacks. CRYSTALS-Dilithium is being considered as a promising NIST PQC standard candidate. It utilizes the Radix-2 Number Theoretic Transform (NTT). Its reliance on lattice-based cryptography and number-theoretic principles positions CRYSTALS-Dilithium as a strong contender for providing robust security in the era of quantum computing. Besides, the Radix-4 NTT divides polynomials into more parts than the Radix-2 NTT, making calculations more efficient by reusing values. In this paper, we improve the computational efficiency of CRYSTALS-Dilithium by implementing the Radix-4 NTT algorithm in both C and Rust programming languages. We verified the effectiveness through experiments in terms of signature and verification speeds. Additionally, we analyzed the assembly code generated by both languages to understand the performance differences.

    DOI: 10.1109/ICCE-Taiwan62264.2024.10674226

    Scopus

    researchmap

  • A Study to Improve Calculation Efficiency of CKKS Encoding with Parallelization

    Taichi Saito, He Yixuan, Samsul Huda, Junting Xiao, Yuta Kodera, Yasuyuki Nogami

    11th IEEE International Conference on Consumer Electronics - Taiwan, ICCE-Taiwan 2024   397 - 398   2024年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    CKKS homomorphic encryption is frequently utilized in cloud-based applications due to its ability to handle both real and complex numbers, ensuring the protection of sensitive data. However, the security of CKKS encryption relies on an encoding process to convert input data into a polynomial. While this process involves the Inverse Fast Fourier Transform (IFFT), there are two notable issues with IFFT: first, most multiplications between complex numbers require four multiplications between real numbers, and second, there are delays in processing due to data hazards. In this paper, we propose an effective way to handle these issues by substituting them using parallelization based on the sum of complex conjugates. This approach aims to reduce the multiplication cost, thereby improving processing time compared to IFFT.

    DOI: 10.1109/ICCE-Taiwan62264.2024.10674426

    Scopus

    researchmap

  • An In-depth Analysis of Kerberos and Blockchain Integration on VANETs' Security and Performance

    Maya Rahayu, Md Biplob Hossain, Samsul Huda, Md Arshad Ali, Yuta Kodera, Yasuyuki Nogami

    11th IEEE International Conference on Consumer Electronics - Taiwan, ICCE-Taiwan 2024   391 - 392   2024年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    Vehicular Ad-Hoc Networks (VANETs) are essential for modern transportation systems, but their openness exposes them to cyber threats. Authentication in VANETs is challenged by dynamic topology and high mobility, requiring robust mechanisms. Previously, we proposed an authentication system for VANETs using blockchain and Kerberos. Kerberos authenticator messages are stored in a blockchain ledger accessible to the Trusted Authentication Server (TAS) and Roadside Units (RSUs), resulting in minimal signaling overhead and authentication delay. However, the performance of the blockchain itself was not evaluated. In this paper, we investigate the blockchain's performance in a simulated VANET environment with 100 vehicles, 4 RSUs, and 1 TAS. Using Ethereum blockchain and Omnet++ simulation, we assess the blockchain feasibility in VANET authentication scenarios.

    DOI: 10.1109/ICCE-Taiwan62264.2024.10674056

    Scopus

    researchmap

  • Investigating Vulnerabilities in RSA-like Cryptosystems Through Lattice-based Attacks on Small Exponent Keys

    Sou Kumagai, Shota Kanzawa, Samsul Huda, Yuta Kodera, Yasuyuki Nogami

    11th IEEE International Conference on Consumer Electronics - Taiwan, ICCE-Taiwan 2024   585 - 586   2024年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    RSA-like cryptosystems, based on the original RSA algorithm, are gaining attention as potential alternatives to traditional techniques. They offer better security, efficiency, flexibility, and compatibility in cryptography. However, recent studies have uncovered vulnerabilities in these variants, particularly to Wiener-type attacks, despite initial expectations of security comparable to RSA. In this paper, we further investigate the security vulnerabilities of a variant of this technique, namely the Murru-Saettone (MS) cryptosystem. Our investigation employs lattice-based attacks to exploit weaknesses in systems with small private keys. It demonstrates that if the private exponent is smaller than N1/4, where N is the product of two distinct balanced primes, the small exponent of the cryptosystem can be recovered.

    DOI: 10.1109/ICCE-Taiwan62264.2024.10674633

    Scopus

    researchmap

  • A Highly Secure and Accurate System for COVID-19 Diagnosis from Chest X-Ray Images

    Tuy Tan Nguyen, Tianyi Chen, Ian Philippi, Quoc Bao Phan, Shunri Kudo, Samsul Huda, Yasuyuki Nogami

    Midwest Symposium on Circuits and Systems   980 - 984   2024年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    Global healthcare systems face growing pressure as populations rise. This can lead to longer wait times and an increased risk of treatment delays or misdiagnosis. Artificial intelligence (AI) diagnostic systems are being developed to address these challenges, but concerns exist about their accuracy and data security. This study introduces a robust AI telehealth system that offers a two-pronged approach. It utilizes a cutting-edge image analysis method, vision transformer, to enhance diagnostic accuracy, while also incorporating post-quantum cryptography algorithm, Kyber, to ensure patient privacy. Furthermore, an interactive visualization tool aids in interpreting the diagnostic results, providing valuable insights into the model's decisionmaking process. This translates to faster diagnoses and potentially shorter wait times for patients. Extensive testing with various datasets has demonstrated the system's effectiveness. The optimized model achieves a remarkable 95.79% accuracy rate in diagnosing COVID-19 from chest X-rays, with the entire process completed in under five seconds.

    DOI: 10.1109/MWSCAS60917.2024.10658795

    Scopus

    researchmap

  • SnapSafe: Enabling Selective Image Privacy Through YOLO and AES-Protected Facial Encryption with QR Code

    Andri Santoso, Samsul Huda, Tuy Tan Nguyen, Yuta Kodera, Yasuyuki Nogami

    2024 International Technical Conference on Circuits/Systems, Computers, and Communications, ITC-CSCC 2024   2024年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    In the digital age, organizations commonly use photos to share their activities for brand visibility. However, it is crucial to safeguard the facial information of individuals depicted in these photos to prevent potential misuse. In this paper, we propose a single-party security system for enabling selective image privacy with a focus on facial regions, called SnapSafe. It adopts the YOLOv8 deep learning model for face detection, AES encryption for security, and QR technology to store the encrypted face region coordinates. Our evaluation assesses the effectiveness of the system through the usability of its face locking and unlocking processes, alongside an analysis of its running time. The results demonstrate the system's proficiency in executing face protection tasks with high accuracy and minimal time overhead, thus indicating its suitability for real-time applications.

    DOI: 10.1109/ITC-CSCC62988.2024.10628222

    Scopus

    researchmap

  • Reducing Fruitless Cycles in Pollard's Rho Method with SFM for Efficient ECDLP Attacks on BN Curves

    Ryuichi Kato, Takuro Manabe, Shota Kanzawa, Samsul Huda, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami

    2024 International Technical Conference on Circuits/Systems, Computers, and Communications, ITC-CSCC 2024   2024年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    Pollard's rho method is a widely used probabilistic algorithm for solving the Elliptic Curve Discrete Logarithm Problem (ECDLP). To enhance its efficiency, the skew Frobenius mapping (SFM) has been incorporated into the method, reducing the average number of steps required to find a collision. However, the combination of Pollard's rho method with SFM introduces the occurrence of fruitless cycles, which are computational loops that do not contribute to solving the ECDLP and hinder the overall attacking efficiency. This paper presents a comprehensive analysis of fruitless cycles in Pollard's rho method with SFM, focusing on their impact when applied to Barreto-Naehrig (BN) curves. We propose a scheme to mitigate the occurrence of fruitless cycles by optimizing the seed point selection to be adaptive according to situation. To validate the effectiveness of our proposed method, we perform comprehensive experiments and compare the results with the conventional Pollard's rho method with SFM. The results indicate that the proposed approach significantly reduces the occurrence of fruitless cycles, leading to faster and more efficient ECDLP attacks on BN curves.

    DOI: 10.1109/ITC-CSCC62988.2024.10628268

    Scopus

    researchmap

  • Evaluation of IDS model by improving accuracy and reducing overfitting using stacking LSTM

    Muhammad Bisri Musthafa, Samsul Huda, Md Arshad Ali, Yuta Kodera, Yasuyuki Nogami

    Digest of Technical Papers - IEEE International Conference on Consumer Electronics   2024年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    Utilizing Machine Learning (ML) techniques to construct models for Intrusion Detection Systems (IDS) has emerged as a leading strategy to enhance security measures. Previously, we applied an ensemble of Support Vector Machines (SVM) for model training, achieving an accuracy detection rate of 88.6% on familiar datasets. However, it performs poorly on unknown datasets due to overfitting problems. This work aims to improve accuracy and tackle overfitting problems by implementing stacked Long Short-Term Memory (LSTM) networks. Furthermore, analysis of variance (ANOVA) with F-test is used to find the important feature. The synthetic minority oversampling technique (SMOTE) algorithm is applied to obtain balanced data. Several experiments were conducted to analyze the performance of the proposed approach, including investigating stacked LSTM with tuning hyperparameters. The proposed method achieved the highest prediction accuracy of 97.23% and an overfitting value of 0.24%.

    DOI: 10.1109/ICCE59016.2024.10444231

    Scopus

    researchmap

  • A Blockchain-based Approach with zk-SNARKs for Secure Email Applications.

    Md. Biplob Hossain, Maya Rahayu, Md. Arshad Ali, Samsul Huda, Yuta Kodera, Yasuyuki Nogami

    Int. J. Netw. Comput.   14 ( 2 )   225 - 247   2024年

     詳細を見る

    掲載種別:研究論文(学術雑誌)  

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/journals/ijnc/ijnc14.html#HossainRAHKN24

  • Evaluation of IDS model by improving accuracy and reducing overfitting using stacking LSTM.

    Muhammad Bisri Musthafa, Samsul Huda, Ali Md. Arshad, Yuta Kodera, Yasuyuki Nogami

    ICCE   1 - 5   2024年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/ICCE59016.2024.10444231

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/iccel/icce2024.html#MusthafaHAKN24

  • An implementation of ELiPS-based Ciphertext-Policy Attribute-Based Encryption

    Le Hoang Anh, Yuta Kawada, Samsul Huda, Md. Arshad Ali, Yuta Kodera, Yasuyuki Nogami

    2023 Eleventh International Symposium on Computing and Networking Workshops (CANDARW)   2023年11月

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    DOI: 10.1109/candarw60564.2023.00044

    researchmap

  • Improvement of Miller Loop for a Pairing on FK12 Curve and Evaluation with other STNFS Curves

    Ikesaka Kazuma, Nanjo Yuki, Kodera Yuta, Kusaka Takuya, Nogami Yasuyuki

    International Journal of Networking and Computing   13 ( 2 )   242 - 257   2023年

     詳細を見る

    記述言語:英語   出版者・発行元:IJNC Editorial Committee  

    Pairing is carried out by two steps, Miller loop and final exponentiation. In this manuscript, the authors propose an efficient Miller loop for a pairing on the FK12 curve. A Hamming weight and bit-length of loop parameter have a great effect on the computational cost of the Miller loop. Optimal-ate pairing is used as the most efficient pairing on the FK12 curve currently. The loop parameter of optimal-ate pairing is 6z + 2 where z is the integer to make the FK12 curve parameter. Our method uses z which has a shorter bit-length than the previous optimal-ate pairing as the loop parameter. Usually, z has a low Hamming weight to make final exponentiation efficient. Therefore, the loop parameter in our method has a lower Hamming weight than the loop parameter of the previous one in many cases. The authors evaluate our method by the number of multiplications and execution time. As a result, the proposed algorithm leads to a 3.71% reduction in the number of multiplications and a 3.03% reduction in the execution time. In addition, the authors implement other STNFS secure curves and evaluate these curves from viewpoint of execution time.

    DOI: 10.15803/ijnc.13.2_242

    researchmap

  • A Consideration of Averaging the Calculation Cost of CVMA for A Secure Session based Data Transmission.

    Akane Miyoshi, Kazuma Ikesaka, Ali Md. Arshad, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami

    ICCE-Taiwan   493 - 494   2023年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/ICCE-Taiwan58799.2023.10226716

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/icce-tw/icce-tw2023.html#MiyoshiIAKKN23

  • Improvement of Miller Loop for a Pairing on FK12 Curve and Evaluation with other STNFS Curves.

    Kazuma Ikesaka, Yuki Nanjo, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami

    International Journal of Networking and Computing   13 ( 2 )   242 - 257   2023年

     詳細を見る

    掲載種別:研究論文(学術雑誌)  

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/journals/ijnc/ijnc13.html#IkesakaNKKN23

  • A Proposal of IoT Application for Plant Monitoring System with AWS Cloud Service.

    Samsul Huda, Yasuyuki Nogami, Takuma Akada, Maya Rahayu, Md. Biplob Hossain, Muhammad Bisri Musthafa, Le Hoang Anh, Yang Jie

    SmartNets   1 - 5   2023年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/SmartNets58706.2023.10215620

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/smartnets/smartnets2023.html#HudaNARHMAJ23

  • Evaluation of machine learning based optimized feature selection approaches and classification methods for Intrusion Detection System.

    Muhammad Bisri Musthafa, Ali Md. Arshad, Samsul Huda, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami

    ICCE-Taiwan   285 - 286   2023年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/ICCE-Taiwan58799.2023.10226697

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/icce-tw/icce-tw2023.html#MusthafaAHKKN23

  • A Smart Contract Based Blockchain Approach Integrated with Elliptic Curve Cryptography for Secure Email Application

    Md Biplob Hossain, Maya Rahayu, Md Arshad Ali, Samsul Huda, Yuta Kodera, Yasuyuki Nogami

    Proceedings - 2023 11th International Symposium on Computing and Networking Workshops, CANDARW 2023   195 - 201   2023年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    In today's interconnected digital era, email stands as a primary platform for communication across various fields, such as business, academia, and personal interactions. Since it operates on shared mediums, email is inherently susceptible to interception and misuse of sensitive information. To cover this issue, Pretty Good Privacy (PGP) ensures the confidentiality of email contents. However, while PGP effectively encrypts the body of messages, a significant vulnerability emerges during key sharing. Blockchain technology comes with its immutability aspect. Once data is embedded into the blockchain, modifying it becomes exceedingly challenging. This makes it a potential safeguard against the vulnerabilities in PGP's key sharing mechanism. Additionally, smart contracts remove the requirement of a Man-in-the-Middle for sharing key, which enhances the sharing key's security and builds trust among users. In this paper, we integrate the strengths of blockchain into the PGP encryption process, specifically targeting the key sharing vulnerability. Also, we adopt Elliptic Curve Cryptography (ECC) to ensure the confidentiality of the PGP's key. First, generate the PGP's key. Then, encrypt it using ECC. After that, deploy a smart contract and continue with the encrypted PGP's key transactions in blockchain networks. Through this integration, we aim to enhance the security, ensuring both confidentiality and integrity of the PGP's key. We demonstrated that the proposed system is workable by experimental observation.

    DOI: 10.1109/CANDARW60564.2023.00040

    Scopus

    researchmap

  • An integrated secured vehicular ad-hoc network leveraging Kerberos authentication and Blockchain technology.

    Maya Rahayu, Md. Biplob Hossain, Ali Md. Arshad, Samsul Huda, Yuta Kodera, Yasuyuki Nogami

    CANDARW   260 - 266   2023年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/CANDARW60564.2023.00050

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/candar/candar2023w.html#RahayuHAHKN23

  • An integrated secured vehicular ad-hoc network leveraging Kerberos authentication and Blockchain technology

    Maya Rahayu, Md Biplob Hossain, Md Arshad Ali, Samsul Huda, Yuta Kodera, Yasuyuki Nogami

    Proceedings - 2023 11th International Symposium on Computing and Networking Workshops, CANDARW 2023   260 - 266   2023年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    Vehicular Ad-Hoc Networks (VANETs) are a prominent technology in the drive towards establishing smart transportation systems in the Digital Transformation (DX) era. These networks provide users with critical road information for optimal route selection and accident avoidance. However, the openness of VANETs environment makes them susceptible to various cyber threats. Therefore, authenticating the entities that join the network is necessary and crucial for ensuring the security and integrity of VANET communications. Kerberos is one of the authentication protocols that ensure security, as the password and key are never directly sent among the entities. However, ensuring secure and efficient authentication, especially in VANET handovers, remains a challenge. This paper introduces an innovative authentication system for VANETs that leverages the combined power of blockchain and Kerberos. The system stores Kerberos authenticator messages in a distributed ledger within the blockchain, accessible to Trusted Authorities (TAS) and all RSUs. This approach streamlines vehicle handovers and safeguards authenticator messages against adversarial tampering. It exhibits minimal signalling overhead and authentication delay, ensuring swift and secure authentication processes. We verify the proposal's effectiveness by simulating the VANETs environment with 100 vehicles, 4 RSUs, and 1 TAS using Omnet++ with the Tsushima, Japan area map.

    DOI: 10.1109/CANDARW60564.2023.00050

    Scopus

    researchmap

  • A Smart Contract Based Blockchain Approach Integrated with Elliptic Curve Cryptography for Secure Email Application.

    Md. Biplob Hossain, Maya Rahayu, Ali Md. Arshad, Samsul Huda, Yuta Kodera, Yasuyuki Nogami

    CANDARW   195 - 201   2023年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/CANDARW60564.2023.00040

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/candar/candar2023w.html#HossainRAHKN23

  • Design and implementation of a practical control system for an air-conditioner with IoT sensor nodes

    Mengfang Duan, Yuta Kodera, Nobuya Ishihara, Yasuyuki Nogami, Takuya Kusaka

    2022 37th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC)   2022年7月

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/itc-cscc55581.2022.9894933

    researchmap

  • Improvement of Final Exponentiation for a Pairing on FK12 Curve and its Implementation

    Kazuma Ikesaka, Yuki Nanjo, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami

    2022 37th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC)   2022年7月

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/itc-cscc55581.2022.9894996

    researchmap

  • Comparison of conversion matrices for a compact AES–CTR defined over an isomorphic field

    Tomoya Hikida, Yasuyuki Nogami, Md. Arshad Ali, Yuta Kodera

    2022 37th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC)   2022年7月

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    DOI: 10.1109/itc-cscc55581.2022.9895089

    researchmap

  • A Consideration on Change the Transition Probability of SHAKE256 with Different Initial Values

    Tetsuro Ishida, Ryoichi Sato, Md. Arshad Ali, Takuya Kusaka, Yasuyuki Nogami, Yuta Kodera

    2022 37th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC)   2022年7月

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    DOI: 10.1109/itc-cscc55581.2022.9894931

    researchmap

  • A Business-to-Business Collaboration System That Promotes Data Utilization While Encrypting Information on the Blockchain

    Hiroaki Nasu, Yuta Kodera, Yasuyuki Nogami

    Sensors   22 ( 13 )   4909 - 4909   2022年6月

     詳細を見る

    掲載種別:研究論文(学術雑誌)  

    DOI: 10.3390/s22134909

    researchmap

  • Transition Probability Test for an RO-Based Generator and the Relevance between the Randomness and the Number of ROs.

    Yuta Kodera, Ryoichi Sato, Ali Md. Arshad, Takuya Kusaka, Yasuyuki Nogami

    Entropy   24 ( 6 )   780 - 780   2022年

     詳細を見る

    掲載種別:研究論文(学術雑誌)  

    DOI: 10.3390/e24060780

    researchmap

  • Efficient Final Exponentiation for Cyclotomic Families of Pairing-Friendly Elliptic Curves with Any Prime Embedding Degrees.

    Yuki Nanjo, Masaaki Shirase, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami

    Int. J. Netw. Comput.   12 ( 2 )   317 - 338   2022年

     詳細を見る

    掲載種別:研究論文(学術雑誌)  

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/journals/ijnc/ijnc12.html#NanjoSKKN22

  • A Study on Parameters of Piecewise Logistic Map over Large Integers and Processing Time.

    Ryo Inoue, Takeru Miyazaki, Satoshi Uehara, Shunsuke Araki, Yasuyuki Nogami

    ICCE-TW   169 - 170   2022年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/ICCE-Taiwan55306.2022.9869152

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/icce-tw/icce-tw2022.html#InoueMUAN22

  • Improvement of Optimal-Ate Pairing on Cocks-Pinch Curve with Embedding Degree 6 in Affine Coordinates.

    Tomohiro Iida, Kazuma Ikesaka, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami

    2022 Tenth International Symposium on Computing and Networking(CANDARW)   309 - 315   2022年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    DOI: 10.1109/CANDARW57323.2022.00043

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/ic-nc/candar2022w.html#IidaIKKN22

  • Improvement of Miller Loop for a Pairing on FK12 Curve and its Implementation.

    Kazuma Ikesaka, Yuki Nanjo, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami

    Tenth International Symposium on Computing and Networking(CANDAR)   104 - 109   2022年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    DOI: 10.1109/CANDAR57322.2022.00021

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/ic-nc/candar2022.html#IkesakaNKKN22

  • Proposal of Piccolo-CMAC for Sigfox network

    Wataru Takehisa, Ryo Fukushima, Ryoichi Sato, Daichi Hattori, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami

    2021 36th International Technical Conference on Circuits/Systems, Computers and Communications, ITC-CSCC 2021   2021年6月

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/ITC-CSCC52171.2021.9501429

    Scopus

    researchmap

  • Efficient Implementation of ECDH for Sigfox Communication

    Ryo Fukushima, Daichi Hattori, Wataru Takehisa, Ryoichi Sato, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami

    2021 36th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC)   2021年6月

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    DOI: 10.1109/itc-cscc52171.2021.9938141

    researchmap

  • Path Authentication Protocol: Based on a Lightweight MAC and a Nonlinear Filter Generator

    Yuki Taketa, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami

    Communications in Computer and Information Science   1383 CCIS   38 - 48   2021年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1007/978-3-030-72725-3_3

    Scopus

    researchmap

  • Consideration for Affects of an XOR in a Random Number Generator Using Ring Oscillators.

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

    Entropy   23 ( 9 )   1168 - 1168   2021年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)  

    DOI: 10.3390/e23091168

    Web of Science

    Scopus

    researchmap

  • Improvement of Final Exponentiation for Pairings on BLS Curves with Embedding Degree 15

    NANJO Yuki, SHIRASE Masaaki, KUSAKA Takuya, NOGAMI Yasuyuki

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences   104 ( 1 )   315 - 318   2021年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:一般社団法人 電子情報通信学会  

    <p>To be suitable in practice, pairings are typically carried out by two steps, which consist of the Miller loop and final exponentiation. To improve the final exponentiation step of a pairing on the BLS family of pairing-friendly elliptic curves with embedding degree 15, the authors provide a new representation of the exponent. The proposal can achieve a more reduction of the calculation cost of the final exponentiation than the previous method by Fouotsa et al.</p>

    DOI: 10.1587/transfun.2020EAL2046

    Web of Science

    Scopus

    CiNii Article

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/journals/ieiceta/ieiceta104.html#NanjoSKN21

  • Restrictions of Integer Parameters for Generating Attractive BLS Subfamilies of Pairing-Friendly Elliptic Curves with Specific Embedding Degrees

    Nanjo Yuki, Shirase Masaaki, Kusaka Takuya, Nogami Yasuyuki

    International Journal of Networking and Computing   11 ( 2 )   383 - 411   2021年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:IJNC編集委員会  

    Pairings are widely used for innovative protocols such as ID-based encryption and group signature authentication. According to the recent works, the Barreto-Lynn-Scott (BLS) family of pairing-friendly elliptic curves is suggested for the pairings at the various security levels. One of the important facts is that the BLS family has fixed polynomial parameters of a field characteristic and group order in terms of an integer x_0. For practical pairing-based protocols, we have to carefully find x_0 which leads to efficient pairings, however, this search of x_0 is typically complicated. Thus, it is desired some convenient ways of finding x_0 which have advantageous for the pairings. For this reason, Costello et al. proposed simple restrictions for finding x_0 that generates the specific BLS subfamilies of curves with embedding degree k = 24 having one of the best field and curve constructions for the pairings. Since there are demands of such restrictions for the other cases of the embedding degrees, the authors extend their work and provide these for the cases of k = 2^m 3 and 3^n with arbitrary integers m, n>0 in this paper. The results will help to find new parameters which lead to one of the best performing pairings with the BLS family of curves with various k. The results also allow us to respond to change in the security levels of the pairings flexibly according to the progress in the security analyses in the future.

    DOI: 10.15803/ijnc.11.2_383

    CiNii Article

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/journals/ijnc/ijnc11.html#NanjoSKN21

  • Sophisticated analysis of a method to eliminate fruitless cycles for Pollard's rho method with skew Frobenius mapping over a Barreto-Naehrig curve

    Miura Hiromasa, Kanzawa Syota, Matsumura Rikuya, Kodera Yuta, Kusaka Takuya, Nogami Yasuyuki

    International Journal of Networking and Computing   11 ( 2 )   231 - 250   2021年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:IJNC編集委員会  

    In this paper, the authors focus on and propose an approach to attack a kind of pairing-friendly curves, the Barreto-Naehring (BN) curve, to accelerate the evaluation of the security level concerning the elliptic curve discrete logarithm problem (ECDLP). More precisely, this paper targets the BN curve, which is known to be a pairing-friendly curve, and Pollard's rho method based on the random-walk is adopted to attack the curve.Though Pollard's rho method with skew Frobenius mapping is known to solve the ECDLP efficiently, this approach sometimes induces the unsolvable cycle, called the fruitless cycle, and such trials must restart with a different starting point. However, any effective method to eliminate such fruitless cycles has not been proposed. Therefore, the authors focus and give the sophisticated analysis to propose an effective approach to eliminate such cycles to optimize Pollard's rho method furthermore. In addition, we confirm the effectiveness of the method by applying it to a BN curve with 12, 17, and 33-bit parameters.

    DOI: 10.15803/ijnc.11.2_231

    CiNii Article

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/journals/ijnc/ijnc11.html#MiuraKMKKN21

  • A Proposal for Testing Physical Random Numbers Using Stochastic Process.

    Ryoichi Sato, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami

    IEEE International Conference on Consumer Electronics-Taiwan(ICCE-TW)   1 - 2   2021年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/ICCE-TW52618.2021.9603232

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/icce-tw/icce-tw2021.html#SatoKKN21

  • An Optimal Curve Parameters for BLS12 Elliptic Curve Pairing and Its Efficiency Evaluation.

    Daichi Hattori, Yuto Takahashi, Tomoya Tatara, Yuki Nanjo, Takuya Kusaka, Yasuyuki Nogami

    IEEE International Conference on Consumer Electronics-Taiwan(ICCE-TW)   1 - 2   2021年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/ICCE-TW52618.2021.9602941

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/icce-tw/icce-tw2021.html#HattoriTTNKN21

  • A Study on Relationship Between Period and Number of Divisions in Piecewise Logistic Map over Integers.

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

    IEEE International Conference on Consumer Electronics-Taiwan(ICCE-TW)   1 - 2   2021年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/ICCE-TW52618.2021.9602954

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/icce-tw/icce-tw2021.html#EguchiMUAN21

  • Consideration of Generating Suitable Parameters for Constructing type (h, m) Gauss Period Normal Basis.

    Keiji Yoshimoto, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami

    IEEE International Conference on Consumer Electronics-Taiwan(ICCE-TW)   1 - 2   2021年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/ICCE-TW52618.2021.9603240

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/icce-tw/icce-tw2021.html#YoshimotoKKN21

  • Secure Comparison Protocol for Promoting Business to Business Collaboration on the Blockchain.

    Hiroaki Nasu, Yuta Kodera, Yasuyuki Nogami

    IEEE International Conference on Consumer Electronics-Taiwan(ICCE-TW)   1 - 2   2021年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/ICCE-TW52618.2021.9603017

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/icce-tw/icce-tw2021.html#NasuKN21

  • A Property Management System Using Image Recognition by YOLO.

    Taiki Miyamoto, Ryo Fukushima, Kazuaki Harada, Keiji Yoshimoto, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami

    IEEE International Conference on Consumer Electronics-Taiwan(ICCE-TW)   1 - 2   2021年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/ICCE-TW52618.2021.9603146

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/icce-tw/icce-tw2021.html#MiyamotoFHYKKN21

  • A Study on Digital Watermarks for Audio Signals Using Phase of Frequency Signals in Addition to the Other Methods.

    Kako Takahashi, Takeru Miyazaki, Shunsuke Araki, Satoshi Uehara, Yasuyuki Nogami

    IEEE International Conference on Consumer Electronics-Taiwan(ICCE-TW)   1 - 2   2021年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/ICCE-TW52618.2021.9602917

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/icce-tw/icce-tw2021.html#TakahashiMAUN21

  • Efficient Final Exponentiation for Pairings on Several Curves Resistant to Special TNFS.

    Yuki Nanjo, Masaaki Shirase, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami

    Ninth International Symposium on Computing and Networking(CANDAR)   48 - 55   2021年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/CANDAR53791.2021.00014

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/ic-nc/candar2021.html#NanjoSKKN21

  • A Construction Method of Final Exponentiation for a Specific Cyclotomic Family of Pairing-Friendly Elliptic Curves with Prime Embedding Degrees.

    Yuki Nanjo, Masaaki Shirase, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami

    Ninth International Symposium on Computing and Networking(CANDAR)   148 - 154   2021年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/CANDAR53791.2021.00028

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/ic-nc/candar2021.html#NanjoSKKN21a

  • Consideration of the side-channel attack to SPECK implemented on Arduino Uno.

    Masaki Nakanose, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami

    Ninth International Symposium on Computing and Networking   339 - 345   2021年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/CANDARW53999.2021.00064

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/ic-nc/candar2021w.html#NakanoseKKN21

  • Consideration of the side-channel attack to SIMON implemented on Arduino Uno.

    Harunobu Enami, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami

    Ninth International Symposium on Computing and Networking   412 - 415   2021年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/CANDARW53999.2021.00075

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/ic-nc/candar2021w.html#EnamiKKN21

  • Multiplication and squaring in cubic and quartic extensions for pairing based cryptography

    Yuta Kodera, Yasuyuki Nogami

    Finite Fields and their Applications   71 - 86   2020年10月

     詳細を見る

  • A Technique for Fast Miller's Algorithm of Ate Pairings on Elliptic Curves with Embedding Degrees of Multiple of Three

    Yuki Nanjo, Masaaki Shirase, Takuya Kusaka, Yasuyuki Nogami

    ITC-CSCC 2020 - 35th International Technical Conference on Circuits/Systems, Computers and Communications   283 - 287   2020年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    Web of Science

    Scopus

    researchmap

  • An Explicit Formula of Cyclotomic Cubing Available for Pairings on Elliptic Curves with Embedding Degrees of Multiple of Three

    Yuki Nanjo, Masaaki Shirase, Takuya Kusaka, Yasuyuki Nogami

    ITC-CSCC 2020 - 35th International Technical Conference on Circuits/Systems, Computers and Communications   288 - 292   2020年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    Web of Science

    Scopus

    researchmap

  • Implementation and Evaluation of an Efficient MAC Based on OMAC for CAN on 8-Bit Microcomputer

    Yuta Fujioka, Hiroto Ogura, Yuki Ueno, Takuya Kusaka, Yasuyuki Nogami

    ITC-CSCC 2020 - 35th International Technical Conference on Circuits/Systems, Computers and Communications   342 - 347   2020年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    Web of Science

    Scopus

    researchmap

  • Electrical Falsification of CAN Data by Magnetic Coupling

    Hiroto Ogura, Ryunosuke Isshiki, Kengo Iokibe, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami

    ITC-CSCC 2020 - 35th International Technical Conference on Circuits/Systems, Computers and Communications   348 - 353   2020年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    Web of Science

    Scopus

    researchmap

  • Implementation and Evaluation of Ate Pairings on Elliptic Curves with Embedding Degree 10 Applied Type-II All-One Polynomial Extension Field of Degree 5

    Rikuya Matsumura, Yuto Takahashi, Yuki Nanjo, Takuya Kusaka, Yasuyuki Nogami

    ITC-CSCC 2020 - 35th International Technical Conference on Circuits/Systems, Computers and Communications   336 - 341   2020年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    Web of Science

    Scopus

    researchmap

  • An Implementation and Evaluation of a Pairing on Elliptic Curves with Embedding Degree 14

    Zihao Song, Rikuya Matsumura, Yuto Takahashi, Yuki Nanjo, Takuya Kusaka, Yasuyuki Nogami, Tsutomu Matsumoto

    ITC-CSCC 2020 - 35th International Technical Conference on Circuits/Systems, Computers and Communications   293 - 298   2020年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    Web of Science

    Scopus

    researchmap

  • An Efficient File Hierarchy Attribute Based Encryption Using Optimized Tate Pairing Construction in Cloud Environment

    Balaji Chandrasekaran, Yasuyuki Nogami, Ramadoss Balakrishnan

    Journal of Applied Security Research   15 ( 2 )   270 - 278   2020年4月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)  

    DOI: 10.1080/19361610.2019.1649534

    Web of Science

    Scopus

    researchmap

  • Secure Information Transmission Framework in Wireless Body Area Networks

    Balaji Chandrasekaran, Ramadoss Balakrishnan, Yasuyuki Nogami

    Journal of Applied Security Research   15 ( 2 )   279 - 287   2020年4月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)  

    DOI: 10.1080/19361610.2019.1669987

    Web of Science

    Scopus

    researchmap

  • A Performance Analysis and Evaluation of SIDH Applied Several Implementation-Friendly Quadratic Extension Fields

    Nanjo Yuki, Shirase Masaaki, Kusaka Takuya, Nogami Yasuyuki

    International Journal of Networking and Computing   10 ( 2 )   227 - 241   2020年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:IJNC編集委員会  

    It is well-known that quadratic extension fields (QEFs) based on optimal extension fields (OEFs) are typically used for supersingular isogeny Diffie-Hellman (SIDH) key exchange protocol. On the other hand, there is a possibility of the performance improvement of SIDH by employing other attractive choices of QEFs with efficient performing arithmetics which are based on all-one polynomial extension fields (AOPFs) and extension fields with normal basis representation (EFNs). Thus, the authors confirm that the applicability of the new candidates of QEFs for SIDH and evaluate SIDH applied the possible choices of QEFs. As a result of the experiment, the authors found that the performances of SIDH applied the QEFs based on AOPF and EFN are comparable to that of the previous QEF. Moreover, one of the QEFs based on EFN result in a new efficient implementation of the SIDH with SIDH-friendly prime given as p= 2^{e_A}3^{e_B}f+1 where e_A, e_B and $f$ are positive integers.

    DOI: 10.15803/ijnc.10.2_227

    CiNii Article

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/journals/ijnc/ijnc10.html#NanjoSKN20

  • A Construction Method of an Isomorphic Map between Quadratic Extension Fields Applicable for SIDH

    NANJO Yuki, SHIRASE Masaaki, KUSAKA Takuya, NOGAMI Yasuyuki

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences   103 ( 12 )   1403 - 1406   2020年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:一般社団法人 電子情報通信学会  

    <p>A quadratic extension field (QEF) defined by F1 = Fp[α]/(α2+1) is typically used for a supersingular isogeny Diffie-Hellman (SIDH). However, there exist other attractive QEFs Fi that result in a competitive or rather efficient performing the SIDH comparing with that of F1. To exploit these QEFs without a time-consuming computation of the initial setting, the authors propose to convert existing parameter sets defined over F1 to Fi by using an isomorphic map F1Fi.</p>

    DOI: 10.1587/transfun.2020TAL0002

    Web of Science

    Scopus

    CiNii Article

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/journals/ieiceta/ieiceta103.html#NanjoSKN20

  • Evaluating Side-Channel Resistance Using Low Order Rational Points Against Curve25519 and an Associated Quadratic Twist

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

    International Journal of Networking and Computing   10 ( 2 )   144 - 158   2020年

     詳細を見る

    掲載種別:研究論文(学術雑誌)  

    DOI: 10.15803/ijnc.10.2_144

    researchmap

  • Equivalent Keys of a Nonlinear Filter Generator Using a Power Residue Symbol.

    Yuta Kodera, Yuki Taketa, Takuya Kusaka, Yasuyuki Nogami, Satoshi Uehara

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   12231 LNCS   23 - 36   2020年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1007/978-3-030-58208-1_2

    Web of Science

    Scopus

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/iwsec/iwsec2020.html#KoderaTKNU20

  • An Approach for Attacking Speck on Microcontroller with Correlation Power Analysis.

    Jianjie Tang, Kengo Iokibe, Takuya Kusaka, Yasuyuki Nogami

    Proceedings - 2020 8th International Symposium on Computing and Networking Workshops, CANDARW 2020   368 - 372   2020年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/CANDARW51189.2020.00076

    Scopus

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/ic-nc/candar2020w.html#TangIKN20

  • Specific Congruence Classes of Integer Parameters for Generating BLS Curves for Fast Pairings.

    Yuki Nanjo, Masaaki Shirase, Takuya Kusaka, Yasuyuki Nogami

    Proceedings - 2020 8th International Symposium on Computing and Networking Workshops, CANDARW 2020   348 - 354   2020年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/CANDARW51189.2020.00073

    Scopus

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/ic-nc/candar2020w.html#NanjoSKN20

  • Improvement of Bit Distribution of Binary Sequence Generated by Alternative Trace Map Function.

    Fatema Akhter, Tomoya Tatara, Yasuyuki Nogami, Takuya Kusaka, Nobuo Funabiki

    Proceedings - 2020 8th International Symposium on Computing and Networking Workshops, CANDARW 2020   302 - 306   2020年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/CANDARW51189.2020.00066

    Scopus

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/ic-nc/candar2020w.html#AkhterTNKF20

  • Analysis of a method to eliminate fruitless cycles for Pollard's rho method with skew Frobenius mapping over a Barreto-Naehrig curve.

    Hiromasa Miura, Rikuya Matsumura, Takuya Kusaka, Yasuyuki Nogami

    Proceedings - 2020 8th International Symposium on Computing and Networking, CANDAR 2020   160 - 166   2020年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/CANDAR51075.2020.00029

    Scopus

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/ic-nc/candar2020.html#MiuraMKN20

  • A Study on Randomness of Sequences Obtained from Piecewise Logistic Map over Integers.

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

    Proceedings of 2020 International Symposium on Information Theory and its Applications, ISITA 2020   451 - 455   2020年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    Scopus

    researchmap

    その他リンク: https://dblp.uni-trier.de/conf/isita/2020

  • A Parallel Blum-Micali Generator Based on the Gauss Periods.

    Yuta Kodera, Tomoya Tatara, Takuya Kusaka, Yasuyuki Nogami, Satoshi Uehara

    Proceedings of 2020 International Symposium on Information Theory and its Applications, ISITA 2020   447 - 450   2020年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    Scopus

    researchmap

    その他リンク: https://dblp.uni-trier.de/conf/isita/2020

  • A Study on Binary Sequences Located in Hadamard Matrices of Order 2n.

    Kasumi Nakano, Kako Takahashi, Satoshi Uehara, Takeru Miyazaki, Shunsuke Araki, Yasuyuki Nogami

    Proceedings of 2020 International Symposium on Information Theory and its Applications, ISITA 2020   460 - 464   2020年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    Scopus

    researchmap

    その他リンク: https://dblp.uni-trier.de/conf/isita/2020

  • Mutual relationship between the neural network model and linear complexity for pseudorandom binary number sequence 査読

    Yuki Taketa, Yuta Kodera, Shogo Tanida, Takuya Kusaka, Yasuyuki Nogami, Norikazu Takahashi, Satoshi Uehara

    Proceedings of the Seventh International Symposium on Computing and Networking Workshops   394 - 400   2019年11月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/CANDARW.2019.00074

    Web of Science

    Scopus

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/ic-nc/candar2019w.html#TaketaKTKNTU19

  • An Implementation and Evaluation of Pairing Library ELiPS for BLS Curve with Several Techniques

    Yuto Takahashi, Yuki Nanjo, Takuya Kusaka, Yasuyuki Nogami, Tadaki Kanenari, Tomoya Tatara

    34th International Technical Conference on Circuits/Systems, Computers and Communications, ITC-CSCC 2019   296 - 299   2019年6月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    In recent years, pairing encryption is receiving a lot of attention since it enables many innovative and multi-functional cryptographic applications based on pairing e.g. searchable encryption, broadcast encryption and so on. Pairing is a map from two additive rational point groups mathbb{G}{1}, mathrm{G}{2} to a multiplicative group mathbb{G}{3}, however, it requires complexity computation. Therefore, the author tries to develop a 128-bit security level pairing library ELiPS (Efficient Library for Pairing Systems) that incorporates various high-speed methods using BLS curves. As a result, scalar multiplications on mathbb{G}{1} and mathbb{G}{2}, exponentiation on mathbb{G}{3}, and optimal-ate pairing can be computed in 0.42[ms], 0.79[ms], 1.13[ms], and 3.12[ms], respectively.

    DOI: 10.1109/ITC-CSCC.2019.8793376

    Web of Science

    Scopus

    researchmap

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

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

    34th International Technical Conference on Circuits/Systems, Computers and Communications, ITC-CSCC 2019   225 - 228   2019年6月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    In recent years, the number of companies are adopting cloud computing service for outsourcing is increasing. On the other hand, there are threats that are like falsification or leakage to data to be kept secret. Therefore, the technologies for managing encrypted data are the attractive topics in the cryptographic field. Among them, functional encryption which is constructed with pairing-based cryptography is closing to the practical stage because pairing operation is getting faster by the recent study of pairing. In addition, there are some pairing libraries which allow a user to introduce the pairing-based cryptography to their system. Nevertheless, they have some differences in several operations. In this paper, we reconstruct pairing-based homomorphic encryption by focusing on features of libraries and examine the performance evaluations of them.

    DOI: 10.1109/ITC-CSCC.2019.8793446

    Web of Science

    Scopus

    researchmap

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

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

    34th International Technical Conference on Circuits/Systems, Computers and Communications, ITC-CSCC 2019   275 - 278   2019年6月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    In recent years, CAN is spread widely as the in-vehicle network. However, CAN protocol does not guarantee the security for traffics against falsification and spoofing. Therefore, the MAC is required for CAN so as to communicate exactly. MAC is the countermeasure for falsification and spoofing using the secret key. The problem is a method of delivering the secret key securely. This paper proposes a method to update the secret key using broadcast encryption over a non-supersingular elliptic curve. The method is implemented on Raspberry Pi and experimentally find out to be able to update the secret key efficiently.

    DOI: 10.1109/ITC-CSCC.2019.8793298

    Web of Science

    Scopus

    researchmap

  • Analysis of the fruitless cycle of Pollard's rho method based attack for solving ECDLP over Barreto-Naehrig curves

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

    34th International Technical Conference on Circuits/Systems, Computers and Communications, ITC-CSCC 2019   237 - 240   2019年6月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    This paper focuses on the computational security of elliptic curve discrete logarithm (ECDLP), which can evaluate by an actual attack. The authors apply Pollard's rho method to a Barreto-Naehrig curve with minimum parameters for solving an ECDLP. An analysis of the structure for all combinations of a select of seed and starting points are given. Then, we propose the method for selecting a set of efficient seed points for a random walk for the rho method.

    DOI: 10.1109/ITC-CSCC.2019.8793449

    Web of Science

    Scopus

    researchmap

  • 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月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

  • 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月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

  • 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月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

  • 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月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

  • A Study on the Parameter Size of the Montgomery Trick for ECDLP 査読

    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月

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    © 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

    Scopus

    researchmap

  • A Study on the Parameter of the Distinguished Point Method in Pollard's Rho Method for ECDLP 査読

    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月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/isita/isita2018.html#IkutaJKKKN18a

  • 市販マイコンモジュールを利用した暗号ハードウェアセキュリティ演習の開発

    五百旗頭 健吾, 上竹 嘉紀, 手嶋 俊彰, 眞田 晃宏, 野上 保之

    コンピュータ ソフトウェア   36 ( 1 )   30 - 36   2019年

     詳細を見る

    記述言語:日本語   出版者・発行元:日本ソフトウェア科学会  

    IoT機器の情報セキュリティを保証するために不可欠な技術の1つである暗号技術に関する実践的な演習科目を開発した.開発した演習は,現代暗号の基礎となっている代数学や離散数学の座学,暗号アルゴリズムのハードウェア実装,そして実装した暗号ハードウェアへのサイドチャネル攻撃実験で構成される.本演習では,暗号アルゴリズムの教科書的な知識を学ぶだけでなく,受講生自身が暗号アルゴリズムを市販ハードウェアへ実装し,その実装ハードウェアへの攻撃を実行することで,実用上の脅威を体験し,そのような脅威を考慮して暗号アルゴリズムを実装する重要性を理解することを目標としている.本演習を学部3, 4年生50名に対して実施し,ほぼ全員がこの目標を達成した.さらに受講生へのアンケートによると,ほぼ全ての受講生が暗号技術に関する実践力向上を実感する結果を得た.

    DOI: 10.11309/jssst.36.30

    Scopus

    CiNii Article

    CiNii Books

    researchmap

  • 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年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/iwsda/iwsda2019.html#MiyazakiAKUN19

  • 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年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

    その他リンク: 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年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/sii/sii2019.html#KamiyamaMOWN19

  • 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年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/ic-nc/candar2019w.html#KageyamaINKKN19

  • 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年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

    その他リンク: 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年

     詳細を見る

    掲載種別:論文集(書籍)内論文   出版者・発行元: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

    Scopus

    researchmap

  • 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年

     詳細を見る

    掲載種別:研究論文(学術雑誌)   出版者・発行元: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

  • Efficient ate-based pairing over the attractive classes of BN curves 査読

    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年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    © 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

    Scopus

    researchmap

  • 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年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

    その他リンク: 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年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

    その他リンク: 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年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

    その他リンク: 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年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

    その他リンク: 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年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/iwsda/iwsda2019.html#EguchiMAUN19

  • 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年

     詳細を見る

    掲載種別:研究論文(学術雑誌)  

    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

    Scopus

    researchmap

  • Multi-Value Sequence Generated over Sub Extension Field and Its Properties 査読

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

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

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:Scientific Research Publishing, Inc.  

    DOI: 10.4236/jis.2019.103008

    researchmap

  • A Comparative Implementation of GLV Technique on KSS-16 Curve 査読

    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月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/ic-nc/candar2018.html#KhandakerNKN18

  • Consideration of efficient pairing applying two construction methods of extension fields 査読

    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月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

    その他リンク: 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月

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    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

    Scopus

    researchmap

  • 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月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

  • 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月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

  • 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月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

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

    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月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

    その他リンク: 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 査読

    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月

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    © 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

    Scopus

    researchmap

  • Distribution of Digit Patterns in Multi-Value Sequence over the Odd Characteristic Field. 査読

    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年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)  

    DOI: 10.1587/transfun.E101.A.1525

    Web of Science

    Scopus

    researchmap

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

    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年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Scopus

    researchmap

  • A Study on the Parameter Size of the Montgomery Trick for ECDLP. 査読

    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年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

  • Efficient Parallel Simeck Encryp tion with GPGPU and OpenCL 査読

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

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

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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.

    Web of Science

    researchmap

  • Efficient Pairing-Based Cryptography on Raspberry Pi. 査読

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

    JCM   13 ( 2 )   88 - 93   2018年

     詳細を見る

    掲載種別:研究論文(学術雑誌)  

    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

    Scopus

    researchmap

  • Advanced Searchable Encryption: Keyword Search for Matrix-Type Storage. 査読

    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年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE Computer Society  

    DOI: 10.1109/CANDARW.2018.00061

    Web of Science

    Scopus

    researchmap

  • Linear Complexity of Geometric Sequences Defined by Cyclotomic Classes and Balanced Binary Sequences Constructed by the Geometric Sequences. 査読

    Kazuyoshi Tsuchiya, Chiaki Ogawa, Yasuyuki Nogami, Satoshi Uehara

    CoRR   abs/1809.04957   2018年

     詳細を見る

    掲載種別:研究論文(学術雑誌)  

    researchmap

  • 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年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

    その他リンク: 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年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/ic-nc/candar2018w.html#CarelIKNA18

  • Consideration of Efficient Pairing Applying Two Construction Methods of Extension Fields. 査読

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

    Sixth International Symposium on Computing and Networking   445 - 451   2018年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE Computer Society  

    DOI: 10.1109/CANDARW.2018.00087

    researchmap

  • 2台の2輪独立駆動型ロボットを用いた全方向協調搬送システムの開発

    森下 真成, 前山 祥一, 野上 保之, 渡辺 桂吾

    ロボティクス・メカトロニクス講演会講演概要集   2018   1711 - 1715   2018年

     詳細を見る

    記述言語:英語   出版者・発行元:一般社団法人 日本機械学会  

    DOI: 10.1109/SMC.2018.00296

    Web of Science

    Scopus

    CiNii Article

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/smc/smc2018.html#MorishitaMNW18

  • An Extended Generalized Minimum Distance Decoding for Binary Linear Codes on a 4-Level Quantization over an AWGN Channel. 査読

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

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

     詳細を見る

    掲載種別:研究論文(学術雑誌)  

    DOI: 10.1587/transfun.E101.A.1235

    researchmap

  • A Comparative Implementation of GLV Technique on KSS-16 Curve. 査読

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

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

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Scopus

    researchmap

  • 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年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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.

    Web of Science

    researchmap

  • 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年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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.

    Web of Science

    researchmap

  • 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月

     詳細を見る

    掲載種別:研究論文(学術雑誌)   出版者・発行元:MECS Publisher  

    DOI: 10.5815/ijcnis.2017.09.07

    researchmap

  • Detecting falsification to MP3 audio signals for conference record using digital watermarking 査読

    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月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

  • Distribution of bit patterns on multi-value sequence over odd characteristics field 査読

    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月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

  • Security analysis of Raspberry Pi against Side-channel attack with RSA cryptography 査読

    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月

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    © 2017 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

    Scopus

    researchmap

  • 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月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

  • Solving 114-Bit ECDLP for a Barreto-Naehrig Curve. 査読

    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年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

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

    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年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    DOI: 10.1109/IWSDA.2017.8097082

    Web of Science

    Scopus

    researchmap

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

    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年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    DOI: 10.1109/IWSDA.2017.8095741

    Web of Science

    Scopus

    researchmap

  • Linear complexity of generalized NTU sequences. 査読

    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年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    DOI: 10.1109/IWSDA.2017.8095739

    Web of Science

    Scopus

    researchmap

  • An Efficient Implementation of Trace Calculation over Finite Field for a Pseudorandom Sequence. 査読

    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年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE Computer Society  

    DOI: 10.1109/CANDAR.2017.86

    Web of Science

    Scopus

    researchmap

  • An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication 査読

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

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

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/icisc/icisc2016.html#KhandakerONSD16

  • Distribution of Bit Patterns on Multi-value Sequence over Odd Characteristics Field 査読

    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年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

  • Security Analysis of Raspberry Pi Against Side-Channel Attack with RSA Cryptography 査読

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

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

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Web of Science

    Scopus

    researchmap

  • Efficient Optimal Ate Pairing at 128-bit Security Level. 査読

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

    IACR Cryptology ePrint Archive   2017   1174 - 1174   2017年

     詳細を見る

    掲載種別:研究論文(学術雑誌)  

    researchmap

  • Parallel Implementations of SIMON and SPECK, Revisited. 査読

    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年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元: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

    Scopus

    researchmap

  • Efficient Scalar Multiplication for Ate Based Pairing over KSS Curve of Embedding Degree 18 査読

    Khandaker, Md. Al-Amin, Nogami, Yasuyuki, Seo, Hwajeong, Duquesne, Sylvain

    INFORMATION SECURITY APPLICATIONS, WISA 2016   10144   221 - 232   2017年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:SPRINGER INTERNATIONAL PUBLISHING AG  

    Efficiency of the next generation pairing based security protocols rely not only on the faster pairing calculation but also on efficient scalar multiplication on higher degree rational points. In this paper we proposed a scalar multiplication technique in the context of Ate based pairing with Kachisa-Schaefer-Scott (KSS) pairing friendly curves with embedding degree k = 18 at the 192-bit security level. From the systematically obtained characteristics p, order r and Frobenious trace t of KSS curve, which is given by certain integer z also known as mother parameter, we exploit the relation #E(F-p) = p + 1-t mod r by applying Frobenius mapping with rational point to enhance the scalar multiplication. In addition we proposed z-adic representation of scalar s. In combination of Frobenious mapping with multi-scalar multiplication technique we efficiently calculate scalar multiplication by s. Our proposed method can achieve 3 times or more than 3 times faster scalar multiplication compared to binary scalar multiplication, sliding-window and non-adjacent form method.

    DOI: 10.1007/978-3-319-56549-1_19

    Web of Science

    Scopus

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/wisa/wisa2016.html#KhandakerNSD16

  • Efficient scalar multiplication for ate based pairing over kss curve of embedding degree 18 査読

    Md Al Amin Khandaker, Yasuyuki Nogami, Hwajeong Seo, Sylvain Duquesne

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   10144 LNCS   221 - 232   2017年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    © Springer International Publishing AG 2017. Efficiency of the next generation pairing based security protocols rely not only on the faster pairing calculation but also on efficient scalar multiplication on higher degree rational points. In this paper we proposed a scalar multiplication technique in the context of Ate based pairing with Kachisa-Schaefer-Scott (KSS) pairing friendly curves with embedding degree k = 18 at the 192-bit security level. From the systematically obtained characteristics p, order r and Frobenious trace t of KSS curve, which is given by certain integer z also known as mother parameter, we exploit the relation #E(F p) = p+1−t mod r by applying Frobenius mapping with rational point to enhance the scalar multiplication. In addition we proposed z-adic representation of scalar s. In combination of Frobenious mapping with multi-scalar multiplication technique we efficiently calculate scalar multiplication by s. Our proposed method can achieve 3 times or more than 3 times faster scalar multiplication compared to binary scalar multiplication, sliding-window and non-adjacent form method.

    DOI: 10.1007/978-3-319-56549-1_19

    Scopus

    researchmap

  • Efficient Optimal Ate Pairing at 128-Bit Security Level. 査読

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

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   10698 LNCS   186 - 205   2017年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:SPRINGER INTERNATIONAL PUBLISHING AG  

    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 (BLS-12) [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 pairing-friendly 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

    Scopus

    researchmap

  • An ECC Implementation with a Twisted Montgomery Curve over Fq32 on an 8-Bit Microcontroller. 査読

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

    Web of Science

    Scopus

    researchmap

  • Interleaved sequences of geometric sequences binarized with Legendre symbol of two types.

    Kazuyoshi Tsuchiya, Yasuyuki Nogami, Satoshi Uehara

    CoRR   abs/1709.05163   2017年

     詳細を見る

    掲載種別:研究論文(学術雑誌)  

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/journals/corr/corr1709.html#abs-1709-05163

  • Efficient operation over F<inf>(24)2</inf> for security technologies

    Norito Jitsui, Yasuyuki Nogami, Hwajeong Seo, Nasima Begum

    2016 IEEE International Conference on Consumer Electronics-Taiwan, ICCE-TW 2016   17 - 18   2016年7月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    Binary extension field F28 is recently used for AES encryption and IoT (Internet of Things) security with PUF (Physical Unclonable Function). The calculations over tower field such as F(24)2 or F((22)2)2 become more efficient than that of over F28. This paper focuses on the efficient calculations over F(24)2.

    DOI: 10.1109/ICCE-TW.2016.7520896

    Web of Science

    Scopus

    researchmap

  • A dynamic job scheduling method for reliable and high-performance volunteer computing

    Shinya Yasuda, Yasuyuki Nogami, Masaru Fukushi

    2015 IEEE 2nd International Conference on InformationScience and Security, ICISS 2015   100 - 103   2016年1月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    This paper proposes a dynamic job scheduling method for reliable and high-performance volunteer computing. In volunteer computing, each job is replicated and allocated to multiple participants (workers) to remove incorrect results by a voting mechanism. Hence, the number of workers necessary to complete a job is an important factor for the system performance; however, this is not well-considered in the existing methods. The proposed method defines the expected probability of completion for each job based on the worker's secession probability. By allocating each job so that the expected probability is always greater than a specified value, the proposed method avoids excess job allocation, which leads to the higher performance. The performance of the proposed method is evaluated by computer simulation, under the two scenarios of workers having uniform and different processing speeds. It is found that the performance of the proposed method is higher than the existing method especially under the practical latter scenario.

    DOI: 10.1109/ICISSEC.2015.7370964

    Web of Science

    Scopus

    researchmap

  • An Improvement of Scalar Multiplication on Elliptic Curve Defined over Extension Field F-q(2) 査読

    Khandaker Md. Al-Amin, Yasuyuki Nogami

    2016 IEEE INTERNATIONAL CONFERENCE ON CONSUMER ELECTRONICS-TAIWAN (ICCE-TW)   13 - 14   2016年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    In elliptic curve cryptography (ECC), a scalar multiplication for rational point is the most time consuming operation. This paper proposes an efficient calculation for a scalar multiplication by applying Frobenious Mapping. Particularly, this paper deals with Barreto-Naehrig curve defined over extension field F-q(2), where q - p(6) and p is a large prime.

    DOI: 10.1109/ICCE-TW.2016.7520894

    Web of Science

    Scopus

    researchmap

  • A Consideration of Towering Scheme for Efficient Arithmetic Operation over Extension Field of Degree 18 査読

    Khandaker, Md. Al-Amin, Nogami, Yasuyuki

    PROCEEDINGS OF THE 2016 19TH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY (ICCIT)   276 - 281   2016年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    Barreto-Naehrig (BN) curve is a well studied pairing friendly curve of embedding degree 12, that uses arithmetic in F-p12. Therefore the arithmetic of F-p12 extension field is well studied. In this paper, we have proposed an efficient approach of arithmetic operation over the extension field of degree 18 by towering. F-p18 extension field arithmetic is considered to be the basis of implementing the next generation pairing based security protocols. We have proposed to use F-p element to construct irreducible binomial for building tower of extension field up to F-p6, where conventional approach uses the root of previous irreducible polynomial to create next irreducible polynomials. Therefore using F-p elements in irreducible binomial construction, reduces the number of multiplications in F-p to calculate inversion and multiplication over F-p18, which effects acceleration in total arithmetic operation over F-p18.

    DOI: 10.1109/ICCITECHN.2016.7860209

    Web of Science

    Scopus

    researchmap

  • Isomorphic Mapping for Ate-based Pairing over KSS Curve of Embedding Degree 18 査読

    Khandaker, Md. Al-Amin, Nogami, Yasuyuki

    2016 FOURTH INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR)   629 - 634   2016年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    Pairing based cryptography is considered as the next generation of security for which it attracts many researcher to work on faster and efficient pairing to make it practical. Among the several challenges of efficient pairing; efficient scalar multiplication of rational point defined over extension field of degree k >= 12 is important. However, there exists isomorphic rational point group defined over relatively lower degree extension field. Exploiting such property, this paper has showed a mapping technique between isomorphic rational point groups in the context of Ate-based pairing with Kachisa-Schaefer-Scott (KSS) pairing friendly curve of embedding degree k = 18. In the case of KSS curve, there exists sub-field sextic twisted curve that includes sextic twisted isomorphic rational point group defined over F(p)3. This paper has showed the mapping procedure from certain F(p)18 rational point group to its sub-field isomorphic rational point group in F(p)3 and vice versa. This paper has also showed that scalar multiplication is about 20 times faster after applying the proposed mapping which in-turns resembles that the impact of this mapping will greatly enhance the pairing operation in KSS curve.

    DOI: 10.1109/CANDAR.2016.38

    Web of Science

    Scopus

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/ic-nc/candar2016.html#KhandakerN16

  • A new approach for generating well balanced Pseudo-random signed binary sequence over odd characteristic field. 査読

    Ali Md. Arshad, Yasuyuki Nogami, Chiaki Ogawa, Hiroto Ino, Satoshi Uehara, Robert Morelos-Zaragoza,Kazuyoshi Tsuchiya

    2016 International Symposium on Information Theory and Its Applications, ISITA 2016, Monterey, CA, USA, October 30 - November 2, 2016   777 - 780   2016年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    Web of Science

    Scopus

    researchmap

    その他リンク: http://dblp.uni-trier.de/db/conf/isita/isita2016.html#conf/isita/ArshadNOIUMT16

  • Auto and Cross Correlation of Well Balanced Sequence over Odd Characteristic Field. 査読

    Ali Md. Arshad, Yasuyuki Nogami, Hiroto Ino, Satoshi Uehara

    Fourth International Symposium on Computing and Networking, CANDAR 2016, Hiroshima, Japan, November 22-25, 2016   604 - 609   2016年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE Computer Society  

    DOI: 10.1109/CANDAR.2016.0109

    Web of Science

    Scopus

    researchmap

  • Pseudo Random Sequence over Finite Field using Mobius Function 査読

    Fatema Akhter, Yasuyuki Nogami

    2016 INTERNATIONAL WORKSHOP ON COMPUTATIONAL INTELLIGENCE (IWCI)   68 - 72   2016年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    Pseudo random sequences play an important role in cryptography and network security system. This paper proposes a new approach for generation of pseudo random sequence over odd characteristic field. The sequence is generated by applying a primitive polynomial over odd characteristic field, trace function and mobius function. Then, some important properties of the newly generated sequence such as period, autocorrelation and cross-correlation have been studied in this work. The properties of the generated sequence are evaluated on various bit length of odd characteristics. Finally, the experimental results are compared with existing works which show the superiority of the proposed sequence over existing ones.

    Web of Science

    researchmap

  • Linear Complexity of Signed Binary Sequence Over Odd Characteristic Field 査読

    Ali Md. Arshad, Hiroto Ino, Chiaki Ogawa, Yasuyuki Nogami

    PROCEEDINGS OF THE 2016 19TH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY (ICCIT)   266 - 269   2016年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    In our previous work, well balanced pseudo random signed binary sequence generated by using trace function and Legendre symbol has been researched. Our previous sequence generated by applying primitive polynomial over odd characteristic field F-p, trace function and Legendre symbol. The important features such as period, periodic autocorrelation, and cross-correlation have already been well discussed in our previous work. In this paper, the signed binary sequence is generated by utilizing one additional parameter A. Let p be an odd prime and F-p is an odd characteristic prime field and m be the degree of the primitive polynomial f(x). The procedure for generating sequence is as follows: primitive polynomial f (x) generates maximum length vector sequence, then trace function Tr (.) maps an element of extension field F(p)m to an element of prime field F-p, next a non-zero scalar A is an element of F-p is added to the trace value and finally Legendre symbol is used to map the scalars into signed binary sequence. In this paper, the authors have restricted the discussion on linear complexity and linear complexity profile properties of signed binary sequence based on some experimental results.

    DOI: 10.1109/ICCITECHN.2016.7860207

    Web of Science

    Scopus

    researchmap

  • Parallel Implementations of LEA, Revisited.

    Hwajeong Seo, Taehwan Park, Shinwook Heo, Gyuwon Seo, Bongjin Bae, Zhi Hu, Lu Zhou, Yasuyuki Nogami, Youwen Zhu, Howon Kim

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   10144 LNCS   318 - 330   2016年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:SPRINGER INTERNATIONAL PUBLISHING AG  

    In this paper we revisited the parallel implementations of LEA. By taking the advantages of both the light-weight features of LEA and the parallel computation abilities of ARM-NEON platforms, performance is significantly improved. We firstly optimized the implementations on ARM and NEON architectures. For ARM processor, barrel shifter instruction is used to hide the latencies for rotation operations. For NEON engine, the minimum number of NEON registers are assigned to the round key variables by performing the on-time round key loading from ARM registers. This approach reduces the required NEON registers for round key variables by three registers and the registers and temporal registers are used to retain four more plaintext for encryption operation. Furthermore, we finely transform the data into SIMD format by using transpose and swap instructions. The compact ARM and NEON implementations are combined together and computed in mixed processing way. This approach hides the latency of ARM computations into NEON overheads. Finally, multiple cores are fully exploited to perform the maximum throughputs on the target devices. The proposed implementations achieved the fastest LEA encryption within 3.2 cycle/byte for Cortex-A9 processors.

    DOI: 10.1007/978-3-319-56549-1_27

    Web of Science

    Scopus

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/wisa/wisa2016.html#SeoPHSBHZNZK16

  • Pseudo random sequence over finite field using Möbius Function.

    Fatema Akhter, Yasuyuki Nogami

    IWCI 2016 - 2016 International Workshop on Computational Intelligence   69 - 73   2016年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    Pseudo random sequences play an important role in cryptography and network security system. This paper proposes a new approach for generation of pseudo random sequence over odd characteristic field. The sequence is generated by applying a primitive polynomial over odd characteristic field, trace function and möbius function. Then, some important properties of the newly generated sequence such as period, autocorrelation and cross-correlation have been studied in this work. The properties of the generated sequence are evaluated on various bit length of odd characteristics. Finally, the experimental results are compared with existing works which show the superiority of the proposed sequence over existing ones.

    DOI: 10.1109/IWCI.2016.7860341

    Scopus

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/iwci/iwci2016.html#AkhterN16

  • A Pseudo-random Binary Sequence Generated by Using Primitive Polynomial of Degree 2 over Odd Characteristic Field F-p 査読

    Ali Md. Arshad, Yasuyuki Nogami

    2016 IEEE INTERNATIONAL CONFERENCE ON CONSUMER ELECTRONICS-TAIWAN (ICCE-TW)   15 - 16   2016年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    Let p be an odd prime number as the characteristic of finite field, this paper introduces a pseudo random binary sequence generated by a primitive polynomial of degree 2 over F-p, trace function, and Legendre symbol. Then, its period and autocorrelation are introduced with a small example.

    DOI: 10.1109/ICCE-TW.2016.7520895

    Web of Science

    Scopus

    researchmap

  • Highly Efficient GF(2^8) Inversion Circuit Based on Redundant GF Arithmetic and Its Application to AES Design 査読

    Rei Ueno, Naofumi Homma, Yukihiro Sugawara, Yasuyuki Nogami, Takafumi Aoki

    International Conference on Cryptographic Hardware and Embedded Systems   9293 ( 9293 )   63 - 80   2015年9月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1007/978-3-662-48324-4_4

    Web of Science

    Scopus

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/ches/ches2015.html#UenoHSNA15

  • Efficient implimentation of NTRU over all one polynomial ring with CVMA

    Koki Misumi, Yasuyuki Nogami

    2015 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2015   384 - 385   2015年8月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    It is shown that public key cryptosystems based on discrete logarithm probrem can be solved if the quantum computer and Shor's algorithm are realized. Thus a new cryptosystem called post-quantum cryptosystem so as not to be broken by quantum computer is needed. NTRU is proposed by Hoffstein et al. in 1998. It is one of post-quantum cryptosystem. It is based on problems on lattice for which there are no efficient algorithms to solve. In NTRU, using convolution polynomial ring as Zq[X]/(Xn-1). However, (X-1), that is a trivial factor of Xn-1 sometimes make problems. Thus we consider a variant using a quotient polynomial ring such as Zq[X]/(Xn + Xx-1 +...+X + 1) and CVMA: Cyclic Vector Multiplication Algorithm.

    DOI: 10.1109/ICCE-TW.2015.7216956

    Web of Science

    Scopus

    researchmap

  • A performance evaluation of Web-based volunteer computing using applications with GMP

    Shoma Kajitani, Yasuyuki Nogami, Masaru Fukushi, Noriki Amano

    2015 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2015   41 - 42   2015年8月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    This paper presents the performance evaluations of GMP-based applications on Web-based Volunteer Computing (VC) systems. Web-based VC is expected to gather many volunteer participants (workers) by allowing workers to execute a computation program (job) on Web browsers. On the other hand, the job execution performance on workers degraded because jobs are executed on Web browsers. To reveal the actual performance of Web-based VC, we convert practical applications which use GMP, that is a multi-precision library for scientific computations, and evaluate its performance. The experimental results show that the performance degradation is negligibly small in some cases, e.g. a short bit-length of arguments. This paper also shows a potential for the performance improvement of Web-based VC by substituting GMP functions.

    DOI: 10.1109/ICCE-TW.2015.7216970

    Web of Science

    Scopus

    researchmap

  • An implementation of credibility-based job scheduling method in volunteer computing systems

    Shun Ichiro Tani, Yasuyuki Nogami, Masaru Fukushi

    2015 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2015   37 - 38   2015年8月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    This paper addresses a job scheduling problem in Volunteer Computing (VC) systems, where some malicious participant may return incorrect results (sabotaging). Credibility-based job scheduling method, namely ENR-ECJ, is a promising approach to realize high-performance and sabotage-tolerant VC systems based on the credibility of each participant (worker). However, managing the credibility values in the management node may cause considerable performance degradation of whole the system. By implementing ENR-ECJ into a small scale VC system, this paper demonstrates the primacy of ENR-ECJ over existing methods and reveals its condition through the performance evaluation for various number of workers. The results show that ENR-EJC improves the overall performance about 10% when the access frequency of workers is less than 2 per second.

    DOI: 10.1109/ICCE-TW.2015.7216948

    Web of Science

    Scopus

    researchmap

  • An Improvement of Tate Paring with Supersingular Curve 査読

    Akito Kumano, Yasuyuki Nogami

    2015 2ND INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND SECURITY (ICISS)   37 - 39   2015年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    Vector decomposition problem has been proposed on some supersingular curves whose embedding degree is 2 for example. In order to apply the problem as a trapdoor for some innovative cryptosystems, it is necessary to make pairing-related calculations more efficient. Our previous work has considered an approach for Tate pairing on a supersingular curve of embedding degree 2 over extension field of extension degree 2. It improved both Miller's algorithm and final exponentiation that was required for the Tate pairing. In detail, one multiplication in the calculation of Miller's loop was eliminated by using a twist mapping. This paper shows a more improved calculation of pairing with some experimental result for the efficiency discussion.

    DOI: 10.1109/ICISSEC.2015.7370982

    Web of Science

    Scopus

    researchmap

  • Faster ECC over F2571 (feat. PMULL).

    Hwajeong Seo, Zhe Liu 0001, Yasuyuki Nogami, Jongseok Choi, Howon Kim

    IACR Cryptol. ePrint Arch.   2015   745 - 745   2015年

     詳細を見る

    掲載種別:研究論文(学術雑誌)  

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/journals/iacr/iacr2015.html#Seo0NCK15a

  • Binary Field Multiplication on ARMv8.

    Hwajeong Seo, Zhe Liu 0001, Yasuyuki Nogami, Jongseok Choi, Howon Kim

    IACR Cryptol. ePrint Arch.   2015   688 - 688   2015年

     詳細を見る

    掲載種別:研究論文(学術雑誌)  

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/journals/iacr/iacr2015.html#Seo0NCK15

  • Secure Binary Field Multiplication.

    Hwajeong Seo, Chien-Ning Chen, Zhe Liu 0001, Yasuyuki Nogami, Taehwan Park, Jongseok Choi, Howon Kim

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   9503   161 - 173   2015年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:Springer  

    Binary field multiplication is the most fundamental building block of binary field Elliptic Curve Cryptography (ECC) and Galois/Counter Mode (GCM). Both bit-wise scanning and Look-Up Table (LUT) based methods are commonly used for binary field multiplication. In terms of Side Channel Attack (SCA), bit-wise scanning exploits insecure branch operations which leaks information in a form of timing and power consumption. On the other hands, LUT based method is regarded as a relatively secure approach because LUT access can be conducted in a regular and atomic form. This ensures a constant time solution as well. In this paper, we conduct the SCA on the LUT based binary field multiplication. The attack exploits the horizontal Correlation Power Analysis (CPA) on weights of LUT. We identify the operand with only a power trace of binary field multiplication. In order to prevent SCA, we also suggest a mask based binary field multiplication which ensures a regular and constant time solution without LUT and branch statements.

    DOI: 10.1007/978-3-319-31875-2_14

    Scopus

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/wisa/wisa2015.html#SeoC0NPCK15

  • Secure Binary Field Multiplication.

    Hwajeong Seo, Chien-Ning Chen, Zhe Liu 0001, Yasuyuki Nogami, Taehwan Park, Jongseok Choi, Howon Kim

    IACR Cryptol. ePrint Arch.   2015   799 - 799   2015年

     詳細を見る

    掲載種別:研究論文(学術雑誌)  

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/journals/iacr/iacr2015.html#SeoC0NPCK15

  • Highly Efficient GF(28) Inversion Circuit Based on Redundant GF Arithmetic and Its Application to AES Design.

    Rei Ueno, Naofumi Homma, Yukihiro Sugawara, Yasuyuki Nogami, Takafumi Aoki

    IACR Cryptol. ePrint Arch.   2015   763 - 763   2015年

     詳細を見る

    掲載種別:研究論文(学術雑誌)  

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/journals/iacr/iacr2015.html#UenoHSNA15

  • Periods of Sequences Generated by the Logistic Map over Finite Fields with Control Parameter Four 査読

    Kazuyoshi Tsuchiya, Yasuyuki Nogami

    2015 SEVENTH INTERNATIONAL WORKSHOP ON SIGNAL DESIGN AND ITS APPLICATIONS IN COMMUNICATIONS (IWSDA)   155 - 159   2015年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    Recently, binary sequences generated by chaotic maps have been widely studied. In particular, the logistic map is used as one of the chaotic map. However, if the logistic map is implemented by using finite precision computer arithmetic, rounding is required. In order to avoid rounding, Miyazaki, Araki, Uehara and Nogami proposed the logistic map over finite fields, and show some properties of sequences generated by the logistic map over finite fields. In this paper, we show some properties of periods of sequences generated by the logistic map over finite fields with control parameter four. In particular, we show conditions for parameters and initial values to have a long period, and asymptotic properties for periods by numerical experiments.

    DOI: 10.1109/IWSDA.2015.7458394

    Web of Science

    Scopus

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/iwsda/iwsda2015.html#TsuchiyaN15

  • A Consideration on Crosscorrelation of a Kind of Trace Sequences over Finite Field. 査読

    Hiroto Ino, Yasuyuki Nogami, Nasima Begum, Satoshi Uehara, Robert Morelos-Zaragoza,Kazuyoshi Tsuchiya

    Third International Symposium on Computing and Networking, CANDAR 2015, Sapporo, Hokkaido, Japan, December 8-11, 2015   484 - 486   2015年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE Computer Society  

    DOI: 10.1109/CANDAR.2015.53

    Web of Science

    Scopus

    researchmap

  • An Efficiency Improvement in an Anonymous Credential System for CNF Formulas on Attributes with Constant-size Proofs 査読

    Nasima Begum, Toru Nakanishi, Yasuyuki Nogami

    2ND INTERNATIONAL CONFERENCE ON ELECTRICAL ENGINEERING AND INFORMATION COMMUNICATION TECHNOLOGY (ICEEICT 2015)   2015年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    An anonymous credential system allows a user to convince a service provider anonymously that he/she owns certified attributes. Previously, we proposed a paring-based anonymous credential system with constant size of proofs, where the combinations of logical AND and OR relations on user attributes can be proved as CNF formulas. However, this system has a problem of requiring large online computation time during authentication, which depends on the number of AND relations in the proved formula. In this paper, we propose an efficiency improvement of the computational overhead based on online/offline precomputation technique. In our improvement, all exponentiations that can be used for the accumulator and witness computations are executed in advance in the precomputation algorithm. Thus, exponentiations in the online accumulator and witness computations are excluded, and only multiplications are needed. We implemented the system using a fast pairing library, and measured the processing times, while changing the size of the proved CNF formula. The experimental result shows that the computational costs of the proof generation in the case of using lots of AND relations are greatly reduced than the previous system. Hence, it is practical for mobile users.

    DOI: 10.1109/ICEEICT.2015.7307538

    Web of Science

    Scopus

    researchmap

  • Reduction of Authentication Time in an Anonymous Credential System with Proofs for Monotone Formulas on Attributes 査読

    Nasima Begum, Toru Nakanishi, Yasuyuki Nogami

    2015 IEEE INTERNATIONAL CONFERENCE ON CONSUMER ELECTRONICS - TAIWAN (ICCE-TW)   376 - 377   2015年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    An anonymous credential system allows a user to convince a service provider anonymously that he/she owns certified attributes. Previously, an anonymous credential system was proposed to prove user's attributes to satisfy a monotone formula, i.e., a logic relation with any combination of AND/OR relations. However, this system has a problem of requiring large authentication time which depends on the number of attributes in the proved formula. In this paper, we propose methods to accelerate the authentication time by reducing the exponentiation costs for the calculations of accumulator and the witness which are used in the system. We implemented the accelerated system using a fast pairing library, and measured the authentication times, while changing the size of the proved relation.

    DOI: 10.1109/ICCE-TW.2015.7216952

    Web of Science

    Scopus

    researchmap

  • Faster ECC over \mathbb F_2^521-1 F 2 521 - 1 (feat. NEON).

    Hwajeong Seo, Zhe Liu 0001, Yasuyuki Nogami, Taehwan Park, Jongseok Choi, Lu Zhou, Howon Kim

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   9558   169 - 181   2015年

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:Springer  

    In this paper, we present high speed parallel multiplication and squaring algorithms for the Mersenne prime 2521 − 1. We exploit 1- level Karatsuba method in order to provide asymptotically faster integer multiplication and fast reduction algorithms. With these optimization techniques, ECDH on NIST’s (and SECG’s) curve P-521 requires 8.1/4M cycles on an ARM Cortex-A9/A15, respectively. As a comparison, on the same architecture, the latest OpenSSL 1.0.2d’s ECDH speed test for curve P-521 requires 23.8/18.7M cycles for ARM Cortex-A9/A15, respectively.

    DOI: 10.1007/978-3-319-30840-1_11

    Scopus

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/icisc/icisc2015.html#Seo0NPCZK15

  • Volunteer Computing for Solving an Elliptic Curve Discrete Logarithm Problem 査読

    Shoma Kajitani, Yasuyuki Nogami, Shunsuke Miyoshi, Thomas Austin

    PROCEEDINGS OF 2015 THIRD INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR)   122 - 126   2015年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    Elliptic curve discrete logarithm problem (ECDLP) is the base of the security of elliptic curve cryptography (ECC). The verification of the security of ECC has been studied by solving an ECDLP. However, we need a large amount of computational resources for the verification. Then, this paper proposes a method gathering computational resources with Web-based Volunteer Computing (Web-based VC). This paper solves 70-bit ECDLP, and evaluates the computational performance of 2 types of the execution clients: Native Client (NaCl) and Portable NaCl (PNaCl). In the case of NaCl, 70-bit ECDLP was solved in 3086 seconds. On the other hand, in the case of PNaCl, 70-bit ECDLP was solved in 6583 seconds.

    DOI: 10.1109/CANDAR.2015.46

    Web of Science

    Scopus

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/ic-nc/candar2015.html#KajitaniNMA15

  • Examining the Linear Complexity of Multi-value Sequence generated by Power Residue Symbol 査読

    Hiroto Ino, Yasuyuki Nogami, Nasima Begum, Satoshi Uehara, Robert Morelos-Zaragoza, Kazuyoshi Tsuchiya

    2015 2ND INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND SECURITY (ICISS)   58 - 60   2015年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    In our previous work, k-value pseudo random sequence generated by power residue symbol has been researched. The sequence is generated by applying a primitive polynomial over odd characteristics field, trace function, and power residue symbol. The sequence has some important features such as period, periodic autocorrelation, and linear complexity. In this paper, by applying an additional process to the previous procedure, an extended multi-value sequence is generated. Its features, such as the period, periodic autocorrelation, periodic crosscorrelation, and linear complexity are examined in this paper. According to the results, the new sequence also has some interesting features.

    DOI: 10.1109/ICISSEC.2015.7371002

    Web of Science

    Scopus

    researchmap

  • Long Period Sequences Generated by the Logistic Map over Finite Fields with Control Parameter Four.

    Kazuyoshi Tsuchiya, Yasuyuki Nogami

    CoRR   abs/1510.03650   2015年

     詳細を見る

    掲載種別:研究論文(学術雑誌)  

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/journals/corr/corr1510.html#TsuchiyaN15

  • Analysis on equivalent current source of AES-128 circuit for HD power model verification

    Kengo Iokibe, Kazuhiro Maeshima, Hiroto Kagotani, Yasuyuki Nogami, Yoshitaka Toyota, Tetsushi Watanabe

    IEEE International Symposium on Electromagnetic Compatibility   2014-December   302 - 305   2014年12月

     詳細を見る

    掲載種別:研究論文(国際会議プロシーディングス)  

    We analyzed equivalent current source of cryptographic circuits implemented on a field programmable gate array (FPGA). The equivalent current source represented internal switching current behaviors in the cryptographic circuits during an Advanced Encryption Standard (AES) operation. In this work, the internal current was analyzed for extracting leakage functions and correlation coefficients from scatter diagrams of the Hamming Distance (HD) of AES intermediate values and the current magnitudes. The obtained leakage functions were confirmed a well-known assumption on the HD power model that magnitude of switching current due to transition of register states is proportional to HD of the register. The internal current was also investigated in terms of correlation with the HD model. Correlation coefficients increased as transforming the external power trace in the internal current because two types of noise were reduced by the transform; constant noise and overlap effect of successive rounds. The noise reduction inferred that the use of the internal current source would provide more precise verification of countermeasures.

    Scopus

    researchmap

  • Investigation in Burst Pulse Injection Method for Fault Based Cryptanalysis

    Kengo Iokibe, Kazuhiro Maeshima, Hiroto Kagotani, Yasuyuki Nogami, Yoshitaka Toyota, Tetsushi Watanabe

    2014 IEEE INTERNATIONAL SYMPOSIUM ON ELECTROMAGNETIC COMPATIBILITY (EMC)   743 - 747   2014年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    This paper investigated about introduction of the burst pulse injection method standardized for immunity tests to a cryptanalysis using faulty ciphertexts. We investigated the potential of the burst injection method to induce faulty ciphertexts experimentally. Firstly, the standard burst pulse was injected through the power cable to a cryptographic module implementing the Advanced Encryption Standard (AES) on a field programmable gate array (FPGA). As a result, it was confirmed that the burst pulse injection might cause clock glitches on the module. Secondly, the clock glitch was varied in magnitude and timing by use of two pulse generators and transmitted to the AES circuit to clarify what types of clock glitch induce critical faulty ciphertexts suited for recovering the crypto-key successfully. Results confirmed that the clock glitch had potential to induce faulty ciphertexts when it exceeded the threshold and produced a clock interval shorter than the critical path delay in the target round. The two experimental results suggested that burst pulse injection to cryptographic modules through their power cables is a possible scenario of fault analysis attacks.

    Web of Science

    researchmap

  • 電源線から侵入した外乱に起因するクロックグリッチによるFPGA誤動作事例

    五百旗頭 健吾, 前島 一仁, 渡辺 哲史, 籠谷 裕人, 野上 保之, 林 優一, 豊田 啓孝, 曽根 秀昭

    エレクトロニクス実装学術講演大会講演論文集   28 ( 0 )   63 - 66   2014年

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人エレクトロニクス実装学会  

    バルク電流やバーストといった外乱注入により発生した暗号FPGAの誤動作に関して考察した。特に発生した誤動作の直接原因がクロックグリッチの場合について、まず、外乱によりFPGAのクロック配線にグリッチが重畳することを実験により検証した。次に、発生した誤動作をグリッチ付クロックをFPGAに直接与える構成において再現し、回路動作とグリッチの関係を検証した。以上の実験結果に基づき、外乱によりクロックグリッチが発生した場合の誤動作発生機構、および評価環境における誤動作発生確率を示した。

    DOI: 10.11486/ejisso.28.0_63

    CiNii Article

    researchmap

  • The Pollard's Rho Method with XTR Group on G(3) over Barreto-Naehrig Curve

    Yusuke Takai, Kenta Nekado, Yasuyuki Nogami

    2012 7TH INTERNATIONAL CONFERENCE ON COMPUTING AND CONVERGENCE TECHNOLOGY (ICCCT2012)   595 - 598   2012年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    Pollard's rho method is well-known as an efficient method for solving discrete logarithm problem (DLP). This paper adopts the DLP on the so-denoted G(3) over Barreto-Naehrig curve, together with XTR group. Then, this paper shows this idea with the proposed algorithm, and the experimental computation time of solving the DLP is reduced by about 15%.

    Web of Science

    researchmap

  • Efficient non symmetric pairing groups on ordinary pairing friendly curve of embedding degree 1 査読

    Tetsuya Izuta, Yasuyuki Nogami, Yoshitaka Morikawa

    IEEE International Conference on Communications   1 - 5   2011年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    Recently, ordinary pairing-friendly elliptic curves whose embedding degree is 1 have been often focused on, for example some composite order pairing-based cryptographies do. In the case of non-symmetric pairings whose embedding degree is larger than 2, recent efficient pairing techniques such as Rate and Xate pairings adopt a certain special rational point group with an efficient isomorphic mapping and then accelerate pairing-related operations such as a pairing calculation and a scalar multiplication. Based on cubic, quartic, and sextic twists, this paper shows how to activate these efficient techniques together with point compression on pairing-friendly curves of embedding degree 1. © 2011 IEEE.

    DOI: 10.1109/icc.2011.5962421

    Scopus

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/icc/icc2011.html#IzutaNM11

  • Efficient Non Symmetric Pairing Groups on Ordinary Pairing Friendly Curve of Embedding Degree 1 査読

    Tetsuya Izuta, Yasuyuki Nogami, Yoshitaka Morikawa

    2011 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC)   2011年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    Recently, ordinary pairing-friendly elliptic curves whose embedding degree is 1 have been often focused on, for example some composite order pairing-based cryptographies do. In the case of non-symmetric pairings whose embedding degree is larger than 2, recent efficient pairing techniques such as Rate and Xate pairings adopt a certain special rational point group with an efficient isomorphic mapping and then accelerate pairing-related operations such as a pairing calculation and a scalar multiplication. Based on cubic, quartic, and sextic twists, this paper shows how to activate these efficient techniques together with point compression on pairing-friendly curves of embedding degree 1.

    Web of Science

    researchmap

  • Anonymous IEEE802.1X Authentication System Using Group Signatures.

    Amang Sudarsono, Toru Nakanishi 0001, Yasuyuki Nogami, Nobuo Funabiki

    J. Inf. Process.   18   63 - 76   2010年

     詳細を見る

    掲載種別:研究論文(学術雑誌)  

    Recently, ubiquitous Internet-access services have been provided by Internet service providers (ISPs) by deploying wireless local area networks (LANs) in public spaces including stations, hotels, and coffee shops. The IEEE802.1X protocol is usually used for user authentications to allow only authorized users to access services. Then, although user personal information of access locations, services, and operations can be easily collected by ISPs and thus, their strict management has been demanded, it becomes very difficult when multiple ISPs provide roaming services by their corporations. In this paper, we present an anonymous IEEE802.1X authentication system using a group signature scheme to allow user authentication without revealing their identities. Without user identities, ISPs cannot collect personal information. As an efficient revocable group signature scheme, we adopt the verifier-local revocation (VLR) type with some modifications for use of the fast pairing computation. We show the implementation of our proposal and evaluation results where the practicality of our system is confirmed for up to 1,000 revoked users.

    DOI: 10.2197/ipsjjip.18.63

    Scopus

    researchmap

  • Accelerating Twisted Ate Pairing with Frobenius Map, Small Scalar Multiplication, and Multi-pairing 査読

    Yumi Sakemi, Shoichi Takeuchi, Yasuyuki Nogami, Yoshitaka Morikawa

    INFORMATION SECURITY AND CRYPTOLOGY - ISISC 2009   5984   47 - 64   2010年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:SPRINGER-VERLAG BERLIN  

    In the case of Barreto-Naehrig pairing-friendly curves of embedding degree 12 of order r, recent efficient Ate pairings such as R-ate, optimal, and Xate pairings achieve Miller loop lengths of (1/4) left perpendicularlog(2) r right perpendicular]. On the other hand, the twisted Ate pairing requires (3/4) left perpendicularlog(2) r right perpendicular] loop iterations, and thus is usually slower than the recent efficient Ate pairings. This paper proposes an improved twisted Ate pairing using Frobenius maps and a small scalar multiplication. The proposal splits the Miller&apos;s algorithm calculation into several independent parts, for which multi-pairing techniques apply efficiently. The maximum number of loop iterations in Miller&apos;s algorithm for the proposed twisted Ate pairing is equal to the (1/4) left perpendicularlog(2) r right perpendicular] attained by the most efficient Ate pairings.

    DOI: 10.1007/978-3-642-14423-3_4

    Web of Science

    Scopus

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/icisc/icisc2009.html#SakemiTNM09

  • Anonymous IEEE802.1X Authentication System Using Group Signatures

    Sudarsono Amang, Nakanishi Toru, Nogami Yasuyuki, Funabiki Nobuo

    Information and Media Technologies   5 ( 2 )   751 - 764   2010年

     詳細を見る

    記述言語:英語   出版者・発行元:Information and Media Technologies 編集運営会議  

    Recently, ubiquitous Internet-access services have been provided by Internet service providers (ISPs) by deploying wireless local area networks (LANs) in public spaces including stations, hotels, and coffee shops. The IEEE802.1X protocol is usually used for user authentications to allow only authorized users to access services. Then, although user personal information of access locations, services, and operations can be easily collected by ISPs and thus, their strict management has been demanded, it becomes very difficult when multiple ISPs provide roaming services by their corporations. In this paper, we present an anonymous IEEE802.1X authentication system using a group signature scheme to allow user authentication without revealing their identities. Without user identities, ISPs cannot collect personal information. As an efficient revocable group signature scheme, we adopt the verifier-local revocation (VLR) type with some modifications for use of the fast pairing computation. We show the implementation of our proposal and evaluation results where the practicality of our system is confirmed for up to 1, 000 revoked users.

    DOI: 10.11185/imt.5.751

    CiNii Article

    researchmap

  • Two Improvements of Twisted Ate Pairing with Barreto-Naehrig Curve by Dividing Miller&apos;s Algorithm 査読

    Yumi Sakemi, Hidehiro Kato, Shoichi Takeuchi, Yasuyuki Nogami, Yoshitaka Morikawa

    ICCIT: 2009 FOURTH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCES AND CONVERGENCE INFORMATION TECHNOLOGY, VOLS 1 AND 2   1180 - 1186   2009年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE  

    This paper shows two improvements of twisted te pairing with Barreto Naehrig curve so as to be efficiently carried out by dividing the calculation loops of Miller&apos;s algorithm based on divisor theorem. Then, this paper shows some experimental results from which it is shown that each improvements accelerate twisted- te pairing.

    DOI: 10.1109/ICCIT.2009.203

    Web of Science

    Scopus

    researchmap

  • Thread Computing for Miller's algorithm of Pairing 査読

    S. Takeuchi, Y. Sakemi, Y. Nogami, Y. Morikawa

    The 13th IEEE International Symposium on Consumer Electronics (ISCE2009)   182 - 186   2009年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    DOI: 10.1109/ISCE.2009.5156956

    Scopus

    researchmap

  • Fast implementation of extension fields with Typell ONB and cyclic vector multiplication algorithm 査読

    Yasuyuki Nogami, Shigeru Shinonaga, Yoshitaka Morikawa

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences   E88-A ( 5 )   1200 - 1208   2005年

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:Institute of Electronics, Information and Communication, Engineers, IEICE  

    This paper proposes an extension field named TypeII AOPF. This extension field adopts TypeII optimal normal basis, cyclic vector multiplication algorithm, and Itoh-Tsujii inversion algorithm. The calculation costs for a multiplication and inversion in this field is clearly given with the extension degree. For example, the arithmetic operations in TypeII AOPF Fp5 is about 20% faster than those in OFF Fp5, Then, since CVMA is suitable for parallel processing, we show that Typell AOPF is superior to AOPF as to parallel processing and then show that a multiplication in TypeII AOPF becomes about twice faster by parallelizing the CVMA computation in TypeII AOPF. Copyright © 2005 The Institute of Electronics, Information and Communication Engineers.

    DOI: 10.1093/ietfec/e88-a.5.1200

    Scopus

    researchmap

  • 多重解像度近似にPN拡散と1次元フーリエ変換を用いた画像電子透かし埋め込み法

    津下 浩一朗, 野上 保之, 森川 良孝

    映像情報メディア学会技術報告   25 ( 83 )   49 - 54   2001年12月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人映像情報メディア学会  

    本稿では画像圧縮と切り取りに対して耐性をもつ電子透かし法を提案する.本手法では, まず透かしを挿入する対象画像にハール基底の離散ウェーブレット変換を施し, 多重解像度近似(MRA)を抽出する.そのMRAに対しPN系列を用いて周波数拡散を施し, その後1列ごとに1次元フーリエ変換を施す.得られたフーリエ係数を埋め込む透かし情報のピットに応じて増減させることにより情報を埋め込む.本手法は, PN系列を用いて周波数拡散しているため, 埋め込みに用いたPN系列を知らない第3者には解読・改竄はできないという特徴を有している.検出時には原画像のPN拡散を施したMRA成分と透かし情報の埋め込まれた画像のPN拡散MRAの差分を求め, 1次元離散フーリエ係数の変化分を算出している.このため切り取られた画像の一部分のデータからでも透かし情報の検出ができるという特徴をもっている.

    DOI: 10.11485/itetr.25.83.0_49

    CiNii Article

    CiNii Books

    researchmap

▼全件表示

書籍等出版物

  • (Interface)数学100[すぐに使える数式&プログラム付き!

    野上 保之, 小寺 雄太, 池坂 和真, 三好 茜( 担当: 共著 ,  範囲: 第8章,暗号の数学)

    CQ出版  2024年4月 

     詳細を見る

  • (Interface)これからの暗号化技術8+α

    野上保之( 担当: 共著 ,  範囲: 第5章 通信技術84+α)

    CQ出版  2020年2月 

     詳細を見る

  • これからの暗号化技術8+α

    野上保之( 担当: 共著)

    CQ出版  2020年2月 

     詳細を見る

    記述言語:日本語 著書種別:一般書・啓蒙書

  • 情報セキュリティ対策の要点

    コロナ社  2004年 

     詳細を見る

MISC

  • 軽量暗号SIMONを用いたCAN通信におけるペイロード暗号化とMACの設計と実装

    壷井智也, 小寺雄太, 野上保之, 日下卓也

    電子情報通信学会技報   2022年7月

     詳細を見る

  • CVMAのパラメータをセッションキーに用いる認証通信プロトコルの検証

    三好茜音, 池坂和真, 小寺雄太, 日下卓也, 野上保之

    電子情報通信学会技術研究報告(Web)   122 ( 128(IT2022 15-28) )   2022年

     詳細を見る

  • 環境センサを用いた室内エアコンの精密制御システムの設計と実装

    段 夢芳, 服部大地, 日下卓也, 野上保之

    電子情報通信学会技報   2021年

     詳細を見る

  • これからの暗号化技術8+α—特集 組み込みコンピュータ技術512 ; 通信技術84+α

    野上 保之

    インターフェース = Interface   46 ( 2 )   83 - 85   2020年2月

     詳細を見る

    記述言語:日本語   出版者・発行元:CQ出版社  

    CiNii Article

    CiNii Books

    researchmap

  • Society5.0に向けたセキュアなIoT・AIの活用

    野上保之

    電子情報通信学会技術研究報告(Web)   120 ( 268(IT2020 24-62) )   2020年

     詳細を見る

  • BLS12曲線におけるペアリング計算のための最適曲線パラメータの提案とその実装評価

    服部大地, 高橋裕人, 多田羅友也, 南條由紀, 小寺雄太, 日下卓也, 野上保之

    電子情報通信学会技術研究報告(Web)   120 ( 224(ISEC2020 32-41) )   2020年

     詳細を見る

  • 逐次拡大体上のTwisted Montgomery曲線を用いた楕円ElGamal暗号のArduino実装と評価—Implementation and Evaluation of EC-ElGamal Encryption with a Twisted Montgomery Curve over Tower Field on Arduino—集積回路

    橋本 優太, 金成 忠樹, 日下 卓也, 野上 保之

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報   119 ( 261 )   1 - 5   2019年11月

     詳細を見る

    記述言語:日本語   出版者・発行元:電子情報通信学会  

    CiNii Article

    CiNii Books

    researchmap

    その他リンク: http://id.ndl.go.jp/bib/030130100

  • 埋め込み次数14のTate及びAteペアリングの実装—An Implementation of Tate and Ate Pairing of Embedding Degree 14

    宋 子豪, 松村 陸矢, 南條 由紀, 野上 保之, 日下 卓也

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報   119 ( 260 )   7 - 12   2019年11月

     詳細を見る

    記述言語:日本語   出版者・発行元:電子情報通信学会  

    CiNii Article

    CiNii Books

    researchmap

    その他リンク: http://id.ndl.go.jp/bib/030130117

  • Improvement of Miller's Algorithm of Pairing on Elliptic Curves with Embedding Degree 15 by Using Sparse Multiplication in Affine Coordinates

    Yuki Nanjo, Yuto Takahashi, Masaaki Shirase, Takuya Kusaka, Yasuyuki Nogami

    コンピュータセキュリティシンポジウム2019論文集   ( 2019 )   1543 - 1550   2019年10月

     詳細を見る

    記述言語:英語  

    CiNii Article

    researchmap

  • Raspberry Piを用いたカメラ動画像のAES暗号化に対するリアルタイム処理性能評価

    楊, 淵, 上竹, 嘉紀, 小林, 航也, 日下, 卓也, 野上, 保之

    コンピュータセキュリティシンポジウム2019論文集   2019   812 - 816   2019年10月

     詳細を見る

    記述言語:日本語  

    IoT時代の到来に伴い,インターネットに接続する端末数が爆発的に増加すると予想されている.計算資源に乏しいIoT機器においても,十分な安全性を担保することが求められており,動画像の送受信における安全性が問題となっている.そこで本研究では,Raspberry Piで撮影した動画像をリアルタイムで暗号化して送信する際の性能評価を行った.検証の結果,1秒で30フレームの画像を処理可能であり,通信遅延を1秒に抑えた通信が可能である.
    With the advent of the IoT era, it is expected that the number of devices connected to the Internet will explosively increase. Even with IoT devices that have limited computing resources, there is a need to ensure sufficient security, and video data transmission has become a serious issue. In this research we evaluated the performance of transmitting and encrypting the video data in real-time based on Raspberry Pi. And as a result, we can process 30 frames per second and have only a one-second delay.

    CiNii Article

    researchmap

  • 位数4の有理点を用いたCurve25519に対するサイドチャネル攻撃に関する考察

    谷田 翔吾, 上竹 嘉紀, 小椋 央都, 日下 卓也, 籠谷 裕人, 野上 保之

    DAシンポジウム2019論文集   2019 ( 2019 )   69 - 74   2019年8月

     詳細を見る

    記述言語:日本語  

    IoT時代の到来に伴い,インターネットに接続する端末数が爆発的に増加することが予想されている.IoT機器のような限られた計算資源下においても,暗号技術を用いた高信頼な情報通信を実現することが要求される.楕円曲線暗号は安全かつ効率的な公開鍵暗号であり,Curve25519は利便性の高い楕円曲線として注目を集める.一方で,サイドチャネル攻撃への耐性評価も重要となる.本稿では,FPGAに実装したCurve25519に対し,位数4の有理点を利用した単純電力解析による攻撃を行った.その結果,位数4の有理点を選択暗号文として用いることで,秘密鍵の特定が可能であることがわかった.
    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 secure and efficient public key cryptography. One of the most recent and secure curves is Curve25519 and one of its failures is an attack on low-order elements during a Diffie-Hellman key exchange. This document shows that an attack using order 4 rational points is possible on an FPGA with simple power analysis, points out every IoT device using Curve255119 as a cryptographic method has a potential target to side-channel attacks.

    CiNii Article

    researchmap

  • A Performance Analysis of Supersingular Isogeny Diffie-Hellman with Several Classes of the Quadratic Extension Fields (技術と社会・倫理)

    NANJO Yuki, SHIRASE Masaaki, KUSAKA Takuya, NOGAMI Yasuyuki

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報   119 ( 141 )   207 - 214   2019年7月

     詳細を見る

    記述言語:英語   出版者・発行元:電子情報通信学会  

    CiNii Article

    CiNii Books

    researchmap

  • A Performance Analysis of Supersingular Isogeny Diffie-Hellman with Several Classes of the Quadratic Extension Fields (バイオメトリクス)

    NANJO Yuki, SHIRASE Masaaki, KUSAKA Takuya, NOGAMI Yasuyuki

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報   119 ( 142 )   207 - 214   2019年7月

     詳細を見る

    記述言語:英語   出版者・発行元:電子情報通信学会  

    CiNii Article

    researchmap

  • A Performance Analysis of Supersingular Isogeny Diffie-Hellman with Several Classes of the Quadratic Extension Fields (ハードウェアセキュリティ)

    NANJO Yuki, SHIRASE Masaaki, KUSAKA Takuya, NOGAMI Yasuyuki

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報   119 ( 143 )   207 - 214   2019年7月

     詳細を見る

    記述言語:英語   出版者・発行元:電子情報通信学会  

    CiNii Article

    researchmap

  • A Performance Analysis of Supersingular Isogeny Diffie-Hellman with Several Classes of the Quadratic Extension Fields (情報セキュリティ)

    NANJO Yuki, SHIRASE Masaaki, KUSAKA Takuya, NOGAMI Yasuyuki

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報   119 ( 140 )   207 - 214   2019年7月

     詳細を見る

    記述言語:英語   出版者・発行元:電子情報通信学会  

    CiNii Article

    CiNii Books

    researchmap

  • IoT・AI時代における情報セキュリティ研究と人材育成教育

    野上 保之

    電気学会誌   139 ( 5 )   313 - 313   2019年5月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人 電気学会  

    IoT・AI時代のセキュリティ

    現代ICT社会は,インターネットを仲介して様々な情報がクラウドサーバなどに蓄積され,それをAIが解析して自動的に処理を行うという時代に入ってきている。例えば自

    DOI: 10.1541/ieejjournal.139.313

    CiNii Article

    researchmap

  • 2の冪乗位数をもつEdwards曲線の性質に関する考察—A Consideration of the Properties of Edwards Curve Whose Order is a Power of 2—情報理論

    三浦 裕正, 小林 航也, 日下 卓也, 野上 保之

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報   118 ( 477 )   27 - 32   2019年3月

     詳細を見る

    記述言語:日本語   出版者・発行元:電子情報通信学会  

    CiNii Article

    CiNii Books

    researchmap

    その他リンク: http://id.ndl.go.jp/bib/029633293

  • BLS曲線上での高速化手法を用いたペアリング暗号ライブラリELiPSの実装と評価—An Implementation and Evaluation of Pairing Library ELiPS for BLS Curve with Several Technique

    高橋 裕人, 金成 忠樹, 南條 由紀, カンダカル エムディ アルアミン, 日下 卓也, 野上 保之

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報   118 ( 479 )   21 - 26   2019年3月

     詳細を見る

    記述言語:日本語   出版者・発行元:電子情報通信学会  

    CiNii Article

    CiNii Books

    researchmap

    その他リンク: http://id.ndl.go.jp/bib/029631007

  • CAN通信プロトコルに対するメッセージ認証機能の実装と計算遅延時間についての検討—A Consideration of Computational Delay Time by Using MAC Implemented on CAN

    小椋 央都, 一色 竜之介, 日下 卓也, 野上 保之, 亀川 哲志, 前山 祥一, 荒木 俊輔

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報   118 ( 479 )   181 - 186   2019年3月

     詳細を見る

    記述言語:日本語   出版者・発行元:電子情報通信学会  

    CiNii Article

    CiNii Books

    researchmap

    その他リンク: http://id.ndl.go.jp/bib/029633004

  • マイコン実装したAES暗号に対するニューラルネットワークを用いた最終ラウンド鍵の解析—Analyzing Final Round Key of AES Implemented on Microcomputer using Neural Network—情報セキュリティ

    小杉 聡志, 城市 翔, 生田 健, 日下 卓也, 野上 保之, 高橋 規一

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報   118 ( 478 )   71 - 76   2019年3月

     詳細を見る

    記述言語:日本語   出版者・発行元:電子情報通信学会  

    CiNii Article

    CiNii Books

    researchmap

    その他リンク: http://id.ndl.go.jp/bib/029633374

  • エコー拡散法とオクターブ類似性を用いた会議録用音声データの改ざん検知の実装に関する研究—A Study on the System of Detecting Falsification for Conference Records Using Echo Spread Method and Octave Similarity—情報理論

    大垣 翔矢, 荒木 俊輔, 宮崎 武, 上原 聡, 野上 保之

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報   118 ( 477 )   57 - 64   2019年3月

     詳細を見る

    記述言語:日本語   出版者・発行元:電子情報通信学会  

    CiNii Article

    CiNii Books

    researchmap

    その他リンク: http://id.ndl.go.jp/bib/029631051

  • マイコン実装したAES暗号に対するニューラルネットワークを用いた最終ラウンド鍵の解析

    小杉聡志, 城市翔, 生田健, 日下卓也, 野上保之, 高橋規一

    電子情報通信学会技術研究報告   118 ( 478(ISEC2018 81-134) )   2019年

     詳細を見る

  • IoT時代を担う次世代の暗号方式に対する安全性評価のための衝突型攻撃演習の開発

    野上保之, 日下卓也, 小林航也, 橋本優太

    コンピュータソフトウェア   36 ( 1 )   95 - 100   2019年

     詳細を見る

    記述言語:日本語   出版者・発行元:日本ソフトウェア科学会  

    あらゆるデバイスがインターネットを介して繋がるIoT時代において,我々はそれらデバイスの利用により大きな利便性を享受できる一方,第三者からの攻撃を意識している利用者は決して多くはない.利用者がそういった意識を持つことはもちろん有意義なことであるが,それらデバイスを提供する側の人間は,より一層専門的な知識と意識付けが必要である.とりわけ,情報系の学部生など,エンジニアや研究者として第一線での活躍を目指す人材においてその必要性が顕著であり,「成長分野を支える情報技術人材の育成拠点の形成プログラム」であるenPiTでは,学部生に最先端の情報技術を学ぶ機会を提供し,社会の具体的な課題に対する解決力を身に付けた人材の育成を目指している.本稿では岡山大学で行われたenPiT-Security先進PBL演習Gの取り組みを紹介し,受講生の感想を踏まえて演習の有用性や改善の余地について述べる.

    DOI: 10.11309/jssst.36.95

    Scopus

    CiNii Article

    J-GLOBAL

    researchmap

  • Investigation of CAN transceiver and controller response to electromagnetic disturbance by using current injection probe (電磁環境 マグネティックス合同研究会 EMC一般(EMC Joint Workshop, 2018, Daejon))

    一色 竜之介, 五百旗頭 健吾, 日下 卓也, 亀川 哲志, 野上 保之

    電気学会研究会資料. EMC = The papers of technical meeting on electromagnetic compatibility, IEE Japan   2018 ( 48 )   23 - 28   2018年11月

     詳細を見る

    記述言語:英語   出版者・発行元:電気学会  

    CiNii Article

    researchmap

  • Investigation of CAN transceiver and controller response to electromagnetic disturbance by using current injection probe (電磁環境 マグネティックス合同研究会 EMC一般(EMC Joint Workshop, 2018, Daejon))

    一色 竜之介, 五百旗頭 健吾, 日下 卓也, 亀川 哲志, 野上 保之

    電気学会研究会資料. MAG = The papers of technical meeting on magnetics, IEE Japan   2018 ( 120 )   23 - 28   2018年11月

     詳細を見る

    記述言語:英語   出版者・発行元:電気学会  

    CiNii Article

    CiNii Books

    researchmap

  • 計算効率の良い逐次拡大体の構成条件の下でのBLS曲線の係数決定法—Determining BLS Curves for Pairing over Efficient Tower of Extension Field—情報セキュリティ

    南條 由紀, カンダカル エムディ アルアミン, 白勢 政明, 日下 卓也, 野上 保之

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報   118 ( 30 )   9 - 16   2018年5月

     詳細を見る

    記述言語:日本語   出版者・発行元:電子情報通信学会  

    CiNii Article

    CiNii Books

    researchmap

  • Uniform Binary Sequence Generated over Odd Characteristic Field

    Y. Kodera, T. Miyazaki, T. Kusaka, A. M. Arshad, Y. Nogami, and S. Uehara

    International Journal of Information and Electronics Engineering   8 ( 1 )   5 - 9   2018年3月

     詳細を見る

    記述言語:英語  

    DOI: 10.18178/ijiee.2018.8.1.685

    researchmap

  • Uniform Binary Sequence Generated over Odd Characteristic Field

    8 ( 1 )   5 - 9   2018年3月

  • Investigation of Reaction of Error Control of CAN Protocol in Case of Electromagnetic Disturbance Injection (環境電磁工学)

    一色 竜之介, 日下 卓也, 五百旗頭 健吾, 野上 保之

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報   117 ( 384 )   25 - 30   2018年1月

     詳細を見る

    記述言語:英語   出版者・発行元:電子情報通信学会  

    CiNii Article

    CiNii Books

    researchmap

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

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

    International Journal of Networking and Computing (IJNC)   8 ( 2 )   341 - 350   2018年

     詳細を見る

    記述言語:英語  

    researchmap

  • Highly Efficient GF(28) Inversion Circuit Based on Hybrid GF Arithmetic

    Rei Ueno, Naofumi Homma, Yasuyuki Nogami, Takafumi Aoki

    Journal of Cryptographic Engineering   2018年

     詳細を見る

    記述言語:英語  

    researchmap

  • An Efficient Hierarchical Multi-Authority Attribute Based Encryption Scheme for Profile Matching using a Fast Ate Pairing in Cloud Environment

    Balaji Chandrasekaran, Yasuyuki Nogami, Ramadoss Balakrishnan

    International Journal of Information and Electronics Engineering   14 ( 2 )   151 - 156   2018年

     詳細を見る

  • Secure Data Communication using File Hierarchy Attribute Based Encryption in Wireless Body Area Network

    B. Chandrasekaran, R. Balakrishnan, Y. Nogami

    Journal of Communications Software and Systems   14 ( 1 )   75 - 81   2018年

     詳細を見る

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

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

    IJNC   8 ( 2 )   341 - 350   2018年

     詳細を見る

  • Highly Efficient GF(28) Inversion Circuit Based on Hybrid GF Arithmetic

    Rei Ueno, Naofumi Homma, Yasuyuki Nogami, Takafumi Aoki

    Journal of Cryptographic Engineering   2018年

     詳細を見る

  • An Efficient Hierarchical Multi-Authority Attribute Based Encryption Scheme for Profile Matching using a Fast Ate Pairing in Cloud Environment

    Balaji Chandrasekaran, Yasuyuki Nogami, Ramadoss Balakrishnan

    International Journal of Information and Electronics Engineering   14 ( 2 )   151 - 156   2018年

     詳細を見る

    記述言語:英語   出版者・発行元:CROATIAN COMMUNICATIONS & INFORMATION SOC  

    In cloud environment, profile matching is a key technique in applications such as health care and social networks. Ciphertext-Policy Attribute-Based Encryption (CP-ABE) is a suitable technique for data sharing in such environments. In this paper, we propose an asymmetric pairing based Hierarchical Multi-Authority CP-ABE (HM-CP-ABE) construction for profile matching. We utilize the fast Ate pairing to make the proposed HM-CP-ABE scheme efficient. The performance analysis of the proposed scheme shows improved efficiency in terms of computational costs for initialization, key generation and encryption using ELiPS library when compared with existing works.

    DOI: 10.24138/jcomss.v14i2.461

    Web of Science

    researchmap

  • Secure Data Communication using File Hierarchy Attribute Based Encryption in Wireless Body Area Network

    B. Chandrasekaran, R. Balakrishnan, Y. Nogami

    Journal of Communications Software and Systems   14 ( 1 )   75 - 81   2018年

     詳細を見る

    記述言語:英語   出版者・発行元:CROATIAN COMMUNICATIONS & INFORMATION SOC  

    Wireless Body Area Networks (WBANs) play an important role in healthcare system by enabling medical experts to guide patients remotely. The unauthorized access of medical data from WBAN controller as well as the unreliable data communication may leads to risk for patients life. Currently, Chunqiang Hu et al., [1] proposed a data communication protocol by using Ciphertext-Policy Attribute-Based Encryption (CP-ABE) for a single file. The major limitation of Chunqiang Hu et al., [1] is that as the number of files increases, CP-ABE will suffer from parameters such as message size, energy consumption and computation cost. This paper proposes a more secure and efficient data communication scheme for WBANs by using an efficient File Hierarchy CP-ABE (FH-CP-ABE). The proposed scheme uses integrated access structure which is a combination of two or more access structures with hierarchical files encrypted. We evaluate the performance analysis of the proposed data communication protocol in terms of message size, energy consumption, computation cost and compared with Chunqiang Hu et al., [1].

    DOI: 10.24138/jcomss.v14i1.446

    Web of Science

    researchmap

  • CVMAを利用した部分体を用いるNTU系列の生成効率化

    松本年史, 小寺雄太, ALI Md. Arshad, 日下卓也, 野上保之

    情報理論とその応用シンポジウム予稿集(CD-ROM)   41st   2018年

     詳細を見る

  • KSS曲線を用いた効率的なペアリング暗号のための18次拡大体構成法の評価

    南條由紀, KHANDAKER Md. Al-Amin, 日下卓也, 野上保之

    情報処理学会シンポジウムシリーズ(CD-ROM)   2018 ( 2 )   2018年

     詳細を見る

  • 線形複雑度が可変なある擬似乱数系列の部分的乱数性に対する評価

    武田祐樹, 小寺雄太, 日下卓也, 野上保之

    情報理論とその応用シンポジウム予稿集(CD-ROM)   41st   2018年

     詳細を見る

  • Interleaved sequences of geometric sequences binarized with legendre symbol of two types

    Kazuyoshi Tsuchiya,Yasuyuki Nogami*,Satoshi Uehara

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences   E100A ( 12 )   2720 - 2727   2017年12月

  • ノイズ源振幅変調による電磁妨害波源デバイス特定法の精度改善 (環境電磁工学) -- (若手研究者発表会)

    石田 千晶, 吉野 慎平, 小川 千晶, 五百旗頭 健吾, 豊田 啓孝, 野上 保之

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報   117 ( 319 )   35 - 40   2017年11月

     詳細を見る

    記述言語:日本語   出版者・発行元:電子情報通信学会  

    CiNii Article

    CiNii Books

    researchmap

  • BLS曲線におけるPseudo 8-Sparse乗算を用いた効率的なOptimal-Ateペアリングの実装

    カンダカル, エムディアルアミン, 小野, 寛享, 南條, 由紀, 日下, 卓也, 野上, 保之

    コンピュータセキュリティシンポジウム2017論文集   2017 ( 2 )   2017年10月

     詳細を見る

    記述言語:英語  

    本稿では,BLS曲線におけるPseudo 8-Sparse乗算を用いた効率的なMillerのアルゴリズムの実装方法について記す.近年新たな離散対数問題の解法アルゴリズム(exTNFS)が発表されたため,本稿ではこれに対応する最新のパラメータを用いて,BLS曲線とKSS曲線について効率的なOptimal-Ateペアリングの実装を行った.その結果,一回のペアリングにかかる時間はBN曲線よりもBLS曲線のほうが高速に実装することができた.
    This paper shows an efficient Miller's algorithm implementation technique by applying pseudo 8-sparse multiplication over Barreto-Lynn-Scott (BLS12) curve of embedding degree 12. The recent development of exTNFS algorithm for solving discrete logarithm problem urges researchers to update parameter for pairing-based cryptography. Therefore, this papers applies the most recent parameters and also shows a comparative implementation of optimal-Ate pairing between BLS12 curve and Barreto-Naehrig (BN) curve. The result finds that pairing in BLS12 curve is faster than BN curve.

    CiNii Article

    researchmap

  • Long period sequences generated by the logistic map over finite fields with control parameter four

    Kazuyoshi Tsuchiya,Yasuyuki Nogami*

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences   E100A ( 9 )   1816 - 1824   2017年9月

     詳細を見る

  • Multi-valued sequences generated by power residue symbols over odd characteristic fields

    Begum Nasima,Yasuyuki Nogami*,Satoshi Uehara,Robert H. Moleros-Zaragoza

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences   E100A ( 4 )   922 - 929   2017年4月

  • A comparative study of twist property in KSS curves of embedding degree 16 and 18 from the implementation perspective

    Md Al Amin Khandaker,Taehwan Park,Yasuyuki Nogami*,Howon Kim

    Journal of Information and Communication Convergence Engineering   15 ( 2 )   97 - 103   2017年

     詳細を見る

  • An improvement of scalar multiplication by skew frobenius map with multi-scalar multiplication for KSS curve

    Md Al Amin Khandaker,Yasuyuki Nogami*

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences   100-A ( 9 )   1838 - 1845   2017年

     詳細を見る

    担当区分:筆頭著者   記述言語:英語  

    DOI: 10.1587/transfun.E100.A.1838

    Web of Science

    Scopus

    researchmap

  • 移動ロボットにおけるCANの脆弱性をついたDOS攻撃となりすましの実証

    藤井建人, 亀川哲志, 野上保之, 五福明夫

    日本機械学会ロボティクス・メカトロニクス講演会講演論文集(CD-ROM)   2017   2017年

     詳細を見る

  • 擬似乱数生成のための効率的なトレース計算法に関する考察

    小寺雄太, 小川千晶, 村岡英之, 荒木俊輔, 宮崎武, 上原聡, 日下卓也, 野上保之

    情報理論とその応用シンポジウム予稿集(CD-ROM)   40th   2017年

     詳細を見る

  • 奇標数体上の原始多項式を用いた多値擬似乱数系列における係数分布

    小川千晶, 小寺雄太, 宮崎武, 上原聡, 日下卓也, 野上保之

    情報理論とその応用シンポジウム予稿集(CD-ROM)   40th   2017年

     詳細を見る

  • ノイズ源振幅変調による電磁妨害波源デバイス特定法の精度改善

    石田千晶, 吉野慎平, 小川千晶, 五百旗頭健吾, 豊田啓孝, 野上保之

    電子情報通信学会技術研究報告   117 ( 319(EMCJ2017 64-75) )   2017年

     詳細を見る

  • Binary field multiplication on ARMv8

    Hwajeong Seo,Zhe Liu,Yasuyuki Nogami*,Jongseok Choi,Howon Kim

    Security and Communication Networks   9 ( 13 )   2051 - 2058   2016年9月

     詳細を見る

  • Hybrid Montgomery reduction

    Hwajeong Seo,Zhe Liu,Yasuyuki Nogami*,Jongseok Choi,Howon Kim

    Transactions on Embedded Computing Systems   15 ( 3 )   2016年7月

     詳細を見る

  • Hybrid Montgomery Reduction

    Hwajeong Seo, Zhe Liu, Yasuyuki Nogami, Jongseok Choi, Howon Kim

    ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS   15 ( 3 )   58 - 13   2016年7月

     詳細を見る

    記述言語:英語   出版者・発行元:ASSOC COMPUTING MACHINERY  

    In this article, we present a hybrid method to improve the performance of the Montgomery reduction by taking advantage of the Karatsuba technique. We divide the Montgomery reduction into two sub-parts, including one for the conventional Montgomery reduction and the other one for Karatsuba-aided multiplication. This approach reduces the multiplication complexity of n-limb Montgomery reduction from theta(n(2) + n) to asymptotic complexity theta(7n(2)/8 + n). Our practical implementation results over an 8-bit microcontroller also show performance enhancements by 11%.

    DOI: 10.1145/2890502

    Web of Science

    researchmap

  • Hybrid Montgomery Reduction

    Hwajeong Seo, Zhe Liu, Yasuyuki Nogami, Jongseok Choi, Howon Kim

    ACM Transactions on Embedded Computing Systems   15 ( 3 )   2016年7月

     詳細を見る

  • FPGA implementation of various elliptic curve pairings over odd characteristic field with non supersingular curves

    Yasuyuki Nogami*,Hiroto Kagotani*,Kengo Iokibe*,Hiroyuki Miyatake,Takashi Narita

    IEICE Transactions on Information and Systems   E99D ( 4 )   805 - 815   2016年4月

     詳細を見る

  • 楕円曲線暗号解読におけるDynamic DNSを用いた解読成功判定

    三好俊介, 山井成良, 野上保之

    情報処理学会研究報告(Web)   2016 ( IOT-32 )   2016年

     詳細を見る

  • 素体上のロジスティック写像による系列の平均周期・リンク長期待値

    宮崎武, 荒木俊輔, 上原聡, 野上保之

    日本応用数理学会年会講演予稿集(CD-ROM)   2016   2016年

     詳細を見る

  • 同じNTU系列を生成する異なる既約多項式についての考察

    平郡聖士, 野上保之, 上原聡, 土屋和由

    情報理論とその応用シンポジウム予稿集(CD-ROM)   39th   2016年

     詳細を見る

  • 楕円ペアリング暗号のための4次拡大体における演算の効率化に関する考察

    眞田晃宏, DUQUESNE Sylvain, 白勢政明, 野上保之

    電子情報通信学会技術研究報告   116 ( 163(IT2016 21-33) )   2016年

     詳細を見る

  • 楕円ペアリング暗号のための3次拡大体における演算の効率化に関する考察

    小寺雄太, DUQUESNE Sylvain, 白勢政明, 野上保之

    電子情報通信学会技術研究報告   116 ( 163(IT2016 21-33) )   2016年

     詳細を見る

  • Dynamic Job Scheduling Method based on Expected Probability of Completion of Voting in Volunteer Computing

    Y.Miyakoshi, S.Yasuda, M.Fukushi, K.Watanabe, Y.Nogami

    IEICE TRANSACTIONS on Information and Systems   E98D ( 12 )   2132 - 2140   2015年12月

     詳細を見る

  • Dynamic Job Scheduling Method Based on Expected Probability of Completion of Voting in Volunteer Computing

    Yuto Miyakoshi, Shinya Yasuda, Kan Watanabe, Masaru Fukushi, Yasuyuki Nogami

    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS   E98D ( 12 )   2132 - 2140   2015年12月

     詳細を見る

    記述言語:英語   出版者・発行元:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    This paper addresses the problem of job scheduling in volunteer computing (VC) systems where each computation job is replicated and allocated to multiple participants (workers) to remove incorrect results by a votingmechanism. In the job scheduling of VC, the number of workers to complete a job is an important factor for the system performance; however, it cannot be fixed because some of the workers may secede in real VC. This is the problem that existing methods have not considered in the job scheduling. We propose a dynamic job scheduling method which considers the expected probability of completion (EPC) for each job based on the probability of worker's secession. The key idea of the proposed method is to allocate jobs so that EPC is always greater than a specified value (SPC). By setting SPC as a reasonable value, the proposed method enables to complete jobs without excess allocation, which leads to the higher performance of VC systems. We assume in this paper that worker's secession probability follows Weibull-distribution which is known to reflect more practical situation. We derive parameters for the distribution using actual trace data and compare the performance of the proposed and the previous method under the Weibull-distribution model, as well as the previous constant probability model. Simulation results show that the performance of the proposed method is up to 5 times higher than that of the existing method especially when the time for completing jobs is restricted, while keeping the error rate lower than a required value.

    DOI: 10.1587/transinf.2015PAP0027

    Web of Science

    Scopus

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/journals/ieicet/ieicet98d.html#MiyakoshiYWFN15

  • A Consideration on Trace Sequence over Finite Field (情報理論)

    野上 保之, 井納 弘人, 土屋 和由

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報   115 ( 214 )   25 - 29   2015年9月

     詳細を見る

    記述言語:英語   出版者・発行元:電子情報通信学会  

    CiNii Article

    CiNii Books

    researchmap

  • Montgomery multiplication and squaring for Optimal Prime Fields

    Hwajeong Seo, Zhe Liu, Yasuyuki Nogami, Jongseok Choi, Howon Kim

    COMPUTERS & SECURITY   52   276 - 291   2015年7月

     詳細を見る

    記述言語:英語   出版者・発行元:ELSEVIER ADVANCED TECHNOLOGY  

    Optimal Prime Fields (OPFs) are considered to be one of the best choices for lightweight elliptic curve cryptography implementations on resource-constraint embedded processors. In this paper, we revisit the efficient modular arithmetic over the special prime fields, and present improved implementations of modular multiplication and squaring for OPFs, called Optimal Prime Field Coarsely Integrated Operand Caching (OPF-CIOC) and Coarsely Integrated Sliding Block Doubling (OPF-CISBD) methods. The OPF-CIOC and OPF-CISBD methods follow the general ideas of (consecutive) operand caching and sliding block doubling techniques, respectively. The methods have been carefully optimized and redesigned for Montgomery multiplication and squaring in an integrated fashion. We then evaluate the practical performance of proposed methods on representative 8-bit AVR processor. Experimental results show that the proposed OPF-CIOC and OPF-CISBD methods outperform the previous best known results in ACNS'14 by a factor of 8% and 32%. Furthermore, our methods are implemented in a regular way which helps to reduce the leakage of side-channel information. (C) 2015 Elsevier Ltd. All rights reserved.

    DOI: 10.1016/j.cose.2015.03.005

    Web of Science

    Scopus

    researchmap

  • Montgomery multiplication and squaring for Optimal Prime Fields

    Hwajeong Seo, Zhe Liub, Yasuyuki Nogami, Jongseok Choi, Howon Kim

    Computers & Security, online, Elsevier   52   276 - 291   2015年7月

     詳細を見る

  • NTRUにAll One Polynomialを適用した方式の検討 (情報セキュリティ)

    三隅 晃輝, 野上 保之

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報   114 ( 471 )   5 - 10   2015年3月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    現在主に利用されている公開鍵暗号の多くは,量子コンピューターの実現と,Shorのアルゴリズムによって破られることが示されている.この問題に対して,耐量子暗号と呼ばれる暗号の研究が行われている.NTRU暗号はHoffsteinらによって提案された耐量子暗号であり,円分多項式を用いるため,高速な演算が可能である.本研究では,これに対して円分多項式から自明な因数多項式を除いて与えられるAll One Polynomialと呼ばれる多項式を法とする多項式環All One Polynomial Ringを用いた方式を考える.この環上ではCVMAと呼ばれる乗算アルゴリズムが利用でき,NTRUと同様の理論で安全性に関する考察が行える.

    CiNii Article

    CiNii Books

    researchmap

  • 2次拡大体上の超特異楕円曲線を用いたペアリングの効率化 (情報セキュリティ)

    熊野 晶斗, 野上 保之, 白勢 政明

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報   114 ( 471 )   11 - 17   2015年3月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    吉田らは埋め込み次数2の超特異楕円曲線を用いたペアリング暗号におけるベクトル分解問題について詳細に考察を与えた.これをトラップドアとした暗号応用を考えると,ペアリングを高速化,効率化する必要があり,本稿では2次拡大体上の超特異楕円曲線を用いてTateペアリングの効率化を考える.Tateペアリングを構成するMillerのアルゴリズムと最終べきの両方に計算工夫を施した.超特異楕円曲線の性質を利用した計算の効率化,さらには曲線にツイスト写像を用いてMillerループ中の直線計算と接線計算の乗算を1回減らすことによって,どの程度ペアリングが効率化されたかを検討する.

    CiNii Article

    CiNii Books

    researchmap

  • Associative Rational Points for Improving Random Walkswith Collision-based Attack on Elliptic Curve Discrete Logarithm Problem

    Yasuyuki Nogami, Thomas H. Austin

    International Journal of Computer and Information Technology   2015年

     詳細を見る

  • Associative Rational Points for Improving Random Walkswith Collision-based Attack on Elliptic Curve Discrete Logarithm Problem

    Yasuyuki Nogami, Thomas H. Austin

    International Journal of Computer and Information Technology   2015年

     詳細を見る

    記述言語:英語  

    researchmap

  • 素体上のロジスティック写像による生成系列の自己相関と演算精度に近い周期を持つループについて

    宮崎武, 荒木俊輔, 上原聡, 野上保之

    電子情報通信学会技術研究報告   114 ( 470(IT2014 62-101) )   2015年

     詳細を見る

  • 素体上のロジスティック写像による生成系列の連続増加・減少回数について

    宮崎武, 荒木俊輔, 上原聡, 野上保之

    情報理論とその応用シンポジウム予稿集(CD-ROM)   38th   2015年

     詳細を見る

  • 奇標数体上の多値擬似乱数系列の値の分布について

    小池将太, 野上保之, 土屋和由, 上原聡

    情報理論とその応用シンポジウム予稿集(CD-ROM)   38th   2015年

     詳細を見る

  • 奇標数体上の非原始多項式を用いた擬似乱数系列の生成

    小川千晶, 野上保之, 土屋和由, 上原聡

    情報理論とその応用シンポジウム予稿集(CD-ROM)   38th   2015年

     詳細を見る

  • 逐次拡大体Fx(x=(24)2)における演算の効率化について

    實井識人, 野上保之, 日下卓也

    情報理論とその応用シンポジウム予稿集(CD-ROM)   38th   2015年

     詳細を見る

  • 制御変数が4である有限体上のロジスティック写像による最大周期系列に対する線形複雑度プロファイル

    土屋和由, 野上保之

    日本応用数理学会年会講演予稿集(CD-ROM)   2015   2015年

     詳細を見る

  • CUDAを用いた多倍長循環ベクトル乗算アルゴリズムの並列化実装 (リコンフィギャラブルシステム)

    原村 知志, 籠谷 裕人, 野上 保之, 杉山 裕二

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報   113 ( 418 )   109 - 112   2014年1月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    近年,GPUを数値演算に用いるGPGPUの環境が整い,GPGPUを用いた暗号実装の研究が盛んに行われている.本稿では,ペアリング暗号のための拡大体上で乗算が効率よく行える循環ベクトル乗算アルゴリズムについて,素体の標数を256bitとしてGPUにより実装を行った.その中で,乗算剰余算を効率よく行うために,モンゴメリ乗算を適用した.NVIDIA GeForce GTX680への実装では,CPU(Core i7 3970X)に対して10倍以上遅いという結果になった.

    CiNii Article

    CiNii Books

    researchmap

  • CUDAを用いた多倍長循環ベクトル乗算アルゴリズムの並列化実装 (コンピュータシステム)

    原村 知志, 籠谷 裕人, 野上 保之, 杉山 裕二

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報   113 ( 417 )   109 - 112   2014年1月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    近年,GPUを数値演算に用いるGPGPUの環境が整い,GPGPUを用いた暗号実装の研究が盛んに行われている.本稿では,ペアリング暗号のための拡大体上で乗算が効率よく行える循環ベクトル乗算アルゴリズムについて,素体の標数を256bitとしてGPUにより実装を行った.その中で,乗算剰余算を効率よく行うために,モンゴメリ乗算を適用した.NVIDIA GeForce GTX680への実装では,CPU(Core i7 3970X)に対して10倍以上遅いという結果になった.

    CiNii Article

    CiNii Books

    researchmap

  • CUDAを用いた多倍長循環ベクトル乗算アルゴリズムの並列化実装 (VLSI設計技術)

    原村 知志, 籠谷 裕人, 野上 保之, 杉山 裕二

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報   113 ( 416 )   109 - 112   2014年1月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    近年,GPUを数値演算に用いるGPGPUの環境が整い,GPGPUを用いた暗号実装の研究が盛んに行われている.本稿では,ペアリング暗号のための拡大体上で乗算が効率よく行える循環ベクトル乗算アルゴリズムについて,素体の標数を256bitとしてGPUにより実装を行った.その中で,乗算剰余算を効率よく行うために,モンゴメリ乗算を適用した.NVIDIA GeForce GTX680への実装では,CPU(Core i7 3970X)に対して10倍以上遅いという結果になった.

    CiNii Article

    CiNii Books

    researchmap

  • An Implementation of Elliptic Curve Scalar Multiplication with Improved Quadrupling of Rational Point (情報理論)

    格格日胡, 野上 保之, 白勢 政明

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報   113 ( 411 )   45 - 49   2014年1月

     詳細を見る

    記述言語:英語   出版者・発行元:一般社団法人電子情報通信学会  

    本稿は,改良した4倍算公式を用いた楕円スカラー倍算の実装およびその実験結果を示す。楕円曲線上の点の4倍算は二回の二倍算より効率がよいことが知られている。そのために,複数の基数を用いてスカラーを展開し,その上で,楕円スカラー倍算における点加算の回数をバイナリ法よりも少なく実現することができる。これに加え本稿の提案は,点の加算に座標変換を行い,加算公式の計算コストを有限体上の乗算1回分削減する方法を示す。そして,具体的に256ビット楕円曲線暗号としての実装評価を行う。

    CiNii Article

    CiNii Books

    researchmap

  • CUDAを用いた多倍長循環ベクトル乗算アルゴリズムの並列化実装

    原村 知志, 籠谷 裕人, 野上 保之, 杉山 裕二

    研究報告システムLSI設計技術(SLDM)   2014 ( 19 )   1 - 4   2014年1月

     詳細を見る

    記述言語:日本語  

    近年,GPU を数値演算に用いる GPGPU の環境が整い,GPGPU を用いた暗号実装の研究が盛んに行われている.本稿では,ペアリング暗号のための拡大体上で乗算が効率よく行える循環ベクトル乗算アルゴリズムについて,素体の標数を 256bit として GPU により実装を行った.その中で,乗算剰余算を効率よく行うために,モンゴメリ乗算を適用した.NVIDIA GeForce GTX680 への実装では,CPU (Core i7 3970X) に対して 10 倍以上遅いという結果になった.Recently, studies on implementation of cryptographical algorithms on GPUs are widely conducted as GPGPU development environment provides easy access to GPUs for non-graphics programming. In this paper, we implement cyclic vector multiplication algorithm, or an efficient multiplication algorithm on extension fields, that will accelerate pairing cryptography. Since we adopt 256-bit characteristic for the base fields, we also implement Montgomery multiplication for 256-bit operands on GPU. As the result of implementation on NVIDIA GeForce GTX680, it is over 10 times slower than implementation on Core i7 3970X.

    CiNii Article

    CiNii Books

    researchmap

  • Pseudo 8-Sparse Multiplication for Efficient Ate-based Pairing on Barreto-Naehrig Curve

    Yuki Mori, Shoichi Akagi, Yasuyuki Nogami and Masaaki Shirase,

    Pairing2013   8365   186 - 198   2014年

  • 有限体上のロジスティック写像による生成系列に対する長周期を保証するための条件

    土屋和由, 野上保之

    日本応用数理学会年会講演予稿集(CD-ROM)   2014   2014年

     詳細を見る

  • A Binary Sequence Generated by Legendre Symbol and Primitive Polynomial over Odd Characteristic (情報理論)

    野上 保之, 上原 聡, 多田 和紀

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報   113 ( 58 )   5 - 8   2013年5月

     詳細を見る

    記述言語:英語   出版者・発行元:一般社団法人電子情報通信学会  

    pを奇標数,素体F_p上のm次原始多項式をf(x),その零点をωとして,Tr(w^i),i=0,1,2,…は周期p^m-1の多値M系列を構成する.これに対して本稿では,Legendreシンボルを用いて二値化することを考える.そしてこの二値系列が,周期L=2(p^m-1)/(p-1)をもつことを示し,またその自己相関の周期的な特性について考察する.幾らかの小さな具体例と今後の研究方針についても述べる.

    CiNii Article

    CiNii Books

    researchmap

  • A Smaller Final Exponentiation for Tate and Ate Pairings w ith Barreto-Naehrig Curve

    Yuki Kono, Taichi Sumo, and Yasuyuki Nogami,

    TwC2013   518 - 522   2013年

  • A Binarization of Geometric Sequences with Legendre Symbol and Its Autocorrelation

    Yasuyuki Nogami,Kazuki Tada,Satoshi Uehara,

    IWSDA2013   28 - 31   2013年

  • Safe Primeを法とした素体上のロジスティック写像による生成系列に関する一考察

    宮崎武, 荒木俊輔, 上原聡, 野上保之

    日本応用数理学会年会講演予稿集(CD-ROM)   2013   2013年

     詳細を見る

  • ツイスト曲線上の有理点に対する有理点ノルムの性質とRho法への応用

    有井 智紀, 根角 健太, 野上 保之

    コンピュータセキュリティシンポジウム2012論文集   2012 ( 3 )   493 - 500   2012年10月

     詳細を見る

    記述言語:日本語  

    CiNii Article

    researchmap

  • Finding a Basis Conversion Matrix Using a Polynomial Basis Derived by a Small Multiplicative Cyclic Group

    Yasuyuki Nogami, Hidehiro Kato, Kenta Nekado, Satoshi Uehara, Yoshitaka Morikawa

    IEEE TRANSACTIONS ON INFORMATION THEORY   58 ( 7 )   4936 - 4947   2012年7月

     詳細を見る

    記述言語:英語   出版者・発行元:IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC  

    Several methods for finding a basis conversion matrix between two different bases in an extension field F-p(m) have been proposed. Among them, the one based on Gauss period normal basis (GNB) is on average the most efficient. However, since it needs to construct a certain tower field F-(pm)n, some inefficient cases in which the towering degree n becomes large have been reported. This paper first determines that such inefficient cases are caused by the GNB condition. In order to overcome this inefficiency, we propose a method that does not use any GNB in the target extension field F-p(m), but instead uses a certain polynomial basis in F-p(m) derived by a certain small cyclic group in F-(pm)n. This causes relaxation of the condition for the towering degree n. In addition, our experimental results show that the proposed method substantially accelerates the computation time for finding a basis conversion matrix.

    DOI: 10.1109/TIT.2012.2191477

    Web of Science

    Scopus

    researchmap

  • Finding a Basis Conversion Matrix Using a Polynomial Basis Derived by a Small Multiplicative Cyclic Group

    IEEE TRANSACTIONS ON INFORMATION THEORY   58 ( 7 )   4936 - 4947   2012年7月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語  

    DOI: 10.1109/TIT.2012.2191477

    Web of Science

    researchmap

  • 奇標数素体上の2^i次原始多項式を構成するための一手法

    野上 保之, 高井 悠輔, 小林 茂樹, 杉村 立夫, 上原 聡

    電子情報通信学会技術研究報告. ISEC, 情報セキュリティ   112 ( 39 )   19 - 24   2012年5月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    本稿では、奇標数pの素体F_p上の2^i次原始多項式を構成するための一手法を示す。具体的には、j<iとして適当なF^*_<p^<2^j>>の元αを用いて、自己α相反変換と呼ぶ変数変換x&map;x+αx^<-1>により、2^i次の既約多項式を生成し、これに対してその原始性を判定する。これが原始多項式でない場合には、これを効率よく原始化するための一つのアプローチを示し、いくつかの具体例を示す。

    CiNii Article

    CiNii Books

    researchmap

  • F_{(2^4)^2}上の複雑混合基底による基底変換を用いたAESのSubBytes変換

    根角 健太, 野上 保之, 森岡 恵理

    コンピュータセキュリティシンポジウム2011 論文集   2011 ( 3 )   349 - 354   2011年10月

     詳細を見る

    記述言語:日本語  

    CiNii Article

    researchmap

  • 冗長表現基底によるF_{(2^4)^2}上の逆元計算を用いたAESのSubBytes変換

    根角 健太, 野上 保之, 森岡 恵理

    コンピュータセキュリティシンポジウム2011 論文集   2011 ( 3 )   343 - 348   2011年10月

     詳細を見る

    記述言語:日本語  

    CiNii Article

    researchmap

  • Freeman曲線を用いたXateおよびR–ateペアリングのための定義体における乗算アルゴリズム

    根角 健太, 湯浅 達也, 野上 保之, 森川 良孝

    コンピュータセキュリティシンポジウム2009 (CSS2009) 論文集   2009   1 - 6   2011年10月

     詳細を見る

    記述言語:日本語  

    CiNii Article

    researchmap

  • 循環ベクトル乗算アルゴリズムの省メモリ実装

    高橋 龍介, 根角 健太, 高井 悠輔, 野上 保之, 熊谷 裕人, 成田 隆

    電子情報通信学会技術研究報告. ICSS, 情報通信システムセキュリティ : IEICE technical report   111 ( 125 )   145 - 150   2011年7月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    著者らは標数と拡大次数に対して柔軟に対応できるような拡大体上乗算アルゴリズムとして,循環ベクトル乗算アルゴリズム(CVMA)を提案している.CVMAをハードウェア実装するために,SITA2010にて根角らは2重ループを1重ループ構造に改良したが,その実装には多くのメモリを使用するという問題点が生じている.そこで本稿では,その改良されたCVMAをより省メモリで実装する方法を提案する.

    CiNii Article

    CiNii Books

    researchmap

  • 循環ベクトル乗算アルゴリズムの省メモリ実装

    高橋 龍介, 根角 健太, 高井 悠輔, 野上 保之, 熊谷 裕人, 成田 隆

    電子情報通信学会技術研究報告. SITE, 技術と社会・倫理 : IEICE technical report   111 ( 124 )   145 - 150   2011年7月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    著者らは標数と拡大次数に対して柔軟に対応できるような拡大体上乗算アルゴリズムとして,循環ベクトル乗算アルゴリズム(CVMA)を提案している.CVMAをハードウェア実装するために,SITA2010にて根角らは2重ループを1重ループ構造に改良したが,その実装には多くのメモリを使用するという問題点が生じている.そこで本稿では,その改良されたCVMAをより省メモリで実装する方法を提案する.

    CiNii Article

    CiNii Books

    researchmap

  • 循環ベクトル乗算アルゴリズムの省メモリ実装

    高橋 龍介, 根角 健太, 高井 悠輔, 野上 保之, 熊谷 裕人, 成田 隆

    電子情報通信学会技術研究報告. EMM, マルチメディア情報ハイディング・エンリッチメント = IEICE technical report. EMM, Enriched multimedia   111 ( 126 )   145 - 150   2011年7月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    著者らは標数と拡大次数に対して柔軟に対応できるような拡大体上乗算アルゴリズムとして,循環ベクトル乗算アルゴリズム(CVMA)を提案している.CVMAをハードウェア実装するために,SITA2010にて根角らは2重ループを1重ループ構造に改良したが,その実装には多くのメモリを使用するという問題点が生じている.そこで本稿では,その改良されたCVMAをより省メモリで実装する方法を提案する.

    CiNii Article

    CiNii Books

    researchmap

  • 循環ベクトル乗算アルゴリズムの省メモリ実装

    高橋 龍介, 根角 健太, 高井 悠輔, 野上 保之, 熊谷 裕人, 成田 隆

    電子情報通信学会技術研究報告. ISEC, 情報セキュリティ   111 ( 123 )   145 - 150   2011年7月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    著者らは標数と拡大次数に対して柔軟に対応できるような拡大体上乗算アルゴリズムとして,循環ベクトル乗算アルゴリズム(CVMA)を提案している.CVMAをハードウェア実装するために,SITA2010にて根角らは2重ループを1重ループ構造に改良したが,その実装には多くのメモリを使用するという問題点が生じている.そこで本稿では,その改良されたCVMAをより省メモリで実装する方法を提案する.

    CiNii Article

    CiNii Books

    researchmap

  • 循環ベクトル乗算アルゴリズムの省メモリ実装

    高橋 龍介, 根角 健太, 高井 悠輔, 野上 保之, 籠谷 裕人, 成田 隆

    研究報告情報セキュリティ心理学とトラスト(SPT)   2011 ( 23 )   1 - 6   2011年7月

     詳細を見る

    記述言語:日本語  

    CiNii Article

    researchmap

  • 循環ベクトル乗算アルゴリズムの省メモリ実装

    高橋 龍介, 根角 健太, 高井 悠輔, 野上 保之, 籠谷 裕人, 成田 隆

    研究報告コンピュータセキュリティ(CSEC)   2011 ( 23 )   1 - 6   2011年7月

     詳細を見る

    記述言語:日本語  

    著者らは標数と拡大次数に対して柔軟に対応できるような拡大体上乗算アルゴリズムとして,循環ベクトル乗算アルゴリズム (CVMA) を提案している.CVMA をハードウェア実装するために,SITA2010 にて根角らは 2 重ループを 1 重ループ構造に改良したが,その実装には多くのメモリを使用するという問題点が生じている.そこで本稿では,その改良された CVMA をより省メモリで実装する方法を提案する.The authors have proposed a cyclic vector multiplication algorithm abbreviated as CVMA that is flexible to the parameters of extension field, that is extension degree and charasteristic. For the hardware implementation of CVMA, the authors have improved the double loop structure of CVMA to a single loop one, and it has been presented at SITA2010. However, it has a problem that it needs a lot of memory. Thus, this paper proposes a method to save the memory use of the single loop version of CVMA.

    CiNii Article

    CiNii Books

    researchmap

  • MRCPの分類とその素体上の乗算への循環ベクトル乗算アルゴリズムの適用

    高井 悠輔, 根角 健太, 野上 保之, 森川 良孝, 籠谷 裕人

    電子情報通信学会技術研究報告. IT, 情報理論   110 ( 137 )   19 - 24   2010年7月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    著者らは,拡大体上の汎用的な乗算アルゴリズムとして,循環ベクトル乗算アルゴリズム(Cyclic vector multiplication algorithm:CVMA)を提案してきた.最近,GrangerらがMinimal Redundancy Cyclotomic Primes(MRCPs)を考案し,これを法とする整数乗剰余算にCVMAが活用できることを示した.本稿では,MRCPsの条件を詳細化するとともに,それに基づいてCVMAを利用したMRCP乗算アルゴリズムについても詳細化する.

    CiNii Article

    CiNii Books

    researchmap

  • EMV署名に対するCNTW攻撃の計算量評価

    酒見 由美, 伊豆 哲也, 武仲 正彦, 野上 保之, 森川 良孝

    電子情報通信学会技術研究報告. SITE, 技術と社会・倫理 : IEICE technical report   110 ( 114 )   195 - 201   2010年6月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    EMV署名はクレジットカードなどで利用されている署名方式であり,ISO/IEC 9796-2署名に準拠した方式を利用している.他方で,Coron-Naccache-Tibouchi-WeinmannはCRYPTO 2009にISO/IEC 9796-2 Scheme 1の偽造攻撃法を提案した.彼等はEMV署名におけるメッセージ部に格納される情報のうち,攻撃者が変更可能な情報と固定される情報を仮定し,特定の条件下でのEMV署名に対する攻撃計算量を見積もることで,EMV署名に対する偽造可能性について評価した.その結果,現実的な計算時間で偽造攻撃が実行される危険性は少ないと結論付けた.しかし,メッセージ部分に格納されるどの情報が固定されるかは不明確であり,攻撃者にとって有利な状況で偽造攻撃を適用できる可能性も考えられる.そこで,本稿では全ての条件下でのEMV署名に対する偽造可能性について詳細に評価を行い,条件によっては現実的な計算時間で偽造攻撃を実行できる場合があることを示す.

    CiNii Article

    CiNii Books

    researchmap

  • EMV署名に対するCNTW攻撃の計算量評価

    酒見 由美, 伊豆 哲也, 武仲 正彦, 野上 保之, 森川 良孝

    電子情報通信学会技術研究報告. ISEC, 情報セキュリティ   110 ( 113 )   195 - 201   2010年6月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    EMV署名はクレジットカードなどで利用されている署名方式であり,ISO/IEC 9796-2署名に準拠した方式を利用している.他方で,Coron-Naccache-Tibouchi-WeinmannはCRYPTO 2009にISO/IEC 9796-2 Scheme 1の偽造攻撃法を提案した.彼等はEMV署名におけるメッセージ部に格納される情報のうち,攻撃者が変更可能な情報と固定される情報を仮定し,特定の条件下でのEMV署名に対する攻撃計算量を見積もることで,EMV署名に対する偽造可能性について評価した.その結果,現実的な計算時間で偽造攻撃が実行される危険性は少ないと結論付けた.しかし,メッセージ部分に格納されるどの情報が固定されるかは不明確であり,攻撃者にとって有利な状況で偽造攻撃を適用できる可能性も考えられる.そこで,本稿では全ての条件下でのEMV署名に対する偽造可能性について詳細に評価を行い,条件によっては現実的な計算時間で偽造攻撃を実行できる場合があることを示す.

    CiNii Article

    CiNii Books

    researchmap

  • ガウス周期正規基底の存在確率

    根角 健太, 野上 保之, 森川 良孝

    電子情報通信学会技術研究報告. WBS, ワイドバンドシステム : IEICE technical report   109 ( 446 )   403 - 407   2010年2月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    ペアリングベース暗号といった暗号応用技術では,標数と拡大次数に対して柔軟に対応できる拡大体の構成法が必要とされる場合がある.加藤らはこのような拡大体の構成法としてガウス周期正規基底に注目し,その基底で構成された拡大体における効率の良い乗算アルゴリズムとして,循環ベクトル乗算アルゴリズムを提案している.本稿では,このガウス周期正規基底の存在確率を理論的に考えることで,循環ベクトル乗算アルゴリズムの効率をより明確にし,再評価する.

    CiNii Article

    CiNii Books

    researchmap

  • Mixed Bases for Efficient Inversion in F(((22)2)2) and Conversion Matrices of Sub Bytes of AES

    Yasuyuki Nogami, Kenta Nekado, Tetsumi Toyota, Naoto Hongo, Yoshitaka Morikawa

    CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS - CHES 2010   6225   234 - 247   2010年

     詳細を見る

    記述言語:英語   出版者・発行元:SPRINGER-VERLAG BERLIN  

    A lot of improvements and optimizations for the hardware implementation of Sub Bytes of Rijndael, in detail inversion in F(28) have been reported. Instead of the Rijndael original F(28) it is known that its isomorphic tower field F(((22)2)2) has a more efficient inversion. For the towerings, several kinds of bases such as polynomial and normal bases can be used in mixture. Different from the meaning of this mixture of bases, this paper proposes another mixture that contributes to the reduction of the critical path delay of SubBytes. To the F((22)2)-inversion architecture, for example, the proposed mixture inputs and outputs elements represented with normal and polynomial bases, respectively.

    DOI: 10.1007/978-3-642-15031-9_16

    Web of Science

    researchmap

    その他リンク: https://dblp.uni-trier.de/db/conf/ches/ches2010.html#NogamiNTHM10

  • Anonymous IEEE802.1X Authentication System Using Group Signatures

    A. Sudarsono, T. Nakanishi, Y. Nogami, N. Funabiki

    IPSJ Journal   51 ( 3 )   691 - 704   2010年

     詳細を見る

  • Mixed Bases for Efficient Inversion in F_{((2^2)^2)^2} and Conversion Matrices of SubBytes of AES

    Yasuyuki Nogami, Kenta Nekado, Tetsumi Toyota, Naoto Hongo, and Yoshitaka Morikawa

    Springer LNCS   6225   234 - 247   2010年

     詳細を見る

    担当区分:筆頭著者   記述言語:英語  

    DOI: 10.1007/978-3-642-15031-9_16

    Web of Science

    Scopus

    researchmap

  • Anonymous IEEE802.1X Authentication System Using Group Signatures

    A. Sudarsono, T. Nakanishi, Y. Nogami, N. Funabiki

    IPSJ Journal   51 ( 3 )   691 - 704   2010年

     詳細を見る

    記述言語:英語   出版者・発行元:情報処理学会  

    CiNii Article

    CiNii Books

    researchmap

  • 埋め込み次数1の非超特異ペアリングフレンドリ曲線上でのGLV法の適用

    竹内 翔一, 出田 哲也, 酒見 由美, 西井 一志, 野上 保之, 森川 良孝

    電子情報通信学会技術研究報告. ISEC, 情報セキュリティ   109 ( 337 )   37 - 41   2009年12月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    楕円曲線上のペアリングを用いる暗号方式の中で,RSA暗号のような大きな素因数を含む合成数を位数とする非超特異ペアリングフレンドリ曲線を用いるものが提案されている.このような特殊な曲線の生成には多くの計算時間がかかる場合も少なくないため,その簡便な生成法についての研究がなされている.一方で,実際にそのようなペアリングフレンドリ曲線を用いてペアリング暗号を構成した場合には,ペアリング計算のみならず,楕円スカラー倍算や拡大体におけるべき乗算なども効率よく行える必要がある.本稿では,そのような合成数位数をもつ,ある埋め込み次数1の非超特異ペアリングフレンドリ曲線に対して,GLV法およびマルチスカラー倍算を適用することで,そのスカラー倍算を効率よく行う実装法を示し,合わせてその実装評価をする.

    CiNii Article

    CiNii Books

    researchmap

  • 暗号応用のための小さな巡回群を用いた基底変換行列の効率的な生成法

    加藤 英洋, 野上 保之, 上原 聡, 森川 良孝

    電子情報通信学会技術研究報告. ISEC, 情報セキュリティ   109 ( 337 )   43 - 50   2009年12月

     詳細を見る

    記述言語:英語   出版者・発行元:一般社団法人電子情報通信学会  

    現在,2つの異なる拡大体F_<p^m>における基底間の基底変換行列を生成する様々な手法が提案されている.それらの中でもガウス周期正規基底を用いた手法が平均計算量の観点から最も効率的である.しかし,基底変換行列を求める際に必要となる逐次拡大体F_<(p^m)^n>を準備する際に,場合によっては逐次拡大次数が大きくなってしまい,計算量が多くなってしまうことが報告されている.これはガウス周期正規基底の構成条件から起因している.この逐次拡大次数の増加を抑えるために,本稿ではガウス周期正規基底を用いるのではなく,多項式基底およびF_<p^m>上の小さな巡回群を用いた基底変換行列の生成法を提案する.これにより,逐次拡大次数の増加を抑えることが可能となった.計算機シミュレーションの結果,提案法は従来のガウス周期正規基底を用いた手法に比べ,基底変換行列を求める際に必要となる平均計算時間を大きく削減することが可能となった.

    CiNii Article

    CiNii Books

    researchmap

  • 埋め込み次数1の非超特異ペアリングフレンドリ曲線を用いた Tate ペアリングの実装

    出田 哲也, 酒見 由美, 西井 一志, 竹内 翔一, 野上 保之, 森川 良孝

    電子情報通信学会技術研究報告. ISEC, 情報セキュリティ   109 ( 207 )   59 - 64   2009年9月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    近年,グループ署名やID-based暗号といった楕円曲線上の双線形写像(ペアリング)に基づく暗号方式が注目されている.一方,二つの大きな素数の積で与えられる合成数を法として定義されたRSA暗号方式においては,これをベースとした様々なアプリケーションが提案されてきた.RSA暗号ベースの技術とペアリングを組み合わせ,かつ十分な安全性を確保するためには,ペアリングに用いる群の位数が500ビット程度の二つの大きな素数をもつ合成数で与えられるようなペアリングフレンドリ曲線の生成が必要である.効率の観点から,著者らはとくに埋め込み次数が1であり,かつ2つの大きな素因数を位数に含む,幾つかの非超特異ペアリングフレンドリ曲線に注目した.本稿ではそのような曲線の生成,そのような曲線を用いたTateペアリングを実装し,その実験の結果を報告する.

    CiNii Article

    CiNii Books

    researchmap

  • Integer Variable chi-Based Cross Twisted Ate Pairing and Its Optimization for Barreto-Naehrig Curve

    Yasuyuki Nogami, Yumi Sakemi, Hidehiro Kato, Masataka Akane, Yoshitaka Morikawa

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E92A ( 8 )   1859 - 1867   2009年8月

     詳細を見る

    記述言語:英語   出版者・発行元:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    It is said that the lower bound of the number of iterations of Miller's algorithm for pairing calculation is log(2) r/phi(k), where phi(.) is the Euler's function, r is the group order, and k is the embedding degree. Ate pairing reduced the number of the loops of Miller's algorithm of Tate pairing from left perpendicularlog(2) right perpendicular to left perpendicularlog(2)(t-1)right perpendicular, where t is the Frobenius trace. Recently, it is known to systematically prepare a pairing-friendly elliptic curve whose parameters are given by a polynomial of integer variable "chi." For such a curve, this paper gives integer variable chi-based Ate (Xate) pairing that achieves the lower bound. In the case of the well-known Barreto-Naehrig pairing-friendly curve. it reduces the number of loops to left perpendicularlog(2)chi right perpendicular. Then, this paper optimizes Xate pairing for Barreto-Naehrig curve and shows its efficiency based on some simulation results.

    DOI: 10.1587/transfun.E92.A.1859

    Web of Science

    Scopus

    researchmap

  • Integer Variable Chi-based Cross Twisted Ate Pairing and Its Optimization for Barreto-Naehrig Curve

    Y. Nogami, Y. Sakemi, H. Kato, M. Akane, Y. Morikawa

    IEICE Trans. Fundamentals   E92A ( 8 )   1859 - 1867   2009年8月

     詳細を見る

  • Finding a Basis Conversion Matrix via Prime Gauss Period Normal Basis

    Y. Nogami, R. Namba, and Y. Morikawa

    IEICE Trans.   E92A ( 6 )   1500 - 1507   2009年6月

  • 2つの大きな素因数を含む合成数位数をもつ非超特異ペアリングフレンドリ曲線の一生成法

    西井 一志, 酒見 由美, 野上 保之, 森川 良孝

    電子情報通信学会技術研究報告. ISEC, 情報セキュリティ   109 ( 42 )   51 - 54   2009年5月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    近年,グループ署名やID-based暗号といった楕円曲線上の双線形写像(ペアリング)に基づく暗号方式が注目されている.一方,2つの大きな素数の積で与えられる合成数を法として定義されたRSA方式においては,これをベースとした様々なアプリケーションが提案されてきた.RSAベースの技術をペアリングと組み合わせるために,これに必要となる合成数位数をもつペアリングフレンドリ曲線(非超特異)の生成を本稿では目的とする.ここでは位数が整数変数χを用いた2次の多項式r(χ)で与えられる場合を考え,適当な整数変数χを与えることにより,2つの大きな素因数を含むr(χ)を求める方法を考える.本稿では,とくに埋め込み次数が3であり,判別式が3で曲線がy^2=x^3+a a∈F_p の形で与えられる非超特異なペアリングフレンドリ曲線を対象とする.

    CiNii Article

    CiNii Books

    researchmap

  • 効率的に検証者ローカル失効確認ができるグループ署名方式の実装

    スダルソノ アマン, 中西 透, 酒見 由美, 野上 保之, 舩曵 信生

    電子情報通信学会技術研究報告. ISEC, 情報セキュリティ   109 ( 42 )   37 - 42   2009年5月

     詳細を見る

    記述言語:英語   出版者・発行元:一般社団法人電子情報通信学会  

    効率的に検証者ローカル失効確認ができるグループ署名方式が提案されている.この方式では,ペアリングの積の計算にマルチペアリング技術を利用することにより,効率的な失効確認を行なっている.しかしこの方式は,実装に基づいた評価がなされていないという問題がある.本稿では,本方式の実装とその実験結果を示す.

    CiNii Article

    CiNii Books

    researchmap

  • ガウス周期正規基底に基づく乗算アルゴリズムCVMAの改良

    柳 枝里佳, 根角 健太, 野上 保之, 森川 良孝

    電子情報通信学会技術研究報告. ISEC, 情報セキュリティ   109 ( 42 )   55 - 60   2009年5月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    楕円曲線暗号に代表されるように,公開鍵暗号の実装に拡大体での乗算を必要とすることがある.拡大体での乗算は複雑な処理と計算時間を必要とするため,その高速実装のためには乗算アルゴリズムが必要である.これまでに著者らは標数および拡大次数に対して制限のない乗算アルゴリズムとしてCyclic Vector MultiplicationAlgorithm(CVMA)を提案してきた.従来のCVMAでは拡大体の構成に必要なパラメータkの大きさに比例した計算コストが発生する.パラメータkの最小値は構成する拡大体の標数および拡大次数によって一意的に決まるため,kが大きな値をもつ拡大体での乗算を行う際にその計算時間の増加が問題視されていた.本稿では拡大体上乗算に必要な素体上演算に代えて処理時間の短いビットシフト演算を用いるよう改良を加えたことでCVMAのコスト削減を図った.

    CiNii Article

    CiNii Books

    researchmap

  • Fast Ate Pairing Computation of Embedding Degree 12 Using Subfield-Twisted Elliptic Curve

    Masataka Akane, Yasuyuki Nogami, Yoshitaka Morikawa

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E92A ( 2 )   508 - 516   2009年2月

     詳細を見る

    記述言語:英語   出版者・発行元:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    This paper presents implementation techniques of fast Ate pairing of embedding degree 12. In this case, we have no trouble in finding a prime order pairing friendly curve E such as the Barreto-Naehrig curve y(2) = x(3) + a, a is an element of F-p. For the curve, an isomorphic substitution from G(2) is an element of E(F-p(12)) into G(2)'in subfield-twisted elliptic curve E'(F-p(2)) speeds up scalar multiplications over G(2) and wipes out denominator calculations in Miller's algorithm. This paper mainly provides about 30% improvement of the Miller's algorithm calculation using proper subfield arithmetic operations. Moreover, we also provide the efficient parameter settings of the BN curves. When p is a 254-bit prime, the embedding degree is 12, and the processor is Pentium4 (3.6 GHz), it is shown that the proposed algorithm computes Ate pairing in 13.3 milli-seconds including final exponentiation.

    DOI: 10.1587/transfun.E92.A.508

    Web of Science

    Scopus

    researchmap

  • Fast Ate Pairing Computation of Embedding Degree 12 Using Subfield-Twisted Elliptic Curve

    M. Akane, Y. Nogami, and Y. Morikawa

    IEICE Trans. Fundamentals   E92A ( 2 )   508 - 516   2009年2月

  • A Multiplication Algorithm in Fpm Such That p > m with a Special Class of Gauss Period Normal Bases

    Hidehiro Kato, Yasuyuki Nogami, Tomoki Yoshida, Yoshitaka Morikawa

    IEICE Trans.   E92A ( 1 )   173 - 181   2009年1月

  • Scalar Multiplication Using Frobenius Expansion over Twisted Elliptic Curve for Ate Pairing Based Cryptography

    Y. Nogami, Y. Sakemi,T. Okimoto, K. Nekado, M. Akane, Y. Morikawa

    IEICE Trans. Fundamentals   E92A ( 1 )   182 - 189   2009年1月

     詳細を見る

  • Scalar Multiplication Using Frobenius Expansion over Twisted Elliptic Curve for Ate Pairing Based Cryptography

    Yasuyuki Nogami, Yumi Sakemi, Takumi Okimoto, Kenta Nekado, Masataka Akane, Yoshitaka Morikawa

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E92A ( 1 )   182 - 189   2009年1月

     詳細を見る

    記述言語:英語   出版者・発行元:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    For ID-based cryptography, not only pairing but also scalar multiplication must be efficiently computable. In this paper, we propose a scalar multiplication method on the circumstances that we work at Ate pairing with Barreto-Naehrig (BN) curve. Note that the parameters of BN curve are given by a certain integer, namely mother parameter. Adhering the authors' previous policy that we execute scalar multiplication on subfield-twisted curve (E) over tilde (F-p2) instead of doing on the original curve E(F-p12), we at first show sextic twisted subfield Frobenius mapping (ST-SFM) in E(Fp2). On BN curves, note (phi) over tilde is identified with the scalar multiplication by p. However a scalar is always smaller than the order r of BN curve for Ate pairing, so ST-SFM does not directly applicable to the above circumstances. We then exploit the expressions of the curve order r and the characteristic p by the mother parameter to derive some radices such that they are expressed as a polynomial of p. Thus, a scalar multiplication [s] can be written by the series of ST-SFMs (phi) over tilde. In combination with the binary method or multi-exponentiation technique, this paper shows that the proposed method runs about twice or more faster than plain binary method.

    DOI: 10.1587/transfun.E92.A.182

    Web of Science

    Scopus

    researchmap

  • Thread Computing for Miller's algorithm of Pairing

    Shoichi Takeuchi, Yumi Sakemi, Yasuyuki Nogami, Yoshitaka Morikawa

    ISCE: 2009 IEEE 13TH INTERNATIONAL SYMPOSIUM ON CONSUMER ELECTRONICS, VOLS 1 AND 2   587 - 591   2009年

     詳細を見る

    記述言語:英語   出版者・発行元:IEEE  

    This paper shows an improvement of Miller's algorithm so as to be efficient for thread programming by using divisor theorem. Then, this paper implements a thread program of the improved Miller's algorithm by which it is shown that the proposed technique is more efficient than ordinary Miller's algorithm.

    DOI: 10.1109/ISCE.2009.5156956

    Web of Science

    researchmap

  • Cost Evaluation of The Improvement of Twisted Ate Pairing That Uses Integer Variable Chi of Small Hamming Weight

    Y. Sakemi, H. Kato, Y. Nogami, Y. Morikawa

    Memoirs of the Faculty of Engineering, Okayama University   43 ( 15 )   113 - 116   2009年

     詳細を見る

    記述言語:英語   出版者・発行元:Faculty of Engineering, Okayama University  

    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.

    CiNii Article

    CiNii Books

    researchmap

  • A High-Speed Square Root Algorithm for Extension Fields --Especially for Fast Extension Fields--

    Hidehiro Kato, Yasuyuki Nogami, Yoshitaka Morikawa

    Memoirs of the Faculty of Engineering, Okayama University   43   99 - 107   2009年

     詳細を見る

    記述言語:英語   出版者・発行元:Faculty of Engineering, Okayama University  

    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.

    CiNii Article

    CiNii Books

    researchmap

  • Inversion with Normal Bases in Tower Field F_{((2^{2})^{2})^2} for S-Box of AES

    Y. Nogami, M. Hagio(Oki Network LSI, E. Yanagi, Y. Morikawa

    ITC-CSCC2009   1337 - 1338   2009年

     詳細を見る

  • Cross Twisted Xate Pairing with Barreto-Naehrig Curve for Multi-pairing Technique

    Y. Sakemi, Y. Nogami, H. Kato, and Y. Morikawa

    ISIT 2009   2386 - 2390   2009年

  • Determining Basis Conversion Matrix without Gauss Period Normal Basis

    Y.Nogami, E.Yanagi, M.Hagio, Oki Network LSI, Y.Morikawa

    ITC-CSCC2009   1331 - 1332   2009年

     詳細を見る

  • How to Generate a Secure Composite Order Ordinary Pairing-friendly Curve of Embedding Degree 3

    Y.Nogami, K.Nishii, Y.Sakemi, H.Kato, Y.Morikawa

    ITC-CSCC2009   1474 - 1447   2009年

     詳細を見る

  • Zero Correlation Distribution of ZCZ Sequences Obtained from a Perfect Sequence and a Unitary Matrix

    Satoshi Uehara(The University of Kitakyushu), Shuichi JONO(NEC Communication Systems), Yasuyuki Nogami

    IEICE Trans. fundamentals   E91A ( 12 )   3745 - 3748   2008年12月

     詳細を見る

  • Efficient Exponentiation in Extensions of Finite Fields without Fast Frobenius Mappings

    Yasuyuki Nogami, Hidehiro Kato, Kenta Nekado, and Yoshitaka Morikawa

    ETRI Journal   30 ( 6 )   818 - 825   2008年12月

     詳細を見る

  • A method for constructing a self-dual normal basis in odd characteristic extension fields

    Yasuyuki Nogami, Hiroaki Nasu, Yoshitaka Morikawa, Satoshi Uehara

    FINITE FIELDS AND THEIR APPLICATIONS   14 ( 4 )   867 - 876   2008年11月

     詳細を見る

    記述言語:英語   出版者・発行元:ACADEMIC PRESS INC ELSEVIER SCIENCE  

    This paper proposes a useful method for constructing a self-dual normal basis in an arbitrary extension field F-p(m) such that 4p does not divide m(p - 1) and m is odd. In detail, when the characteristic p and extension degree in satisfies the following conditions (1) and either (2a) or (2b); (1) 2km + 1 is a prime number, (2a) the order of p in F2km+ 1 is 2km, (2b) 2 dagger km and the order of p in F2km + 1 is km, we can consider a class of Gauss period normal bases. Using this Gauss period normal basis, this paper shows a method to construct a self-dual normal basis in the extension field F-p(m). (C) 2008 Elsevier Inc. All rights reserved.

    DOI: 10.1016/j.ffa.2008.04.001

    Web of Science

    Scopus

    researchmap

  • A Method for Constructing A Self-Dual Normal Basis in Odd Characteristic Extension Field

    H.Nasu, *Y.Nogami, R.Namba, and Y.Morikawa

    8th International Conference on Finite Fields and Applications   14 ( 4 )   867 - 876   2008年11月

     詳細を見る

  • ペアリング暗号に効果的な拡大体上べき乗算に関する一考察

    吉田 知輝, 加藤 英洋, 根角 健太, 野上 保之, 森川 良孝

    電子情報通信学会技術研究報告. ISEC, 情報セキュリティ   108 ( 162 )   101 - 107   2008年7月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    近年,グループ署名やID-based暗号といった楕円曲線上の双線形写像(ペアリング)に基づく暗号方式が注目されている.これらの暗号方式は暗号化・復号・署名などの処理の際に,ペアリング計算後の拡大上の乗法群G_Tにおける演算(べき乗算)を必要とする.暗号に用いられるべき乗算は指数部が大きく計算に時間を要するため,本稿ではBarreto-Naehrig (BN)曲線とよばれる,埋め込み次数κ=12をもつ非超特異なペアリングフレンドリ曲線を用いた場合に組織的に与えられる整数χで指数部を展開することでべき乗算を高速化する手法を提案する.加えて,本稿ではこれまでに提案されているBinary法やNAF法,Window法,Avanzi法といった拡大体上のべき乗算アルゴリズムと提案法を組み合わせた実装および検証を行う.とくにNAF法との組み合わせによってべき乗する際の指数部のハミング重みに大きく依存せず高速に計算できることを示す.

    CiNii Article

    CiNii Books

    researchmap

  • ペアリング暗号に効果的な拡大体上べき乗算に関する一考察

    吉田 知輝, 加藤 英洋, 根角 健太, 野上 保之, 森川 良孝

    情報処理学会研究報告コンピュータセキュリティ(CSEC)   2008 ( 71 )   235 - 241   2008年7月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人情報処理学会  

    近年,グループ署名 [1] や ID-based 暗号 [3] といった楕円曲線上の双線形写像(ペアリング) [2] に基づく暗号方式が注目されている.これらの暗号方式は暗号化・復号・署名などの処理の際に,ペアリング計算後の拡大上の乗法群 Gt における演算(べき乗算)を必要とする.暗号に用いられるべき乗算は指数部が大きく計算に時間を要するため,本稿では Barreto-Naehrig (BN) 曲線 [9] とよばれる,埋坊込み次数 k=12 をもつ非超特異なペアリングフレンドリ曲線を用いた場合に組織的に与えられる整数 x で指数部を展開することでべき乗算を高速化する手法を提案する.加えて,本稿ではこれまでに提案されている Bynary 法や NAF 法、 Window 法, Avanzi 法 [12] [15] といった拡大体上のべき乗算アルゴリズムと提案法を組み合わせた実装および検証を行う.とくに NAF 法との組み合わせによってべき乗する際の指数部のハミング重みに大きく依存せず高速に計算できることを示す.In recent years, pairing-baaed cryptographies [2] such as ID-base cryptography |3] and group signature [1] have been studied. These cryptographies require exponentiations in multiplicative group Gt- In this paper, the author proposes an efficient exponentiation method for the case of Barreto-Naehrig (BN) curve [9] . Additionally, the author shows implementation results of the proposed method with conventional techniques such as binary method, window method, NAF method and Avanzi method [12] [15]. Then, the author shows the proposed method carries out exponentiation fast.

    CiNii Article

    CiNii Books

    researchmap

    その他リンク: http://id.nii.ac.jp/1001/00044301/

  • A Necessary Condition for Gauss Period Normal Bases to Be the Same Normal Basis

    Yasuyuki NOGAMI , Ryo NAMBA, and Yoshitaka MORIKAWA

    IEICE Trans.   E91A ( 4 )   1229 - 1231   2008年4月

     詳細を見る

  • A Basis Translation Matrix between Two Isomorphic Extension Fields via Optimal Normal Basis

    R.Namba, *Y.Nogami, Y.Morikawa

    The 1st Joint Workshop on Information Security JWIS2006   30 ( 2 )   326 - 334   2008年4月

     詳細を見る

  • Basis Translation Matrix between Two Isomorphic Extension Fields via Optimal Normal Basis

    Yasuyuki Nogami, Ryo Namba, and Yoshitaka Morikawa

    ETRI Journal   30 ( 2 )   326 - 334   2008年

     詳細を見る

  • Extension Field for Ate Pairing with Freeman Curve

    K.Nekado, H.Kato, M.Akane, Y.Nogami, Y.Morikawa

    ITC-CSCC2008   653 - 656   2008年

     詳細を見る

  • Fast Exponentiation in Extension Field with Frobenius Mappings

    H. Kato, K. Nekado, Y. Nogami, Y.Morikawa

    Memoirs of the Faculty of Engineering, Okayama Universit   42 ( 4 )   36 - 43   2008年

     詳細を見る

    記述言語:英語   出版者・発行元:Faculty of Engineering, Okayama University  

    This paper proposes an exponentiation method with Frobenius mappings. Our method is closely related to so-called interleaving exponentiation. Different from the interleaving exponentiation methods, our method can carry out several exponentiations using same base at the same time. The efficiency to use Frobenius mappings for an exponentiation in extension field is well introduced by Avanzi and Mihailescu. This exponentiation method is based on so-called simultaneous exponentiation and uses many Frobenius mappings. Their method more decreased the number of multiplications; however, the number of Frobenius mappings inversely increased. Compared to their method , the number of multiplications needed for the proposed method becomes about 20% larger; however, that of Frobenius mappings becomes small enough.

    CiNii Article

    CiNii Books

    researchmap

  • A Method for Checking the Parity of (#Jc-1)/2 Genus 2 and 3 Hyperelliptic Curves

    Y.Nogami, Y.Morikawa

    Memoirs of the Faculty of Engineering, Okayama University   42 ( 14 )   110 - 114   2008年

     詳細を見る

    記述言語:英語   出版者・発行元:Faculty of Engineering, Okayama University  

    This paper shows a method for checking the parity of (#Jc − 1)/2 without calculating the order #Jc, where #Jc is the order of genus 2 or 3 hyperelliptic curve.

    CiNii Article

    CiNii Books

    researchmap

  • Systematic Generation of An Irreducible Polynomial of An Arbitrary Degree m over Fp Such That p > m

    Hiroaki Nasu, Yasuyuki Nogami, Shigeki Kobayashi, Yoshitaka Morikawa, Tatsuo Sugimura

    THE 2008 International Conference on Convergence and Hybrid Information Technology   2   478 - +   2008年

     詳細を見る

  • An Implementation of Anonymous IEEE802.1X Authentication System for Wireless Networks

    A. Sudarsono, T. Nakanishi, Y. Nogami, N. Funabiki

    Proc. the 10th Industrial Electronics Seminar 2008 (IES2008)   2008年

     詳細を見る

  • Skew Frobenius Map and Efficient Scalar Multiplication for Pairing.Based Cryptography

    Yumi Sakemi, Yasuyuki Nogami, Katsuyuki Okeya (Hitachi, Ltd.), Hidehiro Kato, and Yoshitaka Morikawa

    7th International Conference Cryptology and Network Security, CANS 2008   5339   226 - +   2008年

  • An Improvement of Twisted Ate Pairing with Barreto-Naehrig Curve by using Frobenius Mapping

    Y. Sakemi, H. Kato, Y. Nogami, Y. Morikawa

    International Conference on Convergence and hybrid InformationTechnology(ICCIT08)   2   406 - 410   2008年

     詳細を見る

  • Efficient Pairings on Twisted Elliptic Curve

    Y.Nogami, M.Akane (Mitsubishi), Y.Sakemi, and Y.Morikawa

    ICCIT2008   2   430 - +   2008年

     詳細を見る

  • An Improvement of Cyclic Vector Multiplication Algorithm

    Hidehiro Kato, Yasuyuki Nogami, Tomoki Yoshida, Kenta Nekado, Shoichi Takeuchi, Yoshitaka Morikawa

    The 2008 International Conference on Convergence and hybrid Information Technology   2   401 - 405   2008年

     詳細を見る

  • A Method for Constructing A Pseudo Self-Dual Normal Basis

    H.Nasu, Y.Nogami, S.Uehara(The University of Kitakyushu), R.Namba, and Y.Morikawa

    Cybernetics and Systems An International Journal, Taylor and Francis   39 ( 6 )   563 - 582   2008年

     詳細を見る

  • Generating Irreducible Self-reciprocal Polynomials by Using Even Polynomial over Fq

    Shigeki Kobayashi, Yasuyuki Nogami, Tatsuo Sugimura

    The 23rd International Technical Conference on Circuits/Systems, Computers and Communications   121 - 124   2008年

     詳細を見る

  • An Improvement of Twisted Ate Pairing Using Integer Variable with Small Hamming Weight

    Y. Sakemi, H. Kato, Y. Nogami, Y. Morikawa

    The 23rd International Technical Conference on Circuits/Systems, Computers and Communicatio   269 - 272   2008年

  • Fast Squaring in TypeI All One Polynomial Field

    Hidehiro Kato, Yasuyuki Nogami, Yoshitaka Morikawa

    The 23rd International Technical Conference on Circuits/Systems, Computers and Communications   273 - 276   2008年

     詳細を見る

  • Integer Variable Chi-based Ate Pairing

    Y.Nogami, M.Akane, Y.Sakemi, H.Kato, and Y.Morikawa

    Pairing 2008   5209   178 - +   2008年

  • Cyclic Vector Multiplication Algorithm Based on a Special Class of Gauss Period Normal Basis

    Hidehiro Kato, *Yasuyuki Nogami, Tomoki Yoshida, Yoshitaka

    ETRI Jurnal   29 ( 6 )   769 - 778   2007年12月

     詳細を見る

  • 署名者の負担を軽減した失効機能をもつペアリングを用いたグループ署名方式の実装

    平 雄太, 加藤 英洋, 中西 透, 野上 保之, 舩曳 信生, 森川 良孝

    電子情報通信学会技術研究報告. ISEC, 情報セキュリティ   107 ( 209 )   69 - 76   2007年8月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    署名者のID情報を秘匿する署名技術の一つにグループ署名方式がある.その中で,署名作成に失効情報が不要で署名長の短さに特徴のあるペアリングを用いたグループ署名方式が提案されている.しかし,ペアリングの実用的な実装法である,ツイスト曲線を用いたペアリングを使用した場合には匿名性を証明できないという問題があった.そこで本論文では,ツイスト曲線を用いたペアリングを使用した場合にも匿名性を証明できるように従来方式の拡張を行う.加えて,式変形や並列処理による効率的な実装を行い,マルチコアCPUのサーバにおいて500人程度の失効人数まで実用的な時間で認証できることを示す.

    CiNii Article

    CiNii Books

    researchmap

  • 奇数次拡大体における Self-Dual 正規基底の構成法

    酒見 由美, 那須 弘明, 難波 諒, 野上 保之, 森川 良孝

    電子情報通信学会技術研究報告. IT, 情報理論   107 ( 143 )   23 - 27   2007年7月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    Self-dual正規基底は標数が奇素数ならば,拡大次数が奇数の場合にのみ存在することが知られている.しかし,その組織的な構成法は明確にされていない.本稿ではGauss period normal basis (GNB)に属するある特別な正規基底を用いて,4p&nmid;m(p-1)を満たす任意の奇数次拡大体F_<p^m>におけるself-dual正規基底を組織的に構成する方法を示す.加えて,そのself-dual正規基底とGNBの間での基底変換が簡単に行えることを示す.

    CiNii Article

    CiNii Books

    researchmap

  • 奇標数の偶数次拡大体におけるトレース計算に適した正規基底に関する一考察

    根角 健太, 那須 弘明, 難波 諒, 野上 保之, 森川 良孝

    電子情報通信学会技術研究報告. IT, 情報理論   107 ( 143 )   19 - 22   2007年7月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    公開鍵暗号の定義体として拡大体が用いられる場合がある.拡大体での演算を実装する際は,それに適した基底を選ぶ必要がある.本稿では,トレース計算に適した正規基底について考える.まず,self-dual正規基底[2]-[4]が奇標数の奇数次拡大体上にのみ存在することを復習し, self-dual正規基底で構成することができない奇標数の偶数次拡大体におけるself-dual正規基底と同等な性質をもつ正規基底について考える.

    CiNii Article

    CiNii Books

    researchmap

  • 自己相反逆変換を用いたF2上の高次既約多項式の生成法

    小林茂樹, 野上保之, 杉村立夫, 難波諒

    電子情報通信学会論文誌A   J90-A ( 5 )   460 - 469   2007年

     詳細を見る

  • A Multiplication Algorithm in F_{p^m} for An Arbitrary Pair of The Characteristic p and Degree m Such That p>m,

    Hidehiro Kato, Yasuyuki Nogami, Yoshitaka Morikawa, Tomoki Yoshida

    ETRI journal   採録済み   2007年

     詳細を見る

  • An Algorithm for Generating Irreducible Cubic Trinomials over Prime Field

    Yasuyuki Nogami, Yoshitaka Morikawa

    Memoirs of the Faculty of Engineering, Okayama University   41 ( 1 )   11 - 19   2007年

     詳細を見る

    記述言語:英語   出版者・発行元:Faculty of Engineering, Okayama University  

    This paper proposes an algorithm for generating irreducible cubic trinomials in the form x(3) + ax + b, b ∈ F(p), where a is a certain fixed non-zero element in theprime field F(p). The proposed algorithm needs a certain irreducible cubic trinomial over F(p) to be previously given as a generator; however, the proposed algorithm can generate irreducible cubic polynomials one after another by changing a certain parameter in F(p). In this paper, we compare the calculation cost and the average computation time for generating an irreducible cubic polynomial, especially trinomial, among Hiramoto et al. irreducibility testing algorithm, Berlekamp-Massey minimal polynomial determining algorithm, and the proposed algorithm. Fromthe experimental results, it is shown that the proposed algorithm is the fastest among the three algorithms for generating irreducible cubic trinomials.

    CiNii Article

    CiNii Books

    researchmap

  • The Number of the Irreducible Cubic Polynomials in the Form of x^3+ax+b with a Certain Fixed Element a

    Yasuyuki Nogami, Yoshitaka Morikawa

    Memoirs of the Faculty of Engineering, Okayama University   41 ( 1 )   1 - 10   2007年

     詳細を見る

    記述言語:英語   出版者・発行元:Faculty of Engineering, Okayama University  

    In this paper, we first show the number of x's such that x(2) +u, u ∈ F(*)(p) , becomes a quadratic residue in F(p), and then this number is proven to be equal to (p+1)/2 if −u is a quadratic residue in Fp, which is a necessary fact for the following. With respect to the irreducible cubic polynomials over Fp in the form of x(3)+ax+b, we give a classification based on the trace of an element in F(p3) and based on whether or not the coefficient of x, i.e. the parameter a, is a quadratic residue in Fp. Accordingto this classification, we can know the minimal set of the irreducible cubic polynomials, from which all the irreducible cubic polynomials can be generated by using the following two variable transformations: x=x + i, x=j−1x, i, j ∈ Fp, j ≠ 0. Based on the classification and that necessary fact, we show the number of the irreducible cubic polynomials in the form of x(3)+ax+b, b ∈ F(p), where a is a certain fixed element in F(p).

    CiNii Article

    CiNii Books

    researchmap

  • A Method for Constructing An Efficient Basis for Trace Calculation

    H.Nasu, *Y.Nogami, R.Namba, Y.Morikawa

    International Conference on Convergence Information Technology 2007   229 - 234   2007年

     詳細を見る

  • A Multiplication Algorithm in Fpm for Arbitrary Pairs of Characteristic p and Degree m Such That p>m

    T.Yoshida, H.Katou, Y.Nogami, Y.Morikawa

    (The 2nd Joint workshop on information security)   469 - 483   2007年

  • A Method for Distinguishing the Two Candidate Elliptic Curves in the Complex Multiplication Method

    Yasuyuki Nogami, Mayumi Obara, and Yoshitaka Morikawa

    ETRI Journal, vol.28/no.6   28 ( 6 )   745 - 760   2006年12月

     詳細を見る

  • ペアリング計算の実装に適した拡大体構成法

    小原 真由美, 赤根 正剛, 沖本 卓求弥, 野上 保之, 森川 良孝

    情報理論とその応用シンポジウム予稿集 = The proceedings of the Symposium on Information Theory and Its Applications   29 ( 1 )   391 - 394   2006年11月

     詳細を見る

  • TypeII ONB に類似の正規基底を用いた有限体の表現と乗法演算

    小林 茂樹, 野上 保之, 杉村 立夫

    情報理論とその応用シンポジウム予稿集 = The proceedings of the Symposium on Information Theory and Its Applications   29 ( 1 )   169 - 172   2006年11月

     詳細を見る

  • 次数および標数の変化に柔軟に対応できる拡大体の構成法

    難波 諒, 加藤 英洋, 吉田 知輝, 野上 保之, 森川 良孝

    情報理論とその応用シンポジウム予稿集 = The proceedings of the Symposium on Information Theory and Its Applications   29 ( 1 )   395 - 398   2006年11月

     詳細を見る

  • OptimalNormalBasisを経由する同型な拡大体間の基底変換行列の構成法

    難波諒, 野上 保之, 森川 良孝

    情報処理学会研究報告コンピュータセキュリティ(CSEC)   2006 ( 81 )   1 - 6   2006年7月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人情報処理学会  

    楕円曲線暗号やXTR暗号の定義体として,高速実装に適した拡大体が提案されている.これら拡大体はある特定の既約多項式や基底を採用することで高速実装を図っている.このため,それらの同型な拡大体においては同一元のベクトル表現が異なる.本稿ではこのベクトル表現が異なる元の対応をとる手段として,TypelOptimalNormalBasis(ONB)を経由して基底を変換する行列を得る手法を提案する.IypelONBは正規基底をなす元の集合であり,それらの位数は等しく,加えてそれらの最小多項式は既約AllOnePolynomia1(AOP)であるという性質をもつため,乗法に関する位数という特徴のみを用いて同型な拡大体間の元と元の対応を与えることができる.この性質により,IypeIONBが基底変換に適していることを説明し,IypelONBを経由して基底変換行列を得る手法を具体例とともに紹介する.最後にシミュレーションを行い,生成時間についても検討する.Some extension fields efficient for fast implementation have been proposed. Such extension fields adopt unique modular polynomial and basis. Therefore, an element can have some different vector representations in the isomorphic extension fields. This paper proposes a method for generating a basis translation matrix between two isomorphic extension fields. First, this paper shows that the translation matrix can be obtained via Typel Optimal Normal Basis (ONB). Typel ONB plays key role since it has the following properties; Typel ONB is a set of conjugate elements and of course a normal basis, these conjugates have the same order, they are zeros of a certain irreducible all one polynomial. Then, some examples of translation matrix are shown. Prom the experimental result,it is shown that the proposed method is enough practical.

    CiNii Article

    CiNii Books

    researchmap

    その他リンク: http://id.nii.ac.jp/1001/00044565/

  • Type-IIAllOnePolynomialField上での平方根導出アルゴリズムの高速実装

    加藤 英洋, 王鳳, 野上 保之, 森川 良孝

    情報処理学会研究報告コンピュータセキュリティ(CSEC)   2006 ( 81 )   7 - 12   2006年7月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人情報処理学会  

    近年,WeilペアリングやTateペアリング等のペアリング技術を用いたグループ署名の研究が行われており,このペアリングには有限体上で定義される楕円曲線が用いられている.この楕円曲線上の有理点を求めるために定義体上の平方根導出が必要となるが,一般に平方根導出は他の計算に比べて時間がかかることが知られている.著者らは,Fpmにおける高速な平方根導出アルゴリズムを提案しており,高速な四則演算が行える拡大体AOPF(allonepolynomialfield)を提案している.上述の平方根導出アルゴリズムでは,計算にフロベニアス写像を用いている.また,AOPFはフロベニアス写像に計算を一切必要としないので上述の平方根導出アルゴリズムの実装に適している.本稿では,具体的にはFp6等の拡大次数において実装高速な平方根導出アルゴリズムを実装し,計算機シミュレーションを行った結果について報告する.The authors proposes a square root (SQRT) algorithm in Fpm (m = r0r1 .....rn_12d,r1 : odd prime,d > 0 : integer). We compute the inverse SQRT in Fp2* using MW-ST algorithm. Then the Frobenius mappings with an addition chain are adopted for this SQRT algorithm, in which a lot of computations in a given extension field Fpm are also reduce to those in a proper subfield by the norm computations. Those reductions of the field degree increases efficiency in the SQRT implementation. More specifically the Smart algorithm and proposed algorithm in Fp6, for example, were implemented on a Pentium4 (3.8FHz) computer using the C++ programming language and NTL Library. The computer simulations showed that, on average, the proposed algoithm accelerates the SQRT computation by 3 times in Fp6, compared to the Smart algorithm.

    CiNii Article

    CiNii Books

    researchmap

    その他リンク: http://id.nii.ac.jp/1001/00044566/

  • AllOnePolynomialFieldを用いたMNT曲線に対するPairing計算の実装

    赤根 正剛, 沖本 卓求弥, 野上 保之, 森川 良孝

    情報処理学会研究報告コンピュータセキュリティ(CSEC)   2006 ( 81 )   13 - 18   2006年7月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人情報処理学会  

    近年,TatepairingやWeilparingなどの楕円曲線に関する双線形写像を暗号に応用する研究が盛んに行われている.これらの応用ではMNT曲線と呼ばれる非超特異な楕円曲線を用いるものがある.MNT曲線の埋め込み次数としては3次があるが,拡大体の高速実装法として知られるOEF(OptimalExtensionField)では,MNT曲線に対する標数の条件から3次のOEFを構成することはできない.また,4次および6次の場合についても,MNT曲線のうち,OEFを構成できるものは限られる.そこで本稿では,MNT曲線を埋め込む拡大体にAOPF(AllOnePolynomialField)を用いてTatepairingを実装し,その計算時間を示す.さらに,AOPFを用いた場合にTatepairingを効率よく計算できることを紹介する.In recent years, many cryptographic applications with bilinear-pairing over elliptic curves have been proposed. The well-known MNT curves, that are non-supersingular elliptic curves, provide bilinear-pairings over extension fields of degree 3, 4, and 6. When the embedding degree is equal to 3, MNT curves cannot be defined over optimal extension field (OEF). Even when the embedding degree is equal to 4 or 6, MNT curves cannot be always defined over OEF. For some of such cases, it can be defined over all one polynomial field (AOPF). Since Frobeniusmapping can be fast carried out in the AOPFs, this paper gives considered some improvements for Tate pairing calculation. Then, some examples and simulation results are shown.

    CiNii Article

    CiNii Books

    researchmap

    その他リンク: http://id.nii.ac.jp/1001/00044567/

  • Type-II All One Polynomial Field 上での平方根導出アルゴリズムの高速実装

    加藤 英洋, 王 鳳, 野上 保之, 森川 良孝

    電子情報通信学会技術研究報告. SITE, 技術と社会・倫理   106 ( 174 )   7 - 12   2006年7月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    近年,WeilペアリングやTateペアリング等のペアリング技術を用いたグループ署名の研究が行われており,このペアリングには有限体上で定義される楕円曲線が用いられている.この楕円曲線上の有理点を求めるために定義体上の平方根導出が必要となるが,一般に平方根導出は他の計算に比べて時間がかかることが知られている.著者らは,F_<p^m>における高速な平方根導出アルゴリズムを提案しており,高速な四則演算が行える拡大体AOPF (all one polynomial field)を提案している.上述の平方根導出アルゴリズムでは,計算にフロペニアス写像を用いている.また,AOPFはフロペニアス写像に計算を一切必要としないので上述の平方根導出アルゴリズムの実装に適している.本稿では,具体的にはF_<p^6>等の拡大次数において実装高速な平方根導出アルゴリズムを実装し,計算機シミュレーションを行った結果について報告する.

    CiNii Article

    CiNii Books

    researchmap

  • A High-Speed Square Root Algorithm in Extension Fields

    Hidehiro Katou, Feng Wang, *Yasuyuki Nogami, Yoshitaka Morikawa

    The 9th International Conference on Information Security and Cryptology (ICISC2006), LNCS4296   4296   94 - +   2006年

  • A high-speed square root algorithm in extension fields

    Hidehiro Katou, Feng Wang, Yasuyuki Nogami, Yoshitaka Morikawa

    INFORMATION SECURITY AND CRYPTOLOGY - ICISC 2006, PROCEEDINGS   4296   94 - +   2006年

     詳細を見る

    記述言語:英語   出版者・発行元:SPRINGER-VERLAG BERLIN  

    A square root (SQRT) algorithm in GF(p(m)) (m = r(0)r(1)center dot center dot center dot r(n-1)2(d), r(i): odd prime, d &gt; 0: integer) is proposed in this paper. First, the Tonelli-Shanks algorithm is modified to compute the inverse SQRT in GF (p(2d)), where most of the computations are performed in the corresponding subfields GF(p(2d)) for 0 &lt;= i &lt;= d-1. Then the Frobenius mappings with an addition chain are adopted for the proposed SQRT algorithm, in which a lot of computations in a given extension field GF(p(m)) are also reduce to those in a proper subfield by the norm computations. Those reductions of the field degree increase efficiency in the SQRT implementation. More specifically the Tonelli-Shanks algorithm and the proposed algorithm in GF(p(22)), GF(P-44) and GF(P-88) were implemented on a Pentium4 (2.6 GHz) computer using the C++ programming language. The computer simulations showed that, on average, the proposed algorithm accelerates the SQRT computation by 25 times in GF (P-22), by 45 times in GF (P-44), and by 70 times in GF(p(88)), compared to the Tonelli-Shanks algorithm, which is supported by the evaluation of the number of computations.

    Web of Science

    researchmap

  • A Method for Checking the Parity of (#Jc-1)/2

    M.Akane, Y.Nogami, Y.Morikawa

    The 2006 International Symposium on Information Theory and its Applications   2006年

     詳細を見る

  • The Orders of Elliptic Curves y^2 = x^3 + b, b in Fp

    Y.Nogami, Y.Morikawa

    Memoirs of the Faculty of Engineering, Okayama University   40 ( 1 )   83 - 94   2006年

     詳細を見る

    記述言語:英語   出版者・発行元:Faculty of Engineering, Okayama University  

    This paper particularly deals with elliptic curves in the form of E(x, y) = y(2) − x(3) −b = 0, b ∈ F(* q) , where 3 divides q−1. In this paper, we refer to the well-known twist technique as x-twist and propose y-twist. By combining x-twist and y-twist, we can consider six elliptic curves and this paper proposes a method to obtain the orders of these six curves by counting only one order among the six curves.

    CiNii Article

    CiNii Books

    researchmap

  • Cyclic vector multilication algorithm makes an inversion in F_{p^3} fastest

    Yasuyuki Nogami, Hidehiro Katou, Yoshitaka Morik

    JWIS2006(Joint workshop on information security)   2006年

     詳細を見る

  • Cyclic Vector Multiplication is Efficient for Small Extension Degrees

    Hidehiro Katou, Feng Wang, Yasuyuki Nogami, Yoshitaka Morikawa

    Second International Congress on Mathematical Software ICMS2006   2006年

     詳細を見る

  • Cyclic Vector Multiplication Algorithm に関する一考察

    加藤 英洋, 野上 保之, 難波 諒, 森川 良孝

    情報理論とその応用シンポジウム予稿集 = The proceedings of the Symposium on Information Theory and Its Applications   28 ( 1 )   295 - 298   2005年11月

     詳細を見る

  • A Consideration on the Order of Genus 2 Hyperelliptic Curve

    NOGAMI Yasuyuki, MORIKAWA Yoshitaka

    情報理論とその応用シンポジウム予稿集 = The proceedings of the Symposium on Information Theory and Its Applications   28 ( 2 )   889 - 892   2005年11月

     詳細を見る

  • An Efficient Square Root Computation in Finite Fields GF(p^{2^d})

    Wang Feng, *Yasuyuki Nogami, and Yoshitaka Morikawa

    IEICE Trans. Fundamentals of Electronics, Communications and Computer Science   E88A ( 10 )   2792 - 2799   2005年10月

     詳細を見る

  • 自己相反変換によるtype2 ONBの表現

    小林 茂樹, 野上 保之, 杉村 立夫

    電子情報通信学会技術研究報告   105 ( 311 )   25 - 30   2005年9月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    近年考案されている公開鍵暗号方式には, 位数の大きな有限体を定義体とするものが多い.これに対して, ハード化し易いなどの理由から標数を2として高次拡大体を高速実装する研究報告が多く, それに必要となる高次既約多項式の生成法に関する研究報告も多く成されている.これらの研究は大きく二つに分類でき, 一つは既約All One Polynomialなど法多項式に関するもの, もう一つはOptimal Normal Basis (ONB)など基底に関するものである.ONBはさらにTypeIおよびTypeIIの2通りに分類される.本論文では従来から提案されている自己相反変換および自己相反逆変換と呼ぶm次から2m次および2m次からm次の多項式への多項式変換手法を用いて, All One PolynomialとTypeIIONBを零点にもつ既約多項式の関係について明確にする.m次既約多項式を自己相反変換した多項式が2m次All One Polynomialとなるならば, もとの多項式はTypeIIONBを零点にもつ既約多項式であることを示し, TypeII ONBが存在する場合には, All One Polynomialに自己相反逆変換を施すことにより, 求めることができることを示す.応用として, TypeIIONBを零点にもち, かつ素数次数の既約多項式を生成する手法を与える.

    CiNii Article

    CiNii Books

    researchmap

  • yツイストを用いた素数位数楕円曲線生成法の性能評価

    小原 真由美, 野上 保之, 森川 良孝

    電子情報通信学会技術研究報告. ISEC, 情報セキュリティ   105 ( 193 )   59 - 66   2005年7月

     詳細を見る

    記述言語:英語   出版者・発行元:一般社団法人電子情報通信学会  

    本稿では, 変数yに関するツイスト方法を議論し, その観点から, とくにy^2=x^3+aのような形の楕円曲線が素数位数をもつための幾つかの必要条件を示す.そして, 従来のツイスト手法を組み合わせることにより, 6個の楕円曲線を考え, 定義体の標数pがp>3, 3|(p-1)を満たすとき, その6曲線のうち2曲線のみが素数位数に成りうることを示し, その場合の定義体の拡大次数は2^i3^jでなければならないことを示す.その後, 1つの素数位数楕円曲線を生成するのにかかる計算時間について, 虚数乗法を用いた場合と比較し性能を評価する.

    CiNii Article

    CiNii Books

    researchmap

  • Fast Implementation of Extension Fields with TypeII ONB and Cyclic Vector Multiplication Algorithm

    *Yasuyuki Nogami, Shigeru Shinonaga, and Yoshitaka Morikawa

    IEICE Trans. Fundamentals.   E88A ( 5 )   1200 - 1208   2005年5月

     詳細を見る

  • XTRを用いた暗号とその高速実装 (符号と暗号の代数的数理)

    野上 保之

    数理解析研究所講究録   1420   183 - 192   2005年4月

     詳細を見る

    記述言語:日本語   出版者・発行元:京都大学  

    CiNii Article

    CiNii Books

    researchmap

    その他リンク: http://hdl.handle.net/2433/47175

  • An algorithm for systematically generating irreducible cubic trinomials over prime field

    Yasuyuki Nogami, Yoshitaka Morikawa

    Proceeding of The 2005 International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC2005)   2005年

     詳細を見る

  • Generating prime degree irreducible polynomials by using irreducible all-one polynomial over F-2

    K Makita, Y Nogami, T Sugimura

    ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE   88 ( 7 )   23 - 32   2005年

     詳細を見る

    記述言語:英語   出版者・発行元:SCRIPTA TECHNICA-JOHN WILEY & SONS  

    In most of the methods of public key cryptography devised in recent years, a finite field of a large order is used as the field of definition. In contrast, there are many studies in which a higher-degree extension field of characteristic 2 is fast implemented for easier hardware realization. There are also many reports of the generation of the required higher-degree irreducible polynomial, and of the construction of a basis suited to fast implementation, such as an optimal normal basis (ONB). For generating higher-degree irreducible polynomials, there is a method in which it 2m-th degree self-reciprocal irreducible polynomial is generated from an m-th degree irreducible polynomial by a simple polynomial transformation (called the self-reciprocal transformation). This paper considers this transformation and shows that When the set of zeros of the m-th degree irreducible polynomial forms a normal basis, the set of zeros of the generated 2m-th order self-reciprocal irreducible polynomial also forms a normal base. Then it is clearly shown that there is a one-to-one correspondence between the transformed irreducible polynomial and the generated self-reciprocal irreducible polynomial. Consequently, the inverse transformation of the self-reciprocal transformation (self-reciprocal inverse transformation) can be applied to a self-reciprocal irreducible polynomial. It is shown that an m-th degree irreducible polynomial can always be generated from a 2m-th degree self-reciprocal irreducible polynomial by the self-reciprocal inverse transformation. We can use this fact for generating 1/2-degree irreducible polynomials. As an application of 1/2-degree irreducible polynomial generation, this paper proposes a method which generates a prime degree irreducible polynomial with a Type II ONB as its zeros. (c) 2005 Wiley Periodicals, Inc.

    DOI: 10.1002/ecjc.20151

    Web of Science

    Scopus

    researchmap

  • Generating Prime Degree Irreducible Polynomials by Usig Irreducible All-One Polynomial over F_2

    Kei Makita, Yasuyuki Nogami, and Tatsuo Sugimura

    IEICE Trans. (A)   88 ( 7 )   23 - 32   2005年

     詳細を見る

  • A Method for Generating Prime Order Elliptic Curves over F_{q^{2^c } }

    Y.Nogami, Y.Morikawa

    Memoirs of Faculty of Engineering, Okayama University   39 ( 1 )   71 - 81   2005年

     詳細を見る

    記述言語:英語   出版者・発行元:Faculty of Engineering, Okayama University  

    This paper proposes an algorithm for generating prime order elliptic curves over extension field whose extension degree is a power of 2. The proposed algorithm is based on the fact that the order of the twisted elliptic curve is able to be a prime number when the extension degree for the twist operation is a power of 2. When the definition field is F(2(40)−87)(4) , the proposed algorithm can generate a prime order elliptic curve within 5 seconds on PentiumIII (800MHz) with C language.

    CiNii Article

    CiNii Books

    researchmap

  • A High-Speed Square Root Computation in Finite Fields with Application to Elliptic Curve Cryptosystem

    F.Wang, Y.Nogami, Y.Morikawa

    Memoirs of Faculty of Engineering, Okayama University   39 ( 1 )   82 - 92   2005年

     詳細を見る

    記述言語:英語   出版者・発行元:Faculty of Engineering, Okayama University  

    In this paper, we focus on developing a high-speed square root (SQRT) algorithm required for an elliptic curve cryptosystem. Examining Smart algorithm, the previously well-known SQRT algorithm, we can see that there is a lot of computation overlap in Smart algorithm and the quadratic residue (QR) test, which must be implemented prior to a SQRT computation.It makes Smart algorithm inefficient. The essence of our proposition is thus to present a new QR test and an efficient SQRT algorithm to avoid all the overlapping computations. The authors devised a SQRT algorithm for which most of the data required have been computed in the proposed QR test. Not only there is no computation overlap in the proposed algorithm and the proposed QR test, but also in the proposed algorithmover GF(p(2)) (4 | p − 1) some computations can be executed in GF(p); whereas in Smart algorithm over GF(p(2)) all the computations must be executed in GF(p(2)). These yield many reductions in the computational time and complexity. We implemented the two QR tests and the two SQRT algorithms over GF(pm) (m=1, 2) in C++ language with NTL (NumberTheory Library) on Pentium4 (2.6GHz), where the size of p is around 160 bits. The computer simulations showed that the proposed QR test and the proposed algorithm over GF(p(m)) were about 2 times faster than the conventional QR test and Smart algorithm over GF(p(m)).

    CiNii Article

    CiNii Books

    researchmap

  • 3乗剰余および非剰余に基づくツイスト手法

    日高 善仁, 小原 真由美, 野上 保之, 森川 良孝

    電子情報通信学会技術研究報告. OIS, オフィスインフォメーションシステム   104 ( 423 )   1 - 6   2004年11月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    本稿では,3乗非剰余元に基づいたツイスト手法を提案する.また,従来のツイストと共に用いることにより,6種類の楕円曲線を考え,これらの曲線の相互関係および超特異楕円曲線であるかについて示す.

    CiNii Article

    CiNii Books

    researchmap

  • 有限体の上の開平演算

    王鳳, 野上 保之, 森川 良孝

    情報処理学会研究報告コンピュータセキュリティ(CSEC)   2004 ( 75 )   7 - 13   2004年7月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人情報処理学会  

    拡大体における平方根計算は,その計算に先立って平方余剰(RQ)テストが必要である。今までに知られている平方根計算アルゴリズムはスマート法である。しかし、平方根計算とQRテストに多くの重複計算が存在していた。本論分は新たにQRテストと平方根計算アルゴリズムを提案して、すべての重複計算を取り除いて効率を上げること目的にしている。平方根計算アルゴリズムの計算途上で必要となるすべてのデータはすでにQRテストで計算したものを用いる手法を説明して、計算時間と計算量が大幅に減少することを示す。p=2^16+1とp=2^16+3の場合、Pentium4(2.6GHz)上でC++言語を用いて,GF(p)とGF(P^2)における、スマート法と提案法のシミュレーションを行った。p=2^16+1の場合、提案法は平均としてスマート法よりGF(p)で2倍速く、GF(p^2)で10倍速い。またp=2^16+3の場合、提案法は平均としてスマート法よりGF(p)で20倍速く、GF(p^2)で6倍速い。It is well Known that quadratic residue (QR) test should be implemented in advance of a square root (SQRT) computation. Smart algorithm, the previously known fastest algorithm for SQRT computation, only got the idea how to compute SQRT through QR test. However there is a lot of computation overlap in QR test and Smart algorithm. The essence of our proposition is thus to present a new QR test and SQRT algorithm to avoid all the overlapping computations. In this paper the authors devised a SQRT algorithm for which most of the data required have been computed in QR test. This yields many reductions in the computational time and amount. In GF(p) and GF(p^2), we implemented Smart algorithm and the proposed algorithm in C++ Language on Pentium4 (2.6GHz), where p=2^16+1(4|p-1) and p=2^16+3(4 p-1). The computer simulations showed that for p = 2^16 + 1 the proposed algorithm on average accelerates the SQRT computation 2 times and 10 times faster than Smart algorithm over GF(p) and GF(p^2), respectively and for p=2^16+3 the Proposed algorithm on average accelerates the SQRT computation 20 times and 6 times faster than Smart algorithm over GF(p) and GF(p^2), respectively.

    CiNii Article

    CiNii Books

    researchmap

    その他リンク: http://id.nii.ac.jp/1001/00044873/

  • 有限体の上の開平演算

    王 鳳, 野上 保之, 森川 良孝

    電子情報通信学会技術研究報告. ISEC, 情報セキュリティ   104 ( 199 )   7 - 13   2004年7月

     詳細を見る

    記述言語:英語   出版者・発行元:一般社団法人電子情報通信学会  

    拡大体における平方根計算は,その計算に先立って平方剰余(QR)テストが必要である。今までに知られている平方根計算アルゴリズムはスマート法である。しかし、平方根計算とQRテストに多くの重複計算が存在していた。本論文は新たにQRテストと平方根計算アルゴリズムを提案して、すべての重複計算を取り除いて效率を上げること目的にしている。平方根計算アルゴリズムの計算途上で必要となるすべてのデータはすでにQRテストで計算したものを用いる手法を説明して、計算時間と計算量が大幅に減少することを示す。p=2^<16>+1とp=2^<16>+3の場合、Pentium4(2.6GHz)上でC++言語を用いて,GF(p)とGF(p^2)における、スマート法と提案法のシミュレーションを行った。p=2^<16>+1の場合、提案法は平均としてスマート法よりGF(p)で2倍速く、GF(p^2)で10倍速い。またp=2^<16>+3の場合、提案法は平均としてスマート法よりGF(p)で20倍速く、GF(p^2)で6倍速い。

    CiNii Article

    CiNii Books

    researchmap

  • The number of xs such that x^2+u u\in F_p^* becomes a quadratic power residue in F_p

    W.Feng, Y.Nogami, Y.Morikawa

    Proc. of Proceeding of The 2005 International Technical Conference on Circuits/Systems, Computers and Communications 2004 (CD-ROM)   2004年

     詳細を見る

  • F_2上の既約 All One Polynomial を用いた素数次の既約多項式の組織的な生成法

    牧田 慶, 野上 保之, 杉村 立夫

    電子情報通信学会論文誌(A)   2004年

     詳細を見る

  • A Method for Distinguishing the Two Candidate Elliptic Curves in CM Method

    Y.Nogami and Y.Morikawa

    Proc. of The 7th International Conference on Information Security and Cryptology (ICISC2004)   3506   249 - 260   2004年

  • The parity of (#E-1)/2

    Y.Nogami, Y.Morikawa

    Proc. of The 2004 International Symposium on Information Theory and Its Application (ISITA2004) CD-ROM   2004年

     詳細を見る

  • A Classification of Irreducible Cubic Polynomials over Prime Field

    Y.Nogami, Y.Morikawa

    Proc. of The 2005 International Technical Conference on Circuits/Systems, Computers and Communications 2004 (CD-ROM)   2004年

     詳細を見る

  • y^2=x^2+a, a∈F_pの解の総数と3次既約多項式の関係

    中嶋 純, 岡村 真人, 野上 保之, 森川 良孝

    電子情報通信学会技術研究報告. ISEC, 情報セキュリティ   103 ( 315 )   89 - 94   2003年9月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    これまで我々は,楕円曲線暗号への利用を目的とした素体F_p上の3次既約多項式の組織的生成に関する研究を行ってきた.しかしこれまでの研究では,3次既約多項式の中で1次係数が平方剰余であるものと非剰余であるものの個数が不明であった.そこで本稿では,先の問題をF_pの元の集合{X^2+3|0≦X≦p-1,X&isins;F_p}における平方剰余元の個数を求めるという問題に置き換え,これを解いて1次係数が平方剰余である3次既約多項式の個数を明らかにする.

    CiNii Article

    CiNii Books

    researchmap

  • XTR への応用を目的とした拡大体 Fp^<6m> の高速実装

    篠永 茂, 藤井 吉弘, 野上 保之, 森川 良孝

    電子情報通信学会技術研究報告. ISEC, 情報セキュリティ   103 ( 315 )   81 - 88   2003年9月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    XTR (Efficient and Compact Subgroup Trace Representation)とは,素体上の6次拡大体のある条件を満たす部分乗法群の元をトレース関数を用いて2次拡大体上で効果的に表す手法であり,部分乗法群を用いた暗号方式に適用することで,暗号化,復号処理の高速化,鍵長の短縮が実現できる.また,XTRを一般的に考え,6の倍数次拡大体に適用する研究もされている.本稿では,従来法よりもXTRに適した6の倍数次拡大体を構成することにより,暗号化,復号処理の高速化を実現する.

    CiNii Article

    CiNii Books

    researchmap

  • Finite Extension Field with Modulus of All-One Polynomial and Representation of Its Elements for Fast Arithmetic Operations

    Y.Nogami, A.Saito, and Y.Morikawa

    Trans. IEICE   E86A ( 9 )   2376 - 2387   2003年9月

  • A Fast Square Root Computation Using the Frobenius Mapping

    W.Feng, Y.Nogami, and Y.Morikawa

    Fifth International Conference on Information and Communications Security (ICICS2003   2836   1 - 10   2003年

  • A Fast Square Root Calculation for Elliptic Curve Cryptosystem

    Y.Nogami, Y.Morikawa

    Proceeding of The 2003 International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC2003)   2003年

     詳細を見る

  • Fast Generation of Elliptic Curves with Prime Order over Extension Field of Even Extension Degree

    Y.Nogami and Y.Morikawa

    Proceeding of 2003 IEEE International Symposium on Information Theory (ISIT2003)   18 - 18   2003年

     詳細を見る

  • 大学における研究活動と特許

    野上保之

    日本弁理士会論文誌パテント   2003年

     詳細を見る

  • A Fast Implementation of Elliptic Curve Cryptosystem with Prime Order Defined over F_{p^{8 } }

    Y.Nogami, Y.Morikawa

    MEMOIRS OF THE FACULTY OF ENGINEERING OKAYAMA UNIVERSITY   37 ( 2 )   73 - 87   2003年

     詳細を見る

    記述言語:英語   出版者・発行元:Faculty of Engineering, Okayama University  

    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.

    CiNii Article

    CiNii Books

    researchmap

  • Fast Generation of Elliptic Curves with Prime Order over F_{p^{2^c } }

    Y.Nogami, Y.Morikawa

    Proceeding of The International Workshop on Coding and Cryptography (WCC2003)   2003年

     詳細を見る

  • フロベニアス写像が高速となる2次逐次拡大法

    藤井 吉弘, 野上 保之, 森川 良孝

    電子情報通信学会技術研究報告. IT, 情報理論   102 ( 331 )   37 - 42   2002年9月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    次世代の公開鍵暗号方式として楕円曲線暗号が注目されており,その定義体として拡大体も用いられている.拡大体における基本演算については,合成数次なら逐次拡大体を構成することにより高速化できることが示されているが,その逐次拡大体におけるフロベニアス写像の高速化についてはあまり議論されていなかった.そこで本稿では,高速演算可能な8次逐次拡大体の構成法を2通り示すとともに,これら逐次拡大法毎にフロべニアス写像の演算コストを求めて比較することにより,フロベニアス写像を高速実装するには2次既約2項式により逐次拡大体を構成すれば良いことを示す.

    CiNii Article

    CiNii Books

    researchmap

  • 楕円曲線暗号への利用を目的とした3次既約多項式の組織的生成法

    岡村 真人, 野上 保之, 森川 良孝

    電子情報通信学会技術研究報告. IT, 情報理論   102 ( 331 )   49 - 54   2002年9月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    楕円曲線暗号に用いる曲線の位数は,定義体の標数以外の素数であることが望ましい.このことから,素数位数の楕円曲線を生成するアルゴリズムが幾つか提案されている.その1つとして,すべての素数位数楕円曲線が含まれている偶数位数の有理点がない楕円曲線を生成するために,3次既約多項式を効果的に用いたアルゴリズムがある.本稿では,ある1つの3次既約多項式が与えられているものとして,零点と係数の関係を用いて,複数の3次既約多項式を生成する方法を提案する.そして,先のアルゴリズムは,提案法およびtwistされた楕円曲線と元の楕円曲線に関する幾つかの性質を用いることにより,素数位数の楕円曲線を高速に生成できることを実験的に示す.例えば,標数pがp=2^<24>-3の場合には,先のアルゴリズムで生成可能な素数位数の楕円曲線の数は164通りであり,Pentium4(1.7GHz)程度の計算機10台を用いて,これらすべての素数位数楕円曲線を3分以内で生成できることを示す.

    CiNii Article

    CiNii Books

    researchmap

  • F_<p^8>上で定義される楕円加算の16ビットマイコンへの高速実装

    池田 宇晶, 藤井 吉弘, 野上 保之, 森川 良孝

    電子情報通信学会技術研究報告. IT, 情報理論   102 ( 331 )   43 - 48   2002年9月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    RSA暗号方式に代わる公開鍵暗号方式として,楕円曲線暗号が注目されており,計算リソースの限られた端末への楕円曲線暗号の実装も盛んに行われるようになった.そして,計算リソースが限られているマイコンなどでは,暗号化/復号処理の実行時間が問題となる.本稿では,定義体に逐次拡大体を用いることにより,暗号化/復号処理の際に必要となるスカラー倍算が高速に行えることを示す.さらに,定義体を8次遂次拡大体として素数位数楕円曲線を生成し,それを用いてElgamal楕円曲線暗号をマイコン上に実装した結果を報告する.

    CiNii Article

    CiNii Books

    researchmap

  • 多重解像度近似にPN拡散と1次元フーリエ変換を用いた画像電子透かし埋め込み法

    津下浩一郎, 野上 保之, 森川 良孝

    情報処理学会研究報告オーディオビジュアル複合情報処理(AVM)   2001 ( 121 )   49 - 54   2001年12月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人情報処理学会  

    本稿では画像圧縮と切り取りに対して耐性をもつ電子透かし法を提案する。本手法では,まず透かしを挿入する対象画像にハール基底の離散ウェーブレット変換を施し,多重解像度近似(MRA)を抽出する。そのMRAに対しPN系列を用いて周波数拡散を施し,その後1列ごとに1次元フーリエ変換を施す。得られたフーリエ係数を埋め込む透かし情報のビットに応じて増減させることにより情報を埋め込む。本手法は,PN系列を用いて周波数拡散しているため,埋め込みに用いたPN系列を知らない第3者には解読・改竄はできないという特徴を有している。検出時には原画像のPN拡散を施したMRA成分と透かし情報の埋め込まれた画像のPN拡散MRAの差分を求め,1次元離散フーリエ係数の変化分を算出している。このため切り取られた画像の一部分のデータからでも透かし情報の検出ができるという特徴をもっている。In this paper, we propose image digital watermark method which has robustness against image compression and clipping. In this method, we first at first take discrete wavelet transform of original image, and get out multi-resolution approximation(MRA). Next, we spread spectrum of the MRA by Pseudo Noise(PN)sequence, and then take 1D-discrete Fourier transform (DFT) of each column. We vary the DFT coefficients according to each bit of watermark information. This method has the features which the third eavesdropper, who don't know the PN sequence, can not decipher the information data and alter them. In detection process, we take the DFT diference between PN-spread MRA of original image and that of watermark-embedded image and calculate shift of the DFT coefficients. Therefore, this method has the advantage that we can detect the watermark information even from the clipping image.

    CiNii Article

    CiNii Books

    researchmap

    その他リンク: http://id.nii.ac.jp/1001/00041426/

  • 多重解像度近似にPN拡散と1次元フーリエ変換を用いた画像電子透かし埋め込み法

    津下 浩一朗, 野上 保之, 森川 良孝

    電子情報通信学会技術研究報告. CS, 通信方式   101 ( 494 )   49 - 54   2001年12月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    本稿では画像圧縮と切り取りに対して耐性をもつ電子透かし法を提案する.本手法では, まず透かしを挿入する対象画像にハール基底の離散ウェーブレット変換を施し, 多重解像度近似(MRA)を抽出する.そのMRAに対しPN系列を用いて周波数拡散を施し, その後1列ごとに1次元フーリエ変換を施す.得られたフーリエ係数を埋め込む透かし情報のビットに応じて増減させることにより情報を埋め込む.本手法は, PN系列を用いて周波数拡散しているため, 埋め込みに用いたPN系列を知らない第3者には解読・改竄はできないという特徴を有している.検出時には原画像のPN拡散を施したMRA成分と透かし情報の埋め込まれた画像のPN拡散MRAの差分を求め, 1次元離散フーリエ係数の変化分を算出している.このため切り取られた画像の一部分のデータからでも透かし情報の検出ができるという特徴をもっている.

    CiNii Article

    CiNii Books

    researchmap

  • 多重解像度近似の1次元フーリエ変換位相を用いる画像電子透かし埋め込み法

    津下 浩一朗, 野上 保之, 森川 良孝

    情報理論とその応用シンポジウム予稿集 = The proceedings of the Symposium on Information Theory and Its Applications   24 ( 1 )   215 - 218   2001年12月

     詳細を見る

  • 拡張AOPFを用いた楕円曲線暗号の実装

    平本 琢士, 齋藤 昭徳, 野上 保之, 森川 良孝

    情報理論とその応用シンポジウム予稿集 = The proceedings of the Symposium on Information Theory and Its Applications   24 ( 1 )   351 - 354   2001年12月

     詳細を見る

  • F_<p^2^m>上で twist された楕円曲線が階数1となる標数とトレースの条件

    淡野 孝充, 野上 保之, 森川 良孝

    情報理論とその応用シンポジウム予稿集 = The proceedings of the Symposium on Information Theory and Its Applications   24 ( 1 )   355 - 358   2001年12月

     詳細を見る

  • 3次既約多項式を用いた楕円曲線暗号に関する一考察

    野上 保之, 森川 良孝

    電子情報通信学会技術研究報告. IT, 情報理論   101 ( 407 )   7 - 12   2001年11月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    楕円曲線(Elliptic Curve;EC)はその多様性から, 暗号への応用が盛んに研究されている.これらの研究は, 暗号強度に関するものと実装に関するものに大別される.楕円曲線暗号(Elliptic Curve Cryptosystems;ECC)において, 暗号強度が強くあるためには, 曲線の位数に160bit程度の大きな素因数が含まれる必要がある.とくに標数以外の素数である場合には, 一般に暗号強度は強いことが知られている.しかし素数位数であっても, MOV還元法あるいはFR還元法による攻撃が可能である曲線(例えば超特異楕円曲線)に対しては必ずしも安全ではないことも指摘されている.本稿では, 係数体をF_p, 定義体をF_<p^s>とするような楕円曲線E(F_<p^s>)に対して, 暗号強度, 高速演算それぞれに対して最適な曲線のパラメータについて議論し, その共通部分を抽出することで, 2つの事項を両立する曲線パラメータ条件を与える.攻撃法としては, MOV還元法およびFR還元法が回避できることを, 一方実装面に関しては, 平方根導出および有理点加算が高速に行えることを目的とする.最後に, 本稿で示した条件をすべて満たす楕円曲線の構成例を示す.

    CiNii Article

    CiNii Books

    researchmap

  • (x^<m+1>-1)/(x-1)を法多項式とする拡大体における平方根導出の高速化

    淡野 孝充, 齋藤 昭徳, 野上 保之, 森川 良孝

    電子情報通信学会技術研究報告. IT, 情報理論   101 ( 234 )   31 - 36   2001年7月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    次世代公開鍵暗号方式として, 楕円曲線暗号が注目されている.楕円曲線暗号を構成するには, 逆元演算を含む有限体上の四則演算, 平方剰余判定, 平方根導出が必要であり, これらの演算は, 楕円曲線暗号を実用に耐えられるよう高速に処理ができなければならない.本稿では, (x^<m+1>-1)/(x-1)を法多項式とした拡大体AOPF(All One Polynomial Field)において, 高速な平方根導出を行う手法を提案する.

    CiNii Article

    CiNii Books

    researchmap

  • ウェーブレット係数の視覚的複雑さを用いた画像深層暗号化法

    津下 浩一朗, 野上 保之, 森川 良孝

    電子情報通信学会技術研究報告   100 ( 694 )   35 - 40   2001年3月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    CiNii Article

    researchmap

  • 高速演算を目的とした(xm+1-1)/(x-1)を法多項式とする拡大体

    齋藤 昭徳, 平本 琢士, 淡野 孝充, 野上 保之, 森川 良孝

    電子情報通信学会技術研究報告   100 ( 693 )   129 - 134   2001年3月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    次世代の公開鍵暗号方式として楕円曲線暗号が注目されており,その定義体として拡大体が用いられるようになってきた.拡大体の元に対する演算,特に乗算及び逆元演算は,拡大体の標数,拡大次数あるいは基底の選択により,処理速度が大幅に異なるため,これらの選択には注意を払う必要がある.近年提案されたOEFは,そのような意味で最適な拡大体といわれている.本稿では,乗算及び逆元演算をOEFよりさらに高速に行える拡大体の提案を目的として,(x^<m+1>-1)/(x-1)の零点ωを用いた集合{ω,ω^2,・・・,ω^m}を基底として用いる拡大体及び演算方法を提案する.

    CiNii Article

    CiNii Books

    researchmap

  • GF(P)における3次多項式の高速既約判定アルゴリズム

    平本琢士, 野上保之, 森川良孝

    電子情報通信学会 論文誌A   2001年

     詳細を見る

  • Determining Minimal Polynomial of Proper Element by Using Higher Degree Traces

    Y.Nogami, Y.Morikawa

    MEMOIRS OF THE FACULTY OF ENGINEERING OKAYAMA UNIVERSITY   2001年

     詳細を見る

  • GF(P)上の3次多項式の既約判定

    平本 琢士, 矢野 敏行, 野上 保之, 森川 良孝

    電子情報通信学会技術研究報告. IT, 情報理論   99 ( 562 )   19 - 24   2000年1月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    素数体GF(P)上の楕円曲線y^2=f(x)=^^△x^3+ax+bは短い鍵長で公開鍵暗号を提供することができることから, 近年この曲線の性質が多方面から研究されている.この暗号が安全であるためには, 3次多項式f(x)がGF(P)上で既約であることが必要である.既約判定法には遂次代入法が考えられるが, 関連してStickelbergerの定理が有名である.この定理によれば, f(x)の判別式D(f)がGF(P)において平方非剰余ならf(x)は非既約と判定できるが, 平方剰余なら判定不可能である.そこで本論文では, 複素数体上の3次多項式の解法を与えるCardanoの公式をGF(P)上に適用する.3根すべてがGF(P^3)上の真性元であれば, f(x)は既約と判定できる.この条件を整理することより, 極めて高速な3次多項式の既約判定法を導出する.

    CiNii Article

    CiNii Books

    researchmap

  • (P^<P^<i+1>>-1)/(P^<P^i>-1)が素数となる場合の原始多項式の導出

    野上 保之, 森川 良孝

    電子情報通信学会技術研究報告. IT, 情報理論   99 ( 562 )   31 - 35   2000年1月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    情報通信の分野において, Reed Solomon符号(RS符号)はバイト単位での符号化が行え, バースト誤り訂正符号として広く用いられている.RS符号はGF(2^8)で定義されるため, GF(2)上の8次原始多項式が必要となる.このように, バイト単位での符号化を考えたとき, 2のべき乗次数の原始多項式が必要となる.本稿では, P=2の場合も含め, フェルマ数を(P^P^<i+1>-1) / (P^P^i-1)の形で一般化し, (P^P^<i+1>-1) / (P^P^i-1)が素数となる場合のGF(P)上のP^<i-1>, P^<i+j>次原始多項式の導出法を, 変数変換x:=x^P-x+s, s∈GF(P)を用いる手法で提案する.

    CiNii Article

    CiNii Books

    researchmap

  • 変数変換x:=x^P-x+sおよびx:=x^kの繰り返しによる無限個の既約多項式の導出

    齋藤 昭徳, 岡 博文, 野上 保之, 森川 良孝

    電子情報通信学会技術研究報告. IT, 情報理論   99 ( 562 )   25 - 30   2000年1月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    従来, 高次既約多項式の導出法として, 2つの変数変換を用いる手法が知られている。k乗非剰余元に基づく変数変換x:=x^kおよびトレースが非零である元に基づく標数Pを用いた変数変換x:=x^P-xによる手法である.そして, これらの変数変換操作を遂次繰り返してP^ik^j倍の次数の既約多項式が導出できる可能性がある.本稿ではk|(P-1)とすることにより, このような高次既約多項式の導出法を与え, それを可能とするための最初に与えられるべき既約多項式の条件を与える.

    CiNii Article

    CiNii Books

    researchmap

  • n次トレースを用いた最小多項式の一特定法

    野上 保之, 山根 延元, 森川 良孝

    電子情報通信学会技術研究報告. IT, 情報理論   99 ( 296 )   7 - 11   1999年9月

     詳細を見る

    記述言語:英語   出版者・発行元:一般社団法人電子情報通信学会  

    CiNii Article

    CiNii Books

    researchmap

  • 変数変換xp-x+Sによる無限個の既約多項式の導出

    野上保之,田中清,杉村立夫,大下眞二郎

    電子情報通信学会論文誌   J82-A ( 4 )   587 - 590   1999年

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    ある一定の条件を満たす既約多項式が与えられたとき, その既約多項式に対して変数変換及びその相反多項式をとるという操作を繰り返し行うことにより, 標数倍の次数ごとの無限個の高次既約多項式を組織的に導出する手法を提案する. 更に本手法を用いることにより得られる標数のべき乗の次数の既約多項式は, その零点の共役元の組が零点の存在する拡大体において正規基底を成すことを示す.

    CiNii Article

    CiNii Books

    researchmap

  • Deriving Infinite Number of Irreducible Polynomials by Variable Transformation xp-x+s

    野上 保之, 田中 清, 杉村 立夫, 大下 眞二郎

    THE TRANSACTIONS OF THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS A   J82-A ( 4 )   587 - 590   1999年

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    ある一定の条件を満たす既約多項式が与えられたとき, その既約多項式に対して変数変換及びその相反多項式をとるという操作を繰り返し行うことにより, 標数倍の次数ごとの無限個の高次既約多項式を組織的に導出する手法を提案する. 更に本手法を用いることにより得られる標数のべき乗の次数の既約多項式は, その零点の共役元の組が零点の存在する拡大体において正規基底を成すことを示す.

    CiNii Article

    CiNii Books

    researchmap

  • 変数変換x^P-x+sによる無限個の既約多項式の導出

    野上保之, 田中清, 杉村立夫, 大下眞二郎

    電子情報通信学会論文誌(A)   J82-A ( 4 )   587-590 - 590   1999年

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    ある一定の条件を満たす既約多項式が与えられたとき, その既約多項式に対して変数変換及びその相反多項式をとるという操作を繰り返し行うことにより, 標数倍の次数ごとの無限個の高次既約多項式を組織的に導出する手法を提案する. 更に本手法を用いることにより得られる標数のべき乗の次数の既約多項式は, その零点の共役元の組が零点の存在する拡大体において正規基底を成すことを示す.

    CiNii Article

    CiNii Books

    researchmap

  • Deriving Infinite Number of Irreducible Polynomials by Variable Transformation xp-x+s

    THE TRANSACTIONS OF THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS A   J82-A ( 4 )   587 - 590   1999年

     詳細を見る

  • P-polynomial を用いた素数次拡大体における正規基底に関する一考察

    野上 保之, 田中 清, 杉村 立夫, 大下 眞二郎

    電子情報通信学会技術研究報告. IT, 情報理論   97 ( 80 )   25 - 30   1997年5月

     詳細を見る

    記述言語:日本語   出版者・発行元:一般社団法人電子情報通信学会  

    近年,情報セキュリティー等の分野において有限体理論にその基礎を置く研究が広く行われている.そこで,有限体についてより深く考察することは大変興味深く重要なものである.本稿では,自己回帰集合およびP-polynomialなる観点から有限体についてより深く考察ができないかと考えた.結果,標数と相異なる素数次拡大体において,その零点が正規基底となるような最小多項式(既約多項式)を特定することができ,正規基底の個数を特定することができた.さらに,零点が正規基底となるような最小多項式の新たなる判定法を提案する.

    CiNii Article

    CiNii Books

    researchmap

  • Testing and Deriving Primitive Polynomial

    THE TRANSACTIONS OF THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS A   J79-A ( 3 )   761 - 767   1996年

     詳細を見る

  • 原始多項式の判定および導出

    野上保之, 杉村立夫

    電子情報通信学会論文誌(A)   1996年

     詳細を見る

  • 原始多項式の判定および導出

    電子情報通信学会論文誌   J79-A ( 3 )   761 - 767   1996年

     詳細を見る

  • Testing and Deriving Primitive Polynomial

    THE TRANSACTIONS OF THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS A   J79-A ( 3 )   761 - 767   1996年

     詳細を見る

▼全件表示

講演・口頭発表等

  • マルコフ過程と仮説検定によるRO型乱数生成回路の評価

    佐藤陵一、他

    第8回有限体理論とその擬似乱数系列生成への応用ワークショップ予稿集  2022年 

     詳細を見る

    開催年月日: 2022年

    researchmap

  • Cryptography-based Security in IoT Era 招待

    Yasuyuki NOGAMI

    STSS: International Symposium on Socially and Technically Symbiotic Systems  2021年11月16日 

     詳細を見る

    開催年月日: 2021年11月15日 - 2021年11月17日

    会議種別:口頭発表(招待・特別)  

    researchmap

  • OTP認証を用いた悪性USBデバイスに対する対策の提案

    桒田龍門

    第7回有限体理論とその擬似乱数系列生成への応用ワークショップ予稿集  2021年 

     詳細を見る

    開催年月日: 2021年

    researchmap

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

    M. A. Ali, Y. Kodera, S. Heguri, T. Kusaka, S. Uehara and R. H. M. Zaragoza

    Proceedings of the International Conference on Information Technology 

     詳細を見る

    開催年月日: 2018年12月

    会議種別:口頭発表(一般)  

    researchmap

  • Design of a message authentication protocol for CAN FD based on Chaskey lightweight MAC

    G. Carel, R. Isshiki, T. Kusaka, Y. Nogami and S. Araki

    International Symposium on Computing and Networking 

     詳細を見る

    開催年月日: 2018年11月

    会議種別:口頭発表(一般)  

    researchmap

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

    M. A. Khandaker, Y. Nanjo, T. Kusaka and Y. Nogami

    International Symposium on Computing and Networking 

     詳細を見る

    開催年月日: 2018年11月

    会議種別:口頭発表(一般)  

    researchmap

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

    Y. Kodera, M. Kuribayashi, T. Kusaka and Y. Nogami

    World Conference on Information Security Applications 

     詳細を見る

    開催年月日: 2018年11月

    会議種別:口頭発表(一般)  

    researchmap

  • Advanced Searchable Encryption: Keyword Search for Matrix-type Storage

    Y. Kodera, M. Kuribayashi, T. Kusaka and Y. Nogami

    International Symposium on Computing and Networking 

     詳細を見る

    開催年月日: 2018年11月

    会議種別:口頭発表(一般)  

    researchmap

  • A Study on the Parameter Size of the Montgomery Trick for ECDLP

    K. Ikuta, S. Joichi, K. Kobayashi, M. A. Khandaker, T. Kusaka and Y. Nogami

    International Symposium on Information Theory and Its Applications 

     詳細を見る

    開催年月日: 2018年10月

    会議種別:口頭発表(一般)  

    researchmap

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

    K. Ikuta, S. Joichi, K. Kobayashi, M. A. Khandaker, T. Kusaka and Y. Nogami

    International Symposium on Information Theory and Its Applications 

     詳細を見る

    開催年月日: 2018年10月

    会議種別:口頭発表(一般)  

    researchmap

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

    Y. Uetake, A. Sanada, L. Weissbart, T. Kusaka, S. Dequesne and Y. Nogami

    International Symposium on Information Theory and Its Applications 

     詳細を見る

    開催年月日: 2018年10月

    会議種別:口頭発表(一般)  

    researchmap

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

    M. A. Ali, Y. Kodera, T. Kusaka, T. Miyazaki, Y. Nogami, S. Uehara and R. H. M. Zaragoza

    International Technical Conference on Circuits/Systems, Computers and Communication 

     詳細を見る

    開催年月日: 2018年7月

    会議種別:口頭発表(一般)  

    researchmap

  • A Construction Method of a Binary Sequence Using a Logistic Map over Fp for IoT Device

    T. Nagano, T. Miyazaki, S. Uehara and Y. Nogami

    International Conference on Consumer Electronics-Taiwan 

     詳細を見る

    開催年月日: 2018年5月

    会議種別:口頭発表(一般)  

    researchmap

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

    Y. Kodera, T. Kusaka, T. Miyazaki, Y. Nogami, S. Uehara and R. H. M. Zaragoza

    International Conference on Consumer Electronics-Taiwan 

     詳細を見る

    開催年月日: 2018年5月

    会議種別:口頭発表(一般)  

    researchmap

  • Efficient Parallel Simeck Encryption with GPGPU and OpenCL

    T. Park, H. Seo, Y. Nogami, M. A. Khandaker and H. W. Kim

    International Conference on Consumer Electronics-Taiwan 

     詳細を見る

    開催年月日: 2018年5月

    会議種別:口頭発表(一般)  

    researchmap

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

    X. Li, Y. Kodera, Y. Uetake, T. Kusaka and Y. Nogami

    International Conference on Consumer Electronics-Taiwan 

     詳細を見る

    開催年月日: 2018年5月

    会議種別:口頭発表(一般)  

    researchmap

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

    K. Kawase, T. Miyazaki, S. Araki, S. Uehara and Y. Nogami

    International Conference on Consumer Electronics-Taiwan 

     詳細を見る

    開催年月日: 2018年5月

    会議種別:口頭発表(一般)  

    researchmap

  • Study on reduction on average computational complexity of GMD decoding using property of bounded distance decoding

    S. Ueda, T. Kusaka

    The 8th International Workshop on Advances in Networking and Computing 

     詳細を見る

    開催年月日: 2017年11月

    記述言語:英語   会議種別:口頭発表(一般)  

    開催地:Aomori  

    researchmap

  • Uniform Binary Sequence Generated over Odd Characteristic Field

    Y. Kodera, T. Miyazaki, T. Kusaka, A. Md. Arshad, Y. Nogami, S. Uehara

    International Conference on Information Technology 

     詳細を見る

    開催年月日: 2017年11月

    記述言語:英語   会議種別:口頭発表(一般)  

    開催地:Singapore  

    researchmap

  • An ECC implementation with a twisted Montgomery curve over Fq^32 on an 8-bit microcontroller

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

    The 8th International Workshop on Advances in Networking and Computing 

     詳細を見る

    開催年月日: 2017年11月

    記述言語:英語   会議種別:口頭発表(一般)  

    開催地:Aomori  

    researchmap

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

    Y. Kodera, T. Kusaka, T. Miyazaki, M. A. Khandaker, Y. Nogami, S. Uehara

    The 8th International Workshop on Advances in Networking and Computing 

     詳細を見る

    開催年月日: 2017年11月

    記述言語:英語   会議種別:口頭発表(一般)  

    開催地:Aomori  

    researchmap

  • Solving 114-bit ECDLP for a Barreto-Naehrig Curve

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

    The 20th Annual International Conference on Information Security and Cryptology 

     詳細を見る

    開催年月日: 2017年11月

    記述言語:英語   会議種別:口頭発表(一般)  

    開催地:Korea  

    researchmap

  • Linear Complexity of Pseudo Random Binary Sequence Generated by Trace Function and Legendre Symbol Over Proper Sub Extension Field

    A. M. Arshad, T. Miyazaki, S. Heguri, Y. Nogami, S. Uehara, R. H. Morelos-Zaragoza

    IWSDA 2017 

     詳細を見る

    開催年月日: 2017年10月

    記述言語:英語   会議種別:口頭発表(一般)  

    開催地:Sapporo  

    researchmap

  • Effcient Optimal Ate Pairing at 128-bit Security Level

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

    INDOCRYPT 2017 

     詳細を見る

    開催年月日: 2017年10月

    記述言語:英語   会議種別:口頭発表(一般)  

    開催地:India  

    researchmap

  • Some Properties of Z_4 Sequences Obtained by Using the Gray Code Mapping from Two Binary M-Sequences

    M. Goto, S. Uehara, Y. Nogami

    IWSDA 2017 

     詳細を見る

    開催年月日: 2017年10月

    記述言語:英語   会議種別:口頭発表(一般)  

    開催地:Sapporo  

    researchmap

  • Efficient Pairing-based Cryptography on Raspberry pi

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

    2017 the 7th International Conference on Communication and Network Security 

     詳細を見る

    開催年月日: 2017年10月

    記述言語:英語   会議種別:口頭発表(一般)  

    開催地:Tokyo  

    researchmap

  • Parallel Implementations of SIMON and SPECK, Revisited

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

    The 18th World Conference on Information Security Applications (WISA 2017) 

     詳細を見る

    開催年月日: 2017年10月

    記述言語:英語   会議種別:口頭発表(一般)  

    開催地:Korea  

    researchmap

  • Android上でのモンゴメリ乗算を用いたECDLP攻撃の実装

    城市 翔(岡山大学),梶谷翔馬(岡山大学),Sylvain Duquesne(University of Rennes 1),野上保之(岡山大学),Thomas Austin(San Jose State University)

    SITA2016 

     詳細を見る

    開催年月日: 2016年11月

    記述言語:日本語   会議種別:口頭発表(一般)  

    researchmap

  • 同じNTU系列を生成する異なる既約多項式についての考察

    平郡聖士(岡山大学),野上保之(岡山大学),上原 聡(北九州市立大学),土屋和由(光電製作所)

    SITA2016 

     詳細を見る

    開催年月日: 2016年11月

    記述言語:日本語   会議種別:口頭発表(一般)  

    researchmap

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

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

    International Conference on Information Security and Cryptology 2016 

     詳細を見る

    開催年月日: 2016年5月

    記述言語:英語   会議種別:口頭発表(一般)  

    researchmap

  • Periodic Autocorrelation of a Signed Binary Sequence Additively Generated With Trace Over Odd Characteristic Extension Field

    Y. Nogami and S. Uehara

    The 31th International Technical Conference on Circuits/Systems, Computers and Communications 

     詳細を見る

    開催年月日: 2016年5月

    記述言語:英語   会議種別:口頭発表(一般)  

    researchmap

  • Efficient Operation over F(2^4)^2 for Security Technologies

    N. Jitsui, Y. Nogami, H. Seo, and N. Begum

    International Conference on Consumer Electronics – Taiwan 2016 

     詳細を見る

    開催年月日: 2016年5月

    記述言語:英語   会議種別:口頭発表(一般)  

    researchmap

  • Parallel Implementations of LEA, Revisited

    H. Seo, Y. Nogami, et al.

    The 17th Workshop on Information Security Applications 

     詳細を見る

    開催年月日: 2016年5月

    記述言語:英語   会議種別:口頭発表(一般)  

    researchmap

  • Efficient Scalar Multiplication for Ate Based Pairing over KSS Curve of Embedding Degree 18

    K. Md. Al-Amin, Y. Nogami, H. Seo, and S. Duquesne

    The 17th Workshop on Information Security Applications 

     詳細を見る

    開催年月日: 2016年5月

    記述言語:英語   会議種別:口頭発表(一般)  

    researchmap

  • A Pseudo-random Binary Sequence Generated by Using Primitive Polynomial of Degree 2 over Odd Characteristic Field Fp

    Ali. Md. Arshad and Y. Nogami

    International Conference on Consumer Electronics – Taiwan 2016 

     詳細を見る

    開催年月日: 2016年5月

    記述言語:英語   会議種別:口頭発表(一般)  

    researchmap

  • An Improvement of Scalar Multiplication on Elliptic Curve Defined over Extension Field Fq2

    K. Md. Al-Amin and Y. Nogami

    International Conference on Consumer Electronics – Taiwan 2016 

     詳細を見る

    開催年月日: 2016年5月

    記述言語:英語   会議種別:口頭発表(一般)  

    researchmap

  • A New Approach for Generating Well Balanced Pseudo-random Signed Binary Sequence Over Odd Characteristic Field

    A. Md. Arshad, Y. Nogami, C. Ogawa, H. Ino, S. Uehara, R. Morelos-Zaragoza, and K. Tsuchiya

    International Symposium on Information Theory and its Applications 2016 

     詳細を見る

    開催年月日: 2016年5月

    記述言語:英語   会議種別:口頭発表(一般)  

    researchmap

  • Pseudo Random Binary Sequence Generated by Trace and Legendre Symbol with Non Primitive Element in Fp2

    C. Ogawa, A. Md. Arshad, Y. Nogami, S. Uehara, K. Tsuchiya, and R. Morelos-Zaragoza

    2016 International Symposium on Nonlinear Theory and Its Applications 

     詳細を見る

    開催年月日: 2016年5月

    記述言語:英語   会議種別:口頭発表(一般)  

    researchmap

  • Auto and Cross Correlation of Well Balanced Sequence over Odd Characteristic Field

    Ali Md. Arshad, Yasuyuki Nogami, Hiroto Ino, Satoshi Uehara

    Third International Symposium on Computing and Networking CANDAR2016 

     詳細を見る

    開催年月日: 2016年5月

    記述言語:英語   会議種別:口頭発表(一般)  

    researchmap

  • Isomorphic Mapping for Ate-Based Pairing over KSS Curve