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

DOI： 10.1109/itc-cscc55581.2022.9894933

researchmap

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

DOI： 10.1109/itc-cscc55581.2022.9894996

researchmap

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

DOI： 10.1109/itc-cscc55581.2022.9895089

researchmap

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

DOI： 10.1109/itc-cscc55581.2022.9894931

researchmap

Publishing type：Research paper (scientific journal)   Publisher：MDPI AG  

Ensuring the reliability of data gathering from every connected device is an essential issue for promoting the advancement of the next paradigm shift, i.e., Industry 4.0. Blockchain technology is becoming recognized as an advanced tool. However, data collaboration using blockchain has not progressed sufficiently among companies in the industrial supply chain (SC) that handle sensitive data, such as those related to product quality, etc. There are two reasons why data utilization is not sufficiently advanced in the industrial SC. The first is that manufacturing information is top secret. Blockchain mechanisms, such as Bitcoin, which uses PKI, require plaintext to be shared between companies to verify the identity of the company that sent the data. Another is that the merits of data collaboration between companies have not been materialized. To solve these problems, this paper proposes a business-to-business collaboration system using homomorphic encryption and blockchain techniques. Using the proposed system, each company can exchange encrypted confidential information and utilize the data for its own business. In a trial, an equipment manufacturer was able to identify the quality change caused by a decrease in equipment performance as a cryptographic value from blockchain and to identify the change one month earlier without knowing the quality value.

DOI： 10.3390/s22134909

researchmap

Publishing type：Research paper (scientific journal)  

DOI： 10.3390/e24060780

researchmap

Publishing type：Research paper (scientific journal)  

researchmap

Other Link： https://dblp.uni-trier.de/db/journals/ijnc/ijnc12.html#NanjoSKKN22

Publishing type：Research paper (international conference proceedings)  

DOI： 10.1109/ICCE-Taiwan55306.2022.9869152

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/icce-tw/icce-tw2022.html#InoueMUAN22

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

DOI： 10.1109/CANDARW57323.2022.00043

researchmap

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

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

DOI： 10.1109/CANDAR57322.2022.00021

researchmap

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

Publishing type：Research paper (international conference proceedings)  

We propose a CMAC using Lightweight Blockcipher Piccolo for a well-known LPWA: Sigfox network. Increasing numbers of a device link to the Internet with LPWA, However these devices does not have adequate resources. Our proposal would be an effective security measure for limited resource IoT devices with Sigfox network. Piccolo-CMAC is implemented by employing Piccolo-80 to encrypt message without using extra resources.

DOI： 10.1109/ITC-CSCC52171.2021.9501429

Scopus

researchmap

Publishing type：Research paper (international conference proceedings)  

In this research, the authors propose a functionality based on message authentication code (MAC) to ensure the correctness of its path from a source to a destination. It aims to use a controller area network (CAN) over driving system. In the construction, MAC and a pseudorandom number generator having an intentional group structure are employed so that the correct user can authenticate a message and its path. The proposed method is experimentally evaluated by observing the computational time over IoT devices. As a result, it is found that the results show that it is possible to implement as an additional function that gives path authentication with additional time at most 3 times for the corresponding computation.

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

Scopus

researchmap

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

A cloud service to offer entropy has been paid much attention to. As one of the entropy sources, a physical random number generator is used as a true random number generator, relying on its irreproducibility. This paper focuses on a physical random number generator using a field-programmable gate array as an entropy source by employing ring oscillator circuits as a representative true random number generator. This paper investigates the effects of an XOR gate in the oscillation circuit by observing the output signal period. It aims to reveal the relationship between inputs and the output through the XOR gate in the target generator. The authors conduct two experiments to consider the relevance. It is confirmed that combining two ring oscillators with an XOR gate increases the complexity of the output cycle. In addition, verification using state transitions showed that the probability of the state transitions was evenly distributed by increasing the number of ring oscillator circuits.

DOI： 10.3390/e23091168

Web of Science

Scopus

researchmap

Language：English   Publishing type：Research paper (scientific journal)   Publisher：The Institute of Electronics, Information and Communication Engineers  

<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

Other Link： https://dblp.uni-trier.de/db/journals/ieiceta/ieiceta104.html#NanjoSKN21

Language：English   Publishing type：Research paper (scientific journal)   Publisher：IJNC Editorial Committee  

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

Other Link： https://dblp.uni-trier.de/db/journals/ijnc/ijnc11.html#NanjoSKN21

Language：English   Publishing type：Research paper (scientific journal)   Publisher：IJNC Editorial Committee  

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

Other Link： https://dblp.uni-trier.de/db/journals/ijnc/ijnc11.html#MiuraKMKKN21

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

DOI： 10.1109/ICCE-TW52618.2021.9602941

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/icce-tw/icce-tw2021.html#HattoriTTNKN21

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

DOI： 10.1109/ICCE-TW52618.2021.9602954

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/icce-tw/icce-tw2021.html#EguchiMUAN21

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

DOI： 10.1109/ICCE-TW52618.2021.9603240

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/icce-tw/icce-tw2021.html#YoshimotoKKN21

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

DOI： 10.1109/ICCE-TW52618.2021.9603017

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/icce-tw/icce-tw2021.html#NasuKN21

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

DOI： 10.1109/ICCE-TW52618.2021.9603146

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/icce-tw/icce-tw2021.html#MiyamotoFHYKKN21

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

DOI： 10.1109/ICCE-TW52618.2021.9602917

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/icce-tw/icce-tw2021.html#TakahashiMAUN21

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

DOI： 10.1109/ICCE-TW52618.2021.9603232

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/icce-tw/icce-tw2021.html#SatoKKN21

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

DOI： 10.1109/CANDAR53791.2021.00014

researchmap

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

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

DOI： 10.1109/CANDAR53791.2021.00028

researchmap

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

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

DOI： 10.1109/CANDARW53999.2021.00064

researchmap

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

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

DOI： 10.1109/CANDARW53999.2021.00075

researchmap

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

Publishing type：Part of collection (book)   Publisher：De Gruyter  

DOI： 10.1515/9783110621730-006

researchmap

Other Link： https://www.degruyter.com/document/doi/10.1515/9783110621730-006/xml

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

In this study, a new MAC based on OMAC is implemented in Arduino Uno. In addition, a function to update the common key based on pseudo-random numbers is additionally implemented. A re-verification function of the MAC value on the receiving ECU is also implemented. Similarly, these features have been implemented for the Raspberry Pi. Communication with Arduino is possible. The time taken to calculate the MAC and the time required to update the key are measured for the Arduino and Raspberry Pi, respectively. As a result, both of the OMAC processing time and the key update time in both of the microcomputers satisfied a time constraints.

