• ETRI Journal
• /
• 제30권6호
• /
• pp.818-825
• /
• 2008

This paper proposes an exponentiation method with Frobenius mappings. The main target is an exponentiation in an extension field. This idea can be applied for scalar multiplication of a rational point of an elliptic curve defined over an extension field. The proposed method is closely related to so-called interleaving exponentiation. Unlike interleaving exponentiation methods, it can carry out several exponentiations of the same base at once. This happens in some pairing-based applications. The efficiency of using Frobenius mappings for exponentiation in an extension field was well demonstrated by Avanzi and Mihailescu. Their exponentiation method efficiently decreases the number of multiplications by inversely using many Frobenius mappings. Compared to their method, although the number of multiplications needed for the proposed method increases about 20%, the number of Frobenius mappings becomes small. The proposed method is efficient for cases in which Frobenius mapping cannot be carried out quickly.

• 대한수학회지
• /
• 제54권4호
• /
• pp.1189-1208
• /
• 2017

In this paper, we study vanishing properties for $L^2$ harmonic 1-forms on a gradient shrinking Ricci soliton. We prove that if (M, g, f) is a complete oriented noncompact gradient shrinking Ricci soliton with potential function f, then there are no non-trivial $L^2$ harmonic 1-forms which are orthogonal to df. Second, we show that if the scalar curvature of the metric g is greater than or equal to (n - 2)/2, then there are no non-trivial $L^2$ harmonic 1-forms on (M, g). We also show that any multiplication of the total differential df by a function cannot be an $L^2$ harmonic 1-form unless it is trivial. Finally, we derive various integral properties involving the potential function f and $L^2$ harmonic 1-forms, and handle their applications.

• Journal of information and communication convergence engineering
• /
• 제15권3호
• /
• pp.160-164
• /
• 2017

Public key cryptography (PKC) is the basic building block for the cryptography applications such as encryption, key distribution, and digital signature scheme. Among many PKC, elliptic curve cryptography (ECC) is the most widely used in IT systems. Recently, very efficient Montgomery-Twisted-Edward (MoTE)-ECC was suggested, which supports low complexity for the finite field arithmetic, group operation, and scalar multiplication. However, we cannot directly adopt the MoTE-ECC to new PKC systems since the cryptography is not fully evaluated in terms of performance on the Internet of Things (IoT) platforms, which only supports very limited computation power, energy, and storage. In this paper, we fully evaluate the MoTE-ECC implementations on the representative IoT devices (16-bit MSP processors). The implementation is highly optimized for the target platform and compared in three different factors (ROM, RAM, and execution time). The work provides good reference results for a gradual transition from legacy ECC to MoTE-ECC on emerging IoT platforms.

• 대한수학회논문집
• /
• 제33권2호
• /
• pp.515-525
• /
• 2018

In this paper, we investigate a modified $G^2$ transform on a class of Boehmians. We prove the axioms which are necessary for establishing the $G^2$ class of Boehmians. Addition, scalar multiplication, convolution, differentiation and convergence in the derived spaces have been defined. The extended $G^2$ transform of a Boehmian is given as a one-to-one onto mapping that is continuous with respect to certain convergence in the defined spaces. The inverse problem is also discussed.

• 대한수학회논문집
• /
• 제35권1호
• /
• pp.125-136
• /
• 2020

In this article, we discuss classes of generalized functions for certain modified integral operator of Bessel-type involving Fox's H-function kernel. We employ a known differentiation formula of Fox's H-function to obtain the definition and properties of the distributional modified Bessel-type integral. Further, we derive a smoothness theorem for its kernel in a complete countably multi-normed space. On the other hand, using an appropriate class of convolution products, we derive axioms and establish spaces of modified Boehmians which are generalized distributions. On the defined spaces, we introduce addition, convolution, differentiation and scalar multiplication and further properties of the extended integral.

• 한국통신학회논문지
• /
• 제31권6C호
• /
• pp.582-588
• /
• 2006

