Cyclic codes have attracted a lot of research interest for decades as they have efficient encoding and decoding algorithms. In this paper, for an odd prime p, the weight distributions of two classes of p-ary cyclic codes are completely determined. We show that both codes have at most five nonzero weights.
The Ate pairing has been suggested since it can be computed efficiently on ordinary elliptic curves with small values of the traces of Frobenius t. However, not all pairingfriendly elliptic curves have this property. In this paper, we generalize the Ate pairing and find a series of the variations of the Ate pairing. We show that the shortest Miller loop of the variations of the Ate pairing can possibly be as small as r 1/ϕ(k) on some special pairing-friendly curves with large values of Frobenius trace, and hence speed up the pairing computation significantly.
Abstract. For AES 128 security level there are several natural choices for pairing-friendly elliptic curves. In particular, as we will explain, one might choose curves with k = 9 or curves with k = 12. The case k = 9has not been studied in the literature, and so it is not clear how efficiently pairings can be computed in that case. In this paper, we present efficient methods for the k = 9 case, including generation of elliptic curves with the shorter Miller loop, the denominator elimination and speed up of the final exponentiation. Then we compare the performance of these choices.From the analysis, we conclude that for pairing-based cryptography at the AES 128 security level, the Barreto-Naehrig curves are the most efficient choice, and the performance of the case k = 9 is comparable to the Barreto-Naehrig curves.
Recently, linear codes constructed from defining sets have been investigated extensively and they have many applications. In this paper, for an odd prime p, we propose a class of p-ary linear codes by choosing a proper defining set. Their weight enumerators and complete weight enumerators are presented explicitly. The results show that they are linear codes with three weights and suitable for the constructions of authentication codes and secret sharing schemes.
Scalar multiplication is the most important and expensive operation in elliptic curve cryptosystems. In this paper we improve the efficiency of the Elliptic Net algorithm to compute scalar multiplication by using the equivalence of elliptic nets. The proposed method saves f our multiplications in each iteration loop. Experimental results also indicates that our algorithm will be more efficient than the previously known results in this line.
Self-pairings have found interesting applications in cryptographic schemes, such as ZSS short signatures and so on. In this paper, we present a novel method for constructing a self-pairing on supersingular elliptic curves with even embedding degrees, which we call the Ateil pairing. This pairing improves the efficiency of the self-pairing computation on supersingular curves over finite fields with large characteristic. On the basis of the ηT pairing, we propose a generalization of the Ateil pairing, which we call the Ateili pairing. The optimal Ateili pairing which has the shortest Miller loop length is faster than previously known self-pairing on supersingular elliptic curves over finite fields with small characteristic. We also propose a new self-pairing based on the Weil pairing which is faster than the previously known self-pairing on ordinary elliptic curves with embedding degree one.
Abstract. In this paper, we present a novel method for constructing a super-optimal pairing with great efficiency, which we call the omega pairing. The computation of the omega pairing requires the simple final exponentiation and short loop length in Miller's algorithm which leads to a significant improvement over the previously known techniques on certain pairing-friendly curves. Experimental results show that the omega pairing is about 22% faster and 19% faster than the super-optimal pairing proposed by Scott at security level of AES 80 bits on certain pairingfriendly curves in affine coordinate systems and projective coordinate systems, respectively.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.