Web of Science

Scopus

researchmap

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

Bilinear pairings are widely used for innovative protocols such as ID-based encryption and group signature authentication. According to the current research of the pairings, not only families of pairing-friendly elliptic curves with embedding degrees of multiple of four or six but also that of multiple of three can realize efficient pairings. However, the range of the practical choices of the elliptic curves with embedding degrees of multiple of three is more restricted than that of even embedding degrees by an efficiency reason for the computation of Miller's algorithm with a signed binary representation of a loop parameter. To ease the restriction, the authors propose to compute the Miller's algorithm by swapping the sign of the loop parameter without performance degradation for the ate pairing on such the elliptic curves.

Web of Science

Scopus

researchmap

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

Bilinear pairings are widely used for innovative protocols such as ID-based encryption and group signature authentication. According to the current research of the pairings, not only families of pairing-friendly elliptic curves with embedding degrees of multiple of four or six but also that of multiple of three are attractive choices for practical pairings. However, the pairings on such the elliptic curves cannot benefit from an efficient performing squaring available in a cyclotomic subgroup which plays an important role in fast final exponentiation. As one of the candidates of replacements of the squaring, the authors consider an efficient performing cubing available in the cyclotomic subgroup.

Web of Science

Scopus

researchmap

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

Controller Area Network (CAN) is widely employed as an in-vehicle network, and is required for extremely high reliability. CAN uses five mechanisms to detect errors caused by channel noises in CAN frames. However, an adversary can reportedly falsify a CAN frame by tampering with sample points in the frame. In this paper, the effectiveness of a new falsification method that does not require sample point tampering is proposed. In the method, transient electromagnetic pulses are injected into a CAN bus by magnetic coupling that enables falsification at the target CAN node without error detection. The proposed method was examined on a CAN bus which consists of two CAN nodes. As a result, the new falsification method was effective for CAN.

Web of Science

Scopus

researchmap

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

Pairing-based cryptography has received much attention as an encryption method for realizing advanced cryptography such as ID-based encryption and searchable encryption. In a pairing-friendly elliptic curve of embedding degree 10, calculation cost of multiplication and squaring on extension fields of degree 5 are related to efficiency of pairing. Therefore, it is necessary to select an efficient multiplication and squaring algorithms on the extension field of degree 5. To apply these algorithms, the authors implement a pairing on an elliptic curve of embedding degree 10 with type-II all-one polynomial extension field (AOPF) of degree of 5 and optimal extension field (OEF) of degree of 5. As a result, the computational complexity of pairing with the expanded AOPF of degree 5 are almost 7.4% efficient than that of the expanded OEF of degree 5.

Web of Science

Scopus

researchmap

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

As the computer architecture technology evolves, communication protocols have been demanded not only having reliable security but also flexible functionality. Advanced cryptography has been expected as a new generation cryptography which suffices such the requirements. A pairing is one of the key technologies of the cryptography and the pairing has been known as having a substantial amount of construction parameters. Recently, the elliptic curve with embedding degree 14 is evaluated as one of the efficient curves for pairing. In the paper, we implement an optimal ate pairing on the elliptic curve by applying several variants of multiplication algorithms of extension field of degree 7 on multiple devices. The best multiplication algorithm among the candidates is derived. Besides, for efficient calculations, we propose a pseudo 7-sparse algorithm and a fast calculation method of final exponentiation. As a result, we discover the proper multiplication algorithm bases on the rate of addition and multiplications on several different computer platforms. Our proposed pseudo 7-sparse algorithm is approximately 1.54% faster than a regular algorithm on almost all tested platforms. Eventually, for the total execution time of pairing we record 9.33ms on Corei5-9500.

Web of Science

Scopus

researchmap

Language：English   Publishing type：Research paper (scientific journal)   Publisher：TAYLOR & FRANCIS INC  

One of the most preferred encryption techniques for data sharing in cloud environment is Ciphertext-Policy Attribute Based Encryption (CP-ABE). An efficient File Hierarchy CP-ABE (FH-CP-ABE) scheme using an integrated access structure was proposed by Wang and colleagues. Their working construction was based on symmetric pairing. In this article, we propose an efficient Asymmetric File Hierarchy Ciphertext-Policy Attribute Based Encryption (AFH-CP-ABE) which is based on an asymmetric pairing construction using denominator elimination and twist mapping. We apply this optimized Tate pairing in the proposed AFH-CP-ABE to find out its computational costs for encryption and decryption using gmp 6.0.0 library and then compared with existing schemes.

DOI： 10.1080/19361610.2019.1649534

Web of Science

Scopus

researchmap

Language：English   Publishing type：Research paper (scientific journal)   Publisher：TAYLOR & FRANCIS INC  

Secured information transmission is one of the critical challenges in Wireless Body Area Networks (WBAN). The main motivation of this paper is secure transmission of highly sensitive patient information with reduced computation cost and storage requirements. In this paper, we integrate Ciphertext-Policy Attribute Based Encryption (CPABE) with Constant Size Ciphertext (CPABE-CSC) and Blowfish algorithm for secure transmission of sensitive patient information. The experimental results show the efficiency of the proposed scheme in terms of computation cost and ciphertext size when compared with existing schemes.

DOI： 10.1080/19361610.2019.1669987

Web of Science

Scopus

researchmap

Publishing type：Research paper (scientific journal)   Publisher：IJNC Editorial Committee  

DOI： 10.15803/ijnc.10.2_144

researchmap

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

In recent years, some lightweight cipher algorithms for IoT devices have been proposed. These algorithms can be applied to a variety of IoT devices without occupying too much memory and power consumption, and compared to traditional ciphers, such as AES, these algorithms have higher efficiency. The Speck algorithm is a lightweight block cipher, proposed by the NSA in June 2013, and it is specifically optimized for IoT microcontrollers. A few previous studies have shown that the Speck algorithm can be attacked through power analysis. Based on Arduino Uno as the implementation platform of the Speck 128/128 algorithm, in this paper, we propose a method to attack the Speck 128/128 algorithm. Our experiment results have shown that when the attack point in the last round of Speck 128/128 XOR operation, the round key can be successfully recovered by the Correlation Power Analysis attack.

DOI： 10.1109/CANDARW51189.2020.00076

Scopus

researchmap

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

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

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 are suggested for the pairings at the various security levels. The BLS family has specific polynomial parameters in terms of an integer x0 for generating the pairing-friendly elliptic curves with various embedding degrees k, which are called BLS curves. The important fact is that one can find congruence classes of x0 which give rise to the BLS curves having a benefit of an efficient performing field arithmetics. However, except for the BLS curves with k = 24, such the practical usable congruence classes of x0 have not been provided at this time. In this manuscript, the authors provide the specific congruence classes generating the practical subfamilies of the BLS curves with k = 2i • 3 and 3j with arbitrary positive integers i and j.

DOI： 10.1109/CANDARW51189.2020.00073

Scopus

researchmap

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

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

Pseudo random binary sequences have been widely used in cryptographic applications due to their speedy construction, reproducibility and characteristics like true random sequence. Realization of modern cryptographic application and mathematical tools is inconceivable without random sequences. Previously, we proposed an alternative trace map function for generation of a pseudo random binary sequence that has long period, good correlation characteristics and high linear complexity that are attractive for security applications. However, it was found that the distribution of bits in sequence is not uniform which may lead to failure in randomness. In this paper, we propose a uniformization method using power of primitive root to improve uniformity of bit distribution in the sequence. Sequence of different lengths is generated using proposed sequence to verify the efficiency of the proposed uniformization method. By analyzing the bit distribution of generated sequences for different length of patterns, we show that the proposal achieves bit uniformity while maintaining randomness of the sequence.

DOI： 10.1109/CANDARW51189.2020.00066

Scopus

researchmap

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

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

Pollard’s rho method is one of the most efficient methods for solving elliptic curve discrete logarithm problem (ECDLP) in elliptic curve cryptography. Pollard’s rho method with skew Frobenius mapping can solve ECDLP over a Barreto-Naehrig (BN) curve efficiently. Pollard’s rho method may result in an unsolvable cycle called a fruitless cycle. When a random walk pass results in a fruitless cycle, the random walk pass must restart with a different starting point. However, an effective method for eliminating the fruitless cycle has been not proposed yet. This paper proposes a method for eliminating the fruitless cycle in Pollard’s rho method with skew Frobenius mapping. In addition, the authors apply the proposed method to a BN curve with 17-bit parameters and confirm the effectiveness.

DOI： 10.1109/CANDAR51075.2020.00029

Scopus

researchmap

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

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

We have been studying a design of the pseudo-random number generator by generated sequences with the logistic map over integers. Although it has already been presented that such properties of the generation sequences are good, the range of control parameters that satisfy the properties is not enough wide. To improve this problem, Wang et al. proposed the piecewise logistic map. It is method for increasing the range of control parameters that can generate good sequences for the pseudorandom number generator. However, it is not suitable for computer implementation, because it is defined over real numbers. In this paper, we will propose a piecewise logistic map over integers that uses an integer arithmetic and computers can calculate the map correctly. We will also show some results of numerical experiments for the sequences generated from this map.

Scopus

researchmap

Other Link： https://dblp.uni-trier.de/conf/isita/2020

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

In this paper, the authors propose an algorithm to generate a sequence of bits in parallel to enhance the generating performance of the Blum-Micali method which is for constructing a pseudorandom number generator. More precisely, since the classical definition needs to refer the previous state to generate the next bit, we modify the generation steps in an alternative way by introducing the feature of the Gauss periods. It gives us a unique representation of elements as if a primitive element generates those elements as the powers and this mechanism realizes the parallel algorithm. As a result, the generator achieves to mimic the main concept of the Blum-Micali method in parallel and it is thought to be secure if the discrete logarithm problem is hard to solve.

Scopus

researchmap

Other Link： https://dblp.uni-trier.de/conf/isita/2020

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

We show some properties of binary sequences located in Hadamard matrices of order 2〈n〉 represented by Sylvester's matrices. The Kronecker product is a method for expanding Hadamard matrix, and a set of sequences with orthogonal properties is extended by concatenation or interleaving. From these expanding methods and properties related to constructions, we discuss the increase of the set of orthogonal sequences. Finally, we show the characteristic polynomials of binary sequences located in Hadamard matrices of order 2〈n〉.

Scopus

researchmap

Other Link： https://dblp.uni-trier.de/conf/isita/2020

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：SPRINGER INTERNATIONAL PUBLISHING AG  

The existence of equivalent keys for a secret key is an inseparable topic in cryptography. Especially for pseudorandom number generators for cryptographic applications, equivalent keys are not only a specific pair of keys that generate the same sequence but includes the one that gives simply the phase-shifted sequence. In this paper, the authors especially focus on a kind of nonlinear filter generator (NLFG) defined by using a power residue calculation over an odd characteristic. Generally speaking, an evaluation of NLFGs has conducted by the randomness of the sequence itself and the security of keys. Though the previous evaluations of the randomness of the target NLFG are studied and proven theoretically, the security aspects as a cryptosystem still have not discussed. Therefore, this paper would like to begin a new security evaluation by focusing on the existence of equivalent keys for the NLFG. As a result, the authors first show that sequences generated by the NLFG are classified into several types of sequences depending on the choice of a certain parameter. Owing to this, it is found that there exist equivalent keys concerning the parameter corresponding to the above. At the same time, we show that the equivalent keys are possible to eliminate by giving the restriction on the corresponding parameter adequately.

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

Web of Science

Scopus

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/iwsec/iwsec2020.html#KoderaTKNU20

Language：English   Publishing type：Research paper (scientific journal)   Publisher：IJNC Editorial Committee  

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

Other Link： https://dblp.uni-trier.de/db/journals/ijnc/ijnc10.html#NanjoSKN20

Language：English   Publishing type：Research paper (scientific journal)   Publisher：The Institute of Electronics, Information and Communication Engineers  

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

DOI： 10.1587/transfun.2020TAL0002

Web of Science

Scopus

CiNii Article

researchmap

Other Link： https://dblp.uni-trier.de/db/journals/ieiceta/ieiceta103.html#NanjoSKN20

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

Machine learning (ML) technology has been getting popular in many applications where ML purposes to analyze or classify data, or predicting the phenomenon follows from the previous conditions, for example. However, the spread of ML technologies allows an attacker to use them into the attack for the sake of sniffing secret information. Since the randomness has been used for an inseparable part of the cryptographic applications to ensure the security, the resistance of a random sequence against analysis based on the ML technologies have to be required. The authors anticipate having the mutual relationship between the classical properties of the randomness, linear complexity (LC) in particular, and the structure of a neural network (NN), which is a class of ML. In this research, the authors find that the strength of each connection between nodes in the NN is relevant to the linear recurrence relation of the target sequence by observing parameters after complete learning. In other words, the difficulty of predicting the next bits from a given sequence would be discussed based on the LC of a sequence in most cases. The experimental results are introduced to clarify the black box in this research.

