Faculty Profiles - NOGAMI Yasuyuki

An Improvement of Tate Paring with Supersingular Curve Reviewed

Akito Kumano, Yasuyuki Nogami

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

Language：English Publishing type：Research paper (international conference proceedings) Publisher：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

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

Binary Field Multiplication on ARMv8.

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

IACR Cryptol. ePrint Arch. 2015 688 - 688 2015

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

Publishing type：Research paper (international conference proceedings) Publisher：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

Secure Binary Field Multiplication.

Other Link： https://dblp.uni-trier.de/db/conf/wisa/wisa2015.html#SeoC0NPCK15

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

IACR Cryptol. ePrint Arch. 2015 799 - 799 2015

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

Periods of Sequences Generated by the Logistic Map over Finite Fields with Control Parameter Four Reviewed

Kazuyoshi Tsuchiya, Yasuyuki Nogami

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

Language：English Publishing type：Research paper (international conference proceedings) Publisher：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

A Consideration on Crosscorrelation of a Kind of Trace Sequences over Finite Field. Reviewed

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

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

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

In our previous work, the 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. And the sequence has some interesting features such as period, periodic autocorrelation, and linear complexity. In this paper, by applying a new step into the process of generating sequence, a new generating method of k-value sequence is derived. As with the previous work, it also has some interesting features such as period, periodic autocorrelation, and periodic crosscorrelation. From the experimental results, these features are examined.

DOI： 10.1109/CANDAR.2015.53

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

Nasima Begum, Toru Nakanishi, Yasuyuki Nogami

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

Language：English Publishing type：Research paper (international conference proceedings) Publisher：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

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

Nasima Begum, Toru Nakanishi, Yasuyuki Nogami

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

Language：English Publishing type：Research paper (international conference proceedings) Publisher：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

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

Publishing type：Research paper (international conference proceedings) Publisher：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

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

Volunteer Computing for Solving an Elliptic Curve Discrete Logarithm Problem Reviewed

Shoma Kajitani, Yasuyuki Nogami, Shunsuke Miyoshi, Thomas Austin

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

Language：English Publishing type：Research paper (international conference proceedings) Publisher：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

Other Link： 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 Reviewed

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

Language：English Publishing type：Research paper (international conference proceedings) Publisher：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

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

Kazuyoshi Tsuchiya, Yasuyuki Nogami

CoRR abs/1510.03650 2015

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

Publishing type：Research paper (international conference proceedings)

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.

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

Language：English Publishing type：Research paper (international conference proceedings) Publisher：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.

Investigation on FPGA Malfunctions by Clock Glitch Induced by Disturbance Invasion through Power Cable

Iokibe Kengo, Maeshima Kazuhiro, Watanabe Tetsushi, Kagotani Hiroto, Nogami Yasuyuki, Hayashi Yu-ichi, Toyota Yoshitaka, Sone Hideaki

Proceedings of JIEP Annual Meeting 28 ( 0 ) 63 - 66 2014

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

Language：English Publishing type：Research paper (international conference proceedings) Publisher：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%.

Efficient non symmetric pairing groups on ordinary pairing friendly curve of embedding degree 1 Reviewed

Tetsuya Izuta, Yasuyuki Nogami, Yoshitaka Morikawa

IEEE International Conference on Communications 1 - 5 2011

Language：English Publishing type：Research paper (international conference proceedings) Publisher：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