이 논문에서는 서로 다른 원시원과 decimation을 통해서 생성한 M-진 Sidel'nikov 수열들 사이의 관계에 대해서 연구하였다. 이들의 자기상관 함수와 자기상관 분포가 유도되었으며 주어진 주기에 대해서 Sidel'nikov 수열들이 decimation과, 순회 shift, 그리고 상수 곱 하에서 동치라는 것을 증명하였다.

• Journal of Communications and Networks
• /
• 제12권1호
• /
• pp.1-4
• /
• 2010

As a countermeasure to simple power attack, the unified point addition codes for the elliptic curve cryptosystem were introduced. However, some authors proposed a different kind of power attacks to the codes. This power attack uses the observation that some internal operations in the codes behave differently for addition and doubling. In this paper, we propose a new countermeasure against such an attack. The basic idea of the new countermeasure is that, if one of the input points of the codes is transformed to an equivalent point over the underlying finite field, then the code will behave in the same manner for addition and doubling. The new countermeasure is highly efficient in that it only requires 27(n-1)/3 extra ordinary integer subtractions (in average) for the whole n-bit scalar multiplication. The timing analysis of the proposed countermeasure is also presented to confirm its SPA resistance.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2017년도 춘계학술대회
• /
• pp.188-190
• /
• 2017

투영(projective) 좌표계를 이용한 스칼라 곱셈(scalar multiplication) 연산을 지원하는 224-비트 타원곡선 암호(Elliptic Curve Cryptography; ECC) 프로세서의 설계에 대해 기술한다. 소수체 GF(p)상의 덧셈, 뺄셈, 곱셈 등의 유한체 연산을 지원하며, 연산량과 하드웨어 자원소모가 큰 나눗셈 연산을 제거함으로써 하드웨어 복잡도를 감소시켰다. 수정된 Montgomery ladder 알고리듬을 이용하여 스칼라 곱셈 연산을 제어하였으며, 단순 전력분석에 보다 안전하다. 스칼라 곱셈 연산은 최대 2,615,201 클록 사이클이 소요된다. 설계된 ECC-P224 프로세서는 Xilinx ISim을 이용한 기능검증을 하였다. Xilinx Virtex5 FPGA 디바이스 합성결과 7,078 슬라이스로 구현되었으며, 최대 79 MHz에서 동작하였다.

• Journal of Information Processing Systems
• /
• 제8권1호
• /
• pp.145-158
• /
• 2012

Hyperelliptic Curve Cryptosystem (HECC) is well suited for all kinds of embedded processor architectures, where resources such as storage, time, or power are constrained due to short operand sizes. We can construct genus 3 HECC on 54-bit finite fields in order to achieve the same security level as 160-bit ECC or 1024-bit RSA due to the algebraic structure of Hyperelliptic Curve. This paper explores various possible attacks to the discrete logarithm in the Jacobian of a Hyperelliptic Curve (HEC) and addition and doubling of the divisor using explicit formula to speed up the scalar multiplication. Our aim is to develop a cryptosystem that can sign and authenticate documents and encrypt / decrypt messages efficiently for constrained devices in wireless networks. The performance of our proposed cryptosystem is comparable with that of ECC and the security analysis shows that it can resist the major attacks in wireless networks.

• 한국지능시스템학회논문지
• /
• 제14권3호
• /
• pp.262-266
• /
• 2004

일반적으로 Lebesgue 적분에서 성립하지만 퍼지적분에서 성립되지 않는 성질이 몇 가지 있다. 그 중 하나가 선형성이다. 본 논문에서는 선형성 표현식에서 덧셈을 supremum 으로 곱셈을 infimum으로 대신한 퍼지선형성의 정의를 소개하고 구간값을 갖는 함수의 준노름 퍼지적분이 퍼지가법성을 갖는 퍼지 측도와 연속인 준 노름이 saturated 조건을 만족할 때, [Max] 조건을 만족하는 가측함수에 대해 퍼지선형성이 성립함을 보였다.