DOI： 10.1109/CANDARW.2019.00074

Web of Science

Scopus

researchmap

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

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

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

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

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

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

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

DOI： 10.1109/ITC-CSCC.2019.8793409

Web of Science

Scopus

researchmap

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

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

DOI： 10.1109/ICCE-TW46550.2019.8992033

Web of Science

Scopus

researchmap

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

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

DOI： 10.1109/ICCE-TW46550.2019.8992029

Web of Science

Scopus

researchmap

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

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

DOI： 10.1109/ICCE-TW46550.2019.8991711

Web of Science

Scopus

researchmap

Publishing type：Research paper (international conference proceedings)  

© 2018 IEICE. In this research, the choice of the parameter of the Montgomery trick in Pollard's Rho method to solve the elliptic curve discrete logarithm problem for Barreto-Naehrig (BN) curves is shown. The average number of generated rational points per unit time is chosen as a measure of the effectiveness of the choice of the parameter of the Montgomery trick. The results are derived from a sufficient number of experiments with several BN curves.

DOI： 10.23919/ISITA.2018.8664242

Scopus

researchmap

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

© 2018 IEICE. In this research, the choice of the parameter for a method to generate distinguished rational points in Pollard's Rho method to solve the elliptic curve discrete logarithm problem for Barreto-Naehrig (BN) curves is shown. The structures of random walk paths are confirmed by experiments for several BN curves. From the results, the authors clarify the conditions in which the Rho method does not stop during an attack, and the authors also show an indication for the choice of the parameter for the method to generate distinguished points with large bits of ECDLP.

DOI： 10.23919/ISITA.2018.8664405

Web of Science

Scopus

researchmap

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

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

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

DOI： 10.11309/jssst.36.30

Scopus

CiNii Article

CiNii Books

researchmap

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

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

DOI： 10.1109/IWSDA46143.2019.8966096

Web of Science

Scopus

researchmap

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

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

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

DOI： 10.1109/CANDAR.2019.00027

Web of Science

Scopus

researchmap

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

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

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

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

Scopus

researchmap

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

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

DOI： 10.25046/aj040246

Scopus

researchmap

Publishing type：Research paper (international conference proceedings)  

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

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

Scopus

researchmap

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

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

DOI： 10.1109/CANDARW.2019.00068

Web of Science

Scopus

researchmap

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

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

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

DOI： 10.1109/CANDAR.2019.00040

Web of Science

Scopus

researchmap

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

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

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

DOI： 10.1109/CANDAR.2019.00037

Web of Science

Scopus

researchmap

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

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

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

DOI： 10.1109/CANDAR.2019.00030

Web of Science

Scopus

researchmap

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

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

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

DOI： 10.1109/IWSDA46143.2019.8966109

Web of Science

Scopus

researchmap

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

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

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

DOI： 10.1109/CANDARW.2019.00080

Web of Science

Scopus

researchmap

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

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

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

DOI： 10.1109/CANDARW.2019.00076

Web of Science

Scopus

researchmap

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

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

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

DOI： 10.1109/SII.2019.8700344

Web of Science

Scopus

researchmap

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

Publishing type：Research paper (scientific journal)  

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

Language：English   Publishing type：Research paper (scientific journal)   Publisher：Scientific Research Publishing, Inc.  

DOI： 10.4236/jis.2019.103008

researchmap

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

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

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

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

Publishing type：Research paper (international conference proceedings)  

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

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

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

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

Language：English   Publishing type：Research paper (scientific journal)   Publisher：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

Other Link： https://dblp.uni-trier.de/db/journals/ieicet/ieicet101a.html#UedaIKKAN18

Publishing type：Research paper (international conference proceedings)  

© 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

Language：English   Publishing type：Research paper (scientific journal)   Publisher：IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

The authors have proposed a multi-value sequence called an NTU sequence which is generated by a trace function and the Legendre symbol over a finite field. Most of the properties for NTU sequence such as period, linear complexity, autocorrelation, and cross-correlation have been theoretically shown in our previous work. However, the distribution of digit patterns, which is one of the most important features for security applications, has not been shown yet. In this paper, the distribution has been formulated with a theoretic proof by focusing on the number of 0's contained in the digit pattern.

DOI： 10.1587/transfun.E101.A.1525

Web of Science

Scopus

researchmap

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

Publishing type：Research paper (scientific journal)  

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

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

The recent development of IoT technologies and cloud storages, many types of information including private information have been gradually outsourced. For such a situation, new convenient functionalities such as arithmetic and keyword search on ciphertexts are required to allow users to retrieve information without leaking any information. Especially, searchable encryptions have been paid much attention to realize a keyword search on an encrypted domain. In addition, an architecture of searchable symmetric encryption (SSE) is a suitable and efficient solution for data outsourcing. In this paper, we focus on an SSE scheme which employs a secure index for searching a keyword with optimal search time. In the conventional studies, it has been widely considered that the scheme searches whether a queried keyword is contained in encrypted documents. On the other hand, we additionally take into account the location of a queried keyword in documents by targeting a matrix-type data format. It enables a manager to search personal information listed per line or column in CSV-like format data.

DOI： 10.1109/CANDARW.2018.00061

Web of Science

Scopus

researchmap

Publishing type：Research paper (scientific journal)  

researchmap

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

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

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

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

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

Language：English   Publisher：IEEE  

In recent years, with the increase in physical distribution volume, unmanned transportation robots are expected as an alternative means of transporting baggage in factories and warehouses. The development of a control system for cooperative transportation by multiple robots is important when the objects to be transported are long and exceed the size and the weight limit. From this, we develop a control system for cooperative transportation using two robots independently driven by two wheels. In this paper, a communication system between two mobile robots and a host PC is constructed by using ROS, and a sub-goal is generated to each robot to realize a cooperative running with two robots. The effectiveness of the proposed method is verified through an experiment that the controlled point of an object is subject to a movement along the square of 1 m.

DOI： 10.1109/SMC.2018.00296

Web of Science

Scopus

CiNii Article

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/smc/smc2018.html#MorishitaMNW18

Publishing type：Research paper (scientific journal)  

DOI： 10.1587/transfun.E101.A.1235

researchmap

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

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

DOI： 10.1109/CANDARW.2018.00087

researchmap

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

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

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

Publishing type：Research paper (scientific journal)   Publisher：MECS Publisher  

DOI： 10.5815/ijcnis.2017.09.07

researchmap

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

Publishing type：Research paper (international conference proceedings)  

© 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

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

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

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

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

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

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

This paper shows some of fundamental properties of Z4 sequences of combining each element of a preferred pair of binary m-sequences by using the Gray code mapping. The distribution of elements {0,1,2,3} within one period can be exactly derived from auto/cross-correlation values of Gold sequences or Gold-like sequences. In addition, this paper shows properties such that the Z4 sequences have near-optimum correlation properties.

DOI： 10.1109/IWSDA.2017.8097082

Web of Science

Scopus

researchmap

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

The authors have proposed an approach for generating a pseudo random binary sequence by using primitive polynomial, trace function, and Legendre symbol over the proper sub extension field. There are many uses of pseudo random binary sequence in security applications. The linear complexity of a sequence is considered as the most important property to be analyzed in these types of applications. In this paper, the authors have restricted the discussion on the linear complexity and linear complexity profile properties of the proposed sequence based on some experimental results. According to the results, the proposed sequence always holds a maximum value of the linear complexity.

DOI： 10.1109/IWSDA.2017.8095741

Web of Science

Scopus

researchmap

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

Pseudorandom number generators are required to generate pseudorandom numbers which have not only good statistical properties but also unpredictability in cryptography. A geometric sequence is a sequence given by applying a nonlinear feedforward function to an m-sequence. Nogami, Tada and Uehara proposed a geometric sequence whose nonlinear feedforward function is given by the Legendre symbol, and showed the period, periodic autocorrelation and linear complexity of the sequence. Furthermore, Nogami et al. proposed a generalization of the sequence (this sequence is referred to as the generalized NTU sequence), and showed the period and periodic autocorrelation. In this paper, we investigate the linear complexity of the generalized NTU sequences. Under some conditions, we can ensure that generalized NTU sequences have large linear complexity from the results on linear complexity of Sidel'nikov sequences.

DOI： 10.1109/IWSDA.2017.8095739

Web of Science

Scopus

researchmap

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

Trace function is a well known index of finite field theory and practically, it is used for some security applications. However, present trace calculation with binary method is far from the practice on an IoT device. This paper considers an efficient trace calculation without vector multiplication by focusing on the matrix representation and the linearity of trace function. By using pre-computation, a trace calculation is executed by m times multiplication and the memory consumption is 4m bytes. This paper especially uses a pseudorandom generator called NTU sequence to show the efficiency because it has paid much attention as a random generator for security applications. When considering 128-bit length of periodic sequence with NTU sequence for security applications, parameters will be p = 7 and m = 50. From the experimental results, a trace calculation with them will be executed within 5[μs], and the memory consumption is 200 bytes which is 0:625% of the storage in Arduino Uno. Therefore, this work contributes to implementing an efficient trace calculation on an IoT device with low memory consumption.

DOI： 10.1109/CANDAR.2017.86

Web of Science

Scopus

researchmap

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

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

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

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

Publishing type：Research paper (scientific journal)  

researchmap

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

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

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

Publishing type：Research paper (international conference proceedings)  

© 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

Publishing type：Research paper (scientific journal)  

researchmap

Other Link： https://dblp.uni-trier.de/db/journals/corr/corr1709.html#abs-1709-05163

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

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

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

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

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

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

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

In our previous work, pseudo random binary sequence generated by using trace function, Legendre symbol and mapping function has been researched. Our previous sequence generated by applying primitive polynomial over odd characteristics field Fp, trace function, and Legendre symbol. The previous sequence contained only 0 and 1 values. It has some interesting features such as period, periodic autocorrelation, and linear complexity. However, it has a major drawback also that is the appearance of 0 and 1 are inconsistent in each period. For this reason, in the periodic autocorrelation graph except the peak values other parts always consists some values and that is not 0. When we apply this type of binary sequence in any security applications, it will lead some security vulnerabilities. In this paper, the authors have proposed a new approach to generate pseudo random signed binary sequence. An important point about our proposed sequence is, it overcomes the drawback of our previous work. Our proposed sequence includes 0,1, and -1 values. Its features, such as the period and periodic autocorrelation are also explained in this paper. According to the results, this has interesting feature such as the appearance of 0, 1 and - 1 are identical in each period.

Web of Science

Scopus

researchmap

Other Link： http://dblp.uni-trier.de/db/conf/isita/isita2016.html#conf/isita/ArshadNOIUMT16

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

In this paper, the authors have proposed a new approach for generating multi-value sequence by utilizing primitive element, trace function, and k-th power residue symbol over odd characteristic field. Let p be an odd prime and Fp be an odd characteristic prime field, m be the degree of the primitive polynomial f(x), and k be a prime factor of p - 1. In details, the procedure for generating multi-value sequence is as follows: primitive polynomial f(x) generates maximum length vector sequence, then trace function Tr(·) maps an element of extension field Fpm to an element of prime field Fp, next non-zero scalar A € Fp is added to the trace value, and finally k-th power residue symbol is utilized to map the scalars into (k + 1) values multi-value sequence. In this method, a certain mapping function Mk(·) is utilized during the autocorrelation calculation. Hence, our proposed multi-value sequence has some parameters such as p, m, k, and A. This paper discusses the period, autocorrelation, and cross-correlation properties of proposed multi-value sequence based on some experimental results.

DOI： 10.1109/CANDAR.2016.0109

Web of Science

Scopus

researchmap

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

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

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

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

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

Other Link： https://dblp.uni-trier.de/db/conf/iwci/iwci2016.html#AkhterN16

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

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：SPRINGER-VERLAG BERLIN  

This paper proposes a compact and efficient GF(28) inversion circuit design based on a combination of non-redundant and redundant Galois Field (GF) arithmetic. The proposed design utilizes redundant GF representations, called Polynomial Ring Representation (PRR) and Redundantly Represented Basis (RRB), to implement GF(28) inversion using a tower field GF((24)2). In addition to the redundant representations, we introduce a specific normal basis that makes it possible to map the former components for the 16th and 17th powers of input onto logic gates in an efficient manner. The latter components for GF(24) inversion and GF(24) multiplication are then implemented by PRR and RRB, respectively. The flexibility of the redundant representations provides efficient mappings from/to the GF(28). This paper also evaluates the efficacy of the proposed circuit by means of gate counts and logic synthesis with a 65 nm CMOS standard cell library and comparisons with conventional circuits, including those with tower fields GF(((22)2)2). Consequently, we show that the proposed circuit achieves approximately 40% higher efficiency in terms of area-time product than the conventional best GF(((22)2)2) circuit excluding isomorphic mappings. We also demonstrate that the proposed circuit achieves the best efficiency (i. e., area-time product) for an AES encryption S-Box circuit including isomorphic mappings.

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

Web of Science

Scopus

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/ches/ches2015.html#UenoHSNA15

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

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

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

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

Web of Science

Scopus

researchmap

Publishing type：Research paper (scientific journal)  

researchmap

Other Link： https://dblp.uni-trier.de/db/journals/iacr/iacr2015.html#Seo0NCK15a

Publishing type：Research paper (scientific journal)  

researchmap

Other Link： https://dblp.uni-trier.de/db/journals/iacr/iacr2015.html#Seo0NCK15

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

Scopus

researchmap

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

Publishing type：Research paper (scientific journal)  

researchmap

Other Link： https://dblp.uni-trier.de/db/journals/iacr/iacr2015.html#SeoC0NPCK15

Publishing type：Research paper (scientific journal)  

researchmap

Other Link： https://dblp.uni-trier.de/db/journals/iacr/iacr2015.html#UenoHSNA15

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

Web of Science

Scopus

researchmap

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

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

Web of Science

Scopus

researchmap

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

Web of Science

Scopus

researchmap

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

Web of Science

Scopus

researchmap

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

Scopus

researchmap

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

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

Web of Science

Scopus

researchmap

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

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

Web of Science

Scopus

researchmap

Publishing type：Research paper (scientific journal)  

researchmap

Other Link： https://dblp.uni-trier.de/db/journals/corr/corr1510.html#TsuchiyaN15

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.

Scopus

researchmap

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.

Web of Science

researchmap

Language：Japanese   Publisher：The Japan Institute of Electronics Packaging  

DOI： 10.11486/ejisso.28.0_63

CiNii Article

researchmap

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

Web of Science

researchmap

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

Scopus

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/icc/icc2011.html#IzutaNM11

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.

Web of Science

researchmap

Publishing type：Research paper (scientific journal)  

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

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

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

Language：English   Publisher：Information and Media Technologies Editorial Board  

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

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

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

This paper shows an improvement of Miller's algorithm so as to be effcient 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 ef.cient than ordinary Miller's algorithm. ©2009 IEEE.

DOI： 10.1109/ISCE.2009.5156956

Scopus

researchmap

Language：English   Publishing type：Research paper (scientific journal)   Publisher：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

Language：Japanese   Publisher：The Institute of Image Information and Television Engineers  

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 difference between PT-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.

DOI： 10.11485/itetr.25.83.0_49

CiNii Article

CiNii Books

researchmap

J-GLOBAL

researchmap

Language：Japanese   Publisher：電子情報通信学会  

CiNii Article

CiNii Books

researchmap

Other Link： http://id.ndl.go.jp/bib/030130100

Language：Japanese   Publisher：電子情報通信学会  

CiNii Article

CiNii Books

researchmap

Other Link： http://id.ndl.go.jp/bib/030130117

Language：English  

CiNii Article

researchmap

Language：Japanese  

CiNii Article

researchmap

Language：Japanese  

CiNii Article

researchmap

Language：English   Publisher：電子情報通信学会  

CiNii Article

CiNii Books

researchmap

Language：English   Publisher：電子情報通信学会  

CiNii Article

researchmap

Language：English   Publisher：電子情報通信学会  

CiNii Article

researchmap

Language：English   Publisher：電子情報通信学会  

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：一般社団法人 電気学会  

IoT・AI時代のセキュリティ

現代ICT社会は，インターネットを仲介して様々な情報がクラウドサーバなどに蓄積され，それをAIが解析して自動的に処理を行うという時代に入ってきている。例えば自

DOI： 10.1541/ieejjournal.139.313

CiNii Article

researchmap

Language：Japanese   Publisher：電子情報通信学会  

CiNii Article

CiNii Books

researchmap

Other Link： http://id.ndl.go.jp/bib/029631007

Language：Japanese   Publisher：電子情報通信学会  

CiNii Article

CiNii Books

researchmap

Other Link： http://id.ndl.go.jp/bib/029633004

Language：Japanese   Publisher：電子情報通信学会  

CiNii Article

CiNii Books

researchmap

Other Link： http://id.ndl.go.jp/bib/029633374

Language：Japanese   Publisher：電子情報通信学会  

CiNii Article

CiNii Books

researchmap

Other Link： http://id.ndl.go.jp/bib/029631051

Language：Japanese   Publisher：電子情報通信学会  

CiNii Article

CiNii Books

researchmap

Other Link： http://id.ndl.go.jp/bib/029633293

J-GLOBAL

researchmap

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

In the IoT era when a device is connected via the Internet, we can enjoy a great deal of convenience with the use of such devices, but a large number of users are not concerned about the attack from a third party. It is also meaningful for the user to have such a consciousness, but the person providing devices needs more specialized knowledge and awareness of the security. For such demands, a special education program called enPiT is held to provide an opportunity for undergraduate students to learn about cutting-edge information technologies and aims to cultivate human resources who have acquired the ability to solve specific problems in society. In this paper, we introduce the contents of \enPiT-Security advanced PBL exercise G" held in Okayama University and describe the helpfulness of the exercise and room for improvement based on the students' comments.

DOI： 10.11309/jssst.36.95

Scopus

CiNii Article

J-GLOBAL

researchmap

Language：English  

CiNii Article

researchmap

Language：English  

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：電子情報通信学会  

CiNii Article

CiNii Books

researchmap

Language：English   Publisher：EJournal Publishing  

DOI： 10.18178/ijiee.2018.8.1.685

researchmap

Publisher：EJournal Publishing  

DOI： 10.18178/ijiee.2018.8.1.685

researchmap

Language：English  

CiNii Article

CiNii Books

researchmap

Language：English  

researchmap

Language：English  

researchmap

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

Scopus

researchmap

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

Scopus

researchmap

researchmap

researchmap

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

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

J-GLOBAL

researchmap

J-GLOBAL

researchmap

J-GLOBAL

researchmap

Language：English   Publisher：Institute of Electronics, Information and Communication, Engineers, IEICE  

A pseudorandom number generator is widely used in cryptography. A cryptographic pseudorandom number generator is required to generate pseudorandom numbers which have good statistical properties as well as unpredictability. An m-sequence is a linear feedback shift register sequence with maximal period over a finite field. M-sequences have good statistical properties, however we must nonlinearize m-sequences for cryptographic purposes. A geometric sequence is a binary sequence given by applying a nonlinear feedforward function to an m-sequence. Nogami, Tada and Uehara proposed a geometric sequence whose nonlinear feedforward function is given by the Legendre symbol. They showed the geometric sequences have good properties for the period, periodic autocorrelation and linear complexity. However, the geometric sequences do not have the balance property. In this paper, we introduce geometric sequences of two types and show some properties of interleaved sequences of the geometric sequences of two types. These interleaved sequences have the balance property and double the period of the geometric sequences by the interleaved structure. Moreover, we show correlation properties and linear complexity of the interleaved sequences. A key of our observation is that the second type geometric sequence is the complement of the left shift of the first type geometric sequence by half-period positions.

DOI： 10.1587/transfun.E100.A.2720

Web of Science

Scopus

arXiv

researchmap

Other Link： https://dblp.uni-trier.de/db/journals/ieicet/ieicet100a.html#TsuchiyaNU17

Language：Japanese  

CiNii Article

CiNii Books

researchmap

Language：English  

CiNii Article

researchmap

Authorship：Lead author   Language：English   Publisher：Institute of Electronics, Information and Communication, Engineers, IEICE  

Pseudorandom number generators have been widely used in Monte Carlo methods, communication systems, cryptography and so on. For cryptographic applications, pseudorandom number generators are required to generate sequences which have good statistical properties, long period and unpredictability. ADickson generator is a nonlinear congruential generator whose recurrence function is the Dickson polynomial. Aly and Winterhof obtained a lower bound on the linear complexity profile of a Dickson generator. Moreover Vasiga and Shallit studied the state diagram given by the Dickson polynomial of degree two. However, they do not specify sets of initial values which generate a long period sequence. In this paper, we show conditions for parameters and initial values to generate long period sequences, and asymptotic properties for periods by numerical experiments. We specify sets of initial values which generate a long period sequence. For suitable parameters, every element of this set occurs exactly once as a component of generating sequence in one period. In order to obtain sets of initial values, we consider a logistic generator proposed by Miyazaki, Araki, Uehara and Nogami, which is obtained from a Dickson generator of degree two with a linear transformation. Moreover, we remark on the linear complexity profile of the logistic generator. The sets of initial values are described by values of the Legendre symbol. The main idea is to introduce a structure of a hyperbola to the sets of initial values. Our results ensure that generating sequences of Dickson generator of degree two have long period. As a consequence, the Dickson generator of degree two has some good properties for cryptographic applications.

DOI： 10.1587/transfun.E100.A.1816

Web of Science

Scopus

arXiv

researchmap

Other Link： https://dblp.uni-trier.de/db/journals/ieicet/ieicet100a.html#TsuchiyaN17

Language：English   Publisher：IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

This paper proposes a new approach for generating pseudo random multi-valued (including binary-valued) sequences. The approach uses a primitive polynomial over an odd characteristic prime field F-p, where p is an odd prime number. Then, for the maximum length sequence of vectors generated by the primitive polynomial, the trace function is used for mapping these vectors to scalars as elements in the prime field. Power residue symbol (Legendre symbol in binary case) is applied to translate the scalars to k-value scalars, where k is a prime factor of p-1. Finally, a pseudo random k-value sequence is obtained. Some important properties of the resulting multi-valued sequences are shown, such as their period, autocorrelation, and linear complexity together with their proofs and small examples.

DOI： 10.1587/transfun.E100.A.922

Web of Science

Scopus

researchmap

Other Link： https://dblp.uni-trier.de/db/journals/ieicet/ieicet100a.html#BegumNUM17

Language：English  

Implementation of faster pairing calculation is the basis of efficient pairing-based cryptographic protocol implementation. Generally, pairing is a costly operation carried out over the extension field of degree k ≥ 12. But the twist property of the pairing friendly curve allows us to calculate pairing over the sub-field twisted curve, where the extension degree becomes k/d and twist degree d = 2, 3, 4, 6. The calculation cost is reduced substantially by twisting but it makes the discrete logarithm problem easier if the curve parameters are not carefully chosen. Therefore, this paper considers the most recent parameters setting presented by Barbulescu and Duquesne [1] for pairing-based cryptography; that are secure enough for 128- bit security level; to explicitly show the quartic twist (d = 6) and sextic twist (d = 4) mapping between the isomorphic rational point groups for KSS (Kachisa-Schaefer-Scott) curve of embedding degree k = 16 and k = 18, receptively. This paper also evaluates the performance enhancement of the obtained twisted mapping by comparing the elliptic curve scalar multiplications.

DOI： 10.6109/jicce.2017.15.2.97

Scopus

researchmap

Authorship：Lead author   Language：English   Publisher：IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

Scalar multiplication over higher degree rational point groups is often regarded as the bottleneck for faster pairing based cryp-tography. This paper has presented a skew Frobenius mapping technique in the sub-field isomorphic sextic twisted curve of Kachisa-Schaefer-Scott (KSS) pairing friendly curve of embedding degree 18 in the context of Ate based pairing. Utilizing the skew Frobenius map along with multi-scalar multiplication procedure, an efficient scalar multiplication method for KSS curve is proposed in the paper. In addition to the theoretic proposal, this paper has also presented a comparative simulation of the proposed approach with plain binary method, sliding window method and non-adjacent form (NAF) for scalar multiplication. The simulation shows that the proposed method is about 60 times faster than plain implementation of other compared methods.

DOI： 10.1587/transfun.E100.A.1838

Web of Science

Scopus

researchmap

J-GLOBAL

researchmap

J-GLOBAL

researchmap

J-GLOBAL

researchmap

J-GLOBAL

researchmap

Language：English   Publisher：WILEY-HINDAWI  

In this paper, we show efficient implementations of binary field multiplication over ARMv8. We exploit an advanced 64-bit polynomial multiplication (PMULL) supported by ARMv8 and conduct multiple levels of asymptotically faster Karatsuba multiplication for polynomial multiplication. Finally, our method completed binary field multiplication within 57 and 153 clock cycles for B-251 and B-571 cases, respectively. Proposed method improves the speed-performance by a factor of 4.5 times than previous techniques on same target platform. Copyright (c) 2016 John Wiley & Sons, Ltd.

DOI： 10.1002/sec.1462

Web of Science

Scopus

researchmap

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

Scopus

researchmap

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

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

Authorship：Lead author   Language：English   Publisher：IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

Pairing-based cryptography has realized a lot of innovative cryptographic applications such as attribute-based cryptography and semi homomorphic encryption. Pairing is a bilinear map constructed on a torsion group structure that is defined on a special class of elliptic curves, namely pairing-friendly curve. Pairing-friendly curves are roughly classified into supersingular and non supersingular curves. In these years, non supersingular pairing-friendly curves have been focused on from a security reason. Although non supersingular pairing-friendly curves have an ability to bridge various security levels with various parameter settings, most of software and hardware implementations tightly restrict them to achieve calculation efficiencies and avoid implementation difficulties. This paper shows an FPGA implementation that supports various parameter settings of pairings on non supersingular pairing-friendly curves for which Montgomery reduction, cyclic vector multiplication algorithm, projective coordinates, and Tate pairing have been combinatorially applied. Then, some experimental results with resource usages are shown.

DOI： 10.1587/transinf.2015ICP0018

Web of Science

Scopus

researchmap

Other Link： https://dblp.uni-trier.de/db/journals/ieicet/ieicet99d.html#NogamiKIMN16

J-GLOBAL

researchmap

J-GLOBAL

researchmap

J-GLOBAL

researchmap

J-GLOBAL

researchmap

J-GLOBAL

researchmap

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

researchmap

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

Other Link： https://dblp.uni-trier.de/db/journals/ieicet/ieicet98d.html#MiyakoshiYWFN15

Language：English   Publisher：電子情報通信学会  

CiNii Article

CiNii Books

researchmap

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

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

researchmap

Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

Quantum computer will break most of recent public key cryptosystems by Shor's algorithm. Post-quantum cryptosystem which is not broken by them has been studied. NTRU is one of the post-quantum cryptosystems proposed by Hoffstein et al. This work considers a variant of NTRU with All One Polynomial Ring based on All One Polynomial. This work applies CVMA:Cyclic Vector Multiplication Algorithm. For the security evaluation, the same approach of the original NTRU can be applied to the proposed variant.

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

Yoshida et al. have proposed the vector decomposition problem using supersingular curve whose embedding degree is 2. In order to apply the problem as a trapdoor of cryptosystem, it is necessary to speed up pairing calculations. This paper considers an efficient approach for Tate pairing with a supersingular curve on 2-dimentional extension field. This paper improves both Miller's algorithm and final exponentiation that is required for Tate pairing. In detail, one multiplication in the calculation of Miller's loop is eliminated by using twist map. This paper discusses how efficient the calculation of pairing becomes.

CiNii Article

CiNii Books

researchmap

researchmap

Language：English  

researchmap

J-GLOBAL

researchmap

J-GLOBAL

researchmap

J-GLOBAL

researchmap

J-GLOBAL

researchmap

J-GLOBAL

researchmap

J-GLOBAL

researchmap

Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

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

Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

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

Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

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

Language：English   Publisher：The Institute of Electronics, Information and Communication Engineers  

This paper introduces a fast implementation of elliptic curve scalar multiplication with an improved quadrupling in Jacobian coordinates, since one quadrupling is more efficient than two doublings for which the scalar needs to be represented in double-base chains form. For point additions, this paper applies coordinates conversion technique which can save one field multiplication in each term of point addition in Mixed coordinates. After that, some experimental results on 256 bit elliptic curve cryptography are shown.

CiNii Article

CiNii Books

researchmap

Language：Japanese  

CiNii Article

CiNii Books

researchmap

Language：English   Publisher：Springer  

According to some recent implementation reports on Ate-based pairings such as optimal ate pairing with Barreto-Naehrig curve whose embedding degree is 12, sparse multiplication accelerates Miller's loop calculation in a pairing calculation. Especially, 7-sparse multiplication is available when the implementation uses affine coordinates, where 7-sparse means that the multiplicand or multiplier has 7 zeros among 12 coefficients. This paper extends it to pseudo 8-sparse multiplication. Then, some experimental results together with theoretic calculation costs are shown in order to evaluate its efficiency. © 2014 Springer International Publishing.

DOI： 10.1007/978-3-319-04873-4_11

Scopus

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/pairing/pairing2013.html#MoriANS13

J-GLOBAL

researchmap

Language：English   Publisher：The Institute of Electronics, Information and Communication Engineers  

Let p be an odd characteristic and m be the degree of primitive polynomial f(x). Let ω be its zero, that is a primitive element in F^*_pm, then the sequence S={s_i}, s_i=Tr(w^i), i=0,1,2,… becomes a maximum length sequence, where Tr(・) is the trace function over F_p. On this fact, this paper proposes to binarize the sequence by using Legendre symbol. Then, it is shown that the obtained binary sequence has the period L=2(p^m-1)/(p-1) and a certain periodic autocorrelation. This paper also shows a small example.

CiNii Article

CiNii Books

researchmap

Language：English   Publisher：IEEE  

This paper shows an approach for reducing the size of the exponent of final exponentiation with multiplying some extra terms. In the case of Tate and Ate pairings with Barreto-Naehrig curve whose embedding degree is 12, the exponent is reduced to (p(4) - p(2) + 1)/r, where p is the characteristic of the base field and r is the order of pairing.

DOI： 10.1109/NBiS.2013.86

Web of Science

Scopus

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/nbis/nbis2013.html#KonoSN13

Language：English   Publisher：IEEE  

Let p be an odd characteristic and m be the degree of primitive polynomial f(x). Let omega be its zero, that is a primitive element in F-pm*, then the sequence S = {s(i)}, s(i) = Tr (omega(i)) for i = 0, 1, 2, ... becomes a maximum length sequence, where Tr (.) is the trace function over F-p. On this fact, this paper proposes to binarize the sequence by using Legendre symbol. It will be a class of geometric sequences but its properties such as the period and autocorrelation has not been discussed. Then, it is shown that the obtained binary sequence (geometric sequence with Legendre symbol) has the period L given by 2 (p(m) - 1)/(p-1) and a certain periodic autocorrelation. After that, this paper also shows the numbers of ones and minus ones in the proposed binary sequence per a period together with some small examples.

DOI： 10.1109/IWSDA.2013.6849054

Web of Science

Scopus

researchmap

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

J-GLOBAL

researchmap

Language：Japanese  

CiNii Article

researchmap

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

Authorship：Lead author   Language：English   Publisher：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

researchmap

Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

This paper considers an approach to obtain primitive polynomials over odd characteristic field F_p for which a variable transformation x&map;x+αx^<-1> called "self α reciprocal transform" is used, where α is a certain element in F^*_<p^<2^j>> of j<i. Self α reciprocal transforms give irreducible polynomials of degree 2^i under a certain condition to which this paper considers their primitivities. If they are not primitive polynomials over F_p, this paper also touches an efficient approach for translating them to primitive polynomials.

CiNii Article

CiNii Books

researchmap

Language：Japanese  

CiNii Article

researchmap

Language：Japanese  

CiNii Article

researchmap

Language：Japanese  

CiNii Article

researchmap

Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

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