• 제목/요약/키워드: Pairing

검색결과 455건 처리시간 0.017초

TATE PAIRING COMPUTATION ON THE DIVISORS OF HYPERELLIPTIC CURVES OF GENUS 2

  • Lee, Eun-Jeong;Lee, Yoon-Jin
    • 대한수학회지
    • /
    • 제45권4호
    • /
    • pp.1057-1073
    • /
    • 2008
  • We present an explicit Eta pairing approach for computing the Tate pairing on general divisors of hyperelliptic curves $H_d$ of genus 2, where $H_d\;:\;y^2+y=x^5+x^3+d$ is defined over ${\mathbb{F}}_{2^n}$ with d=0 or 1. We use the resultant for computing the Eta pairing on general divisors. Our method is very general in the sense that it can be used for general divisors, not only for degenerate divisors. In the pairing-based cryptography, the efficient pairing implementation on general divisors is significantly important because the decryption process definitely requires computing a pairing of general divisors.

Faster Ate Pairing Computation over Pairing-Friendly Ellipitic Curves Using GLV Decomposition

  • Eom, Soo Kyung;Lee, Eunjeong;Lee, Hyang-Sook
    • ETRI Journal
    • /
    • 제35권5호
    • /
    • pp.880-888
    • /
    • 2013
  • The preexisting pairings ate, $ate_i$, R-ate, and optimal-ate use q-expansion, where q is the size of the defining field for the elliptic curves. Elliptic curves with small embedding degrees only allow a few of these pairings. In such cases, efficiently computable endomorphisms can be used, as in [11] and [12]. They used the endomorphisms that have characteristic polynomials with very small coefficients, which led to some restrictions in finding various pairing-friendly curves. To construct more pairing-friendly curves, we consider ${\mu}$-expansion using the Gallant-Lambert-Vanstone (GLV) decomposition method, where ${\mu}$ is an arbitrary integer. We illustrate some pairing-friendly curves that provide more efficient pairing from the ${\mu}$-expansion than from the ate pairing. The proposed method can achieve timing results at least 20% faster than the ate pairing.

Bilinear Pairing을 이용한 효율적인 신원기반 다중 수신자 암호 기법 (Efficient Multi-receiver Identity-Based Encryption Scheme from Bilinear Pairing)

  • 정채덕;윤석봉;서철;이경현
    • 한국정보통신학회논문지
    • /
    • 제11권2호
    • /
    • pp.301-308
    • /
    • 2007
  • 본 논문에서는 Bilinear Pairing을 사용한 효율적인 신원기반 다중 수신자 암호 기법을 제 안 한다. 제안 기법은 암호화 과정에서 Pairing 연산을 필요로 하지 않으며 복호화 과정에서 단 한번의 Pairing 연산만을 요구한다. 뿐만 아니라, 제안기법을 이용하여 Subset-Cover framework 기반의 효율적인 스테이트리스 (stateless) 공개키 브로드캐스트 암호 기법을 제시한다.

기본교란 및 분수조화교란을 이용한 원형제트에서의 보텍스병합 (Vortex pairing in an axisymmetric jet using fundamental and subharmonic forcing)

  • 조성권;유정열;최해천
    • 대한기계학회논문집B
    • /
    • 제21권10호
    • /
    • pp.1350-1362
    • /
    • 1997
  • An experimental study has been performed on vortex pairing under fundamental and subharmonic forcing with controlled initial phase differences through hot-wire measurements and a multi-smoke wire flow visualization. For the range of St$_{D}$ < 0.6, vortex pairing was controlled by means of fundamental and subharmonic forcing with varying initial phase differences. Much larger mixing rate was achieved by two-frequency forcing with a proper phase difference than one frequency forcing. As St$_{D}$ decreased, vortex pairing was limited to a narrow region of the initial phase difference between two disturbances and higher amplitudes of the fundamental and its subharmonic at the nozzle exit were required for more stable pairing. As the amplitude of the subharmonic at the nozzle exit increased for fixed St$_{D}$ and fundamental amplitude, the distribution of the subharmonic mode against the variation of the initial phase difference changed from a sine function form into a cusp-like form. Thus, vortex pairing can be controlled more precisely for the former case. For St$_{D}$ > 0.6, non-pairing advection of vortices due to the improper phase difference was sometimes observed in several fundamental forcing amplitudes when only the fundamental was applied. However, when its subharmonic was added, vortex pairing readily occurred. As the initial amplitude of this subharmonic increased, the position of vortex pairing moved upstream. This was thought to be due to the fact that the variation of the initial phase difference between the fundamental and its subharmonic has less effects on vortex pairing in the region of fundamental-only vortex pairing.pairing.

제어 시스템 변수들간의 상호작용 해석 및 루프 페어링을 위한 판별기준 (A Criterion for Interaction Analysis and Loop Pairing Among Control System Variables)

  • 고재욱;윤인섭
    • 한국가스학회지
    • /
    • 제3권1호
    • /
    • pp.64-74
    • /
    • 1999
  • 정상상태 이득을 사용하여 제어 시스템 변수들간의 상호작용 해석 및 루프 페어링을 위한 판별기준을 제시하였다. 음 함수(implicit function)의 미분 관계를 고려하여 유도한 판별기준을 이용하여 조작 변수들과 제어 변수들간의 SISO pairing 및 부분적 MIMO pairing을 합리적으로 정할 수 있었으며, 기존의 기준이 해석하지 못한 대각선 정상상태 이득에 대한 대각선에 있지 않은 정상상태 이득의 영향을 효과적으로 고려할 수 있었다. 그리고 여러 경우에 대해 적용 예제들을 통하여 제시한 기준의 검증과 응용성을 알아보았다.

  • PDF

Power Analysis Attacks and Countermeasures on ${\eta}_T$ Pairing over Binary Fields

  • Kim, Tae-Hyun;Takagi, Tsuyoshi;Han, Dong-Guk;Kim, Ho-Won;Lim, Jong-In
    • ETRI Journal
    • /
    • 제30권1호
    • /
    • pp.68-80
    • /
    • 2008
  • Since many efficient algorithms for implementing pairings have been proposed such as ${\eta}_T$ pairing and the Ate pairing, pairings could be used in constraint devices such as smart cards. However, the secure implementation of pairings has not been thoroughly investigated. In this paper, we investigate the security of ${\eta}_T$ pairing over binary fields in the context of side-channel attacks. We propose efficient and secure ${\eta}_T$ pairing algorithms using randomized projective coordinate systems for computing the pairing.

  • PDF

Construction of Efficient and Secure Pairing Algorithm and Its Application

  • Choi, Doo-Ho;Han, Dong-Guk;Kim, Ho-Won
    • Journal of Communications and Networks
    • /
    • 제10권4호
    • /
    • pp.437-443
    • /
    • 2008
  • The randomized projective coordinate (RPC) method applied to a pairing computation algorithm is a good solution that provides an efficient countermeasure against side channel attacks. In this study, we investigate measures for increasing the efficiency of the RPC-based countermeasures and construct a method that provides an efficient RPC-based countermeasure against side channel attacks. We then apply our method to the well-known $\eta_T$ pairing algorithm over binary fields and obtain an RPC-based countermeasure for the $\eta_T$ pairing; our method is more efficient than the RPC method applied to the original $\eta_T$ pairing algorithm.

Pairing-Friendly Curves with Minimal Security Loss by Cheon's Algorithm

  • Park, Cheol-Min;Lee, Hyang-Sook
    • ETRI Journal
    • /
    • 제33권4호
    • /
    • pp.656-659
    • /
    • 2011
  • In ICISC 2007, Comuta and others showed that among the methods for constructing pairing-friendly curves, those using cyclotomic polynomials, that is, the Brezing-Weng method and the Freeman-Scott-Teske method, are affected by Cheon's algorithm. This paper proposes a method for searching parameters of pairing-friendly elliptic curves that induces minimal security loss by Cheon's algorithm. We also provide a sample set of parameters of BN-curves, FST-curves, and KSS-curves for pairing-based cryptography.

Bilinear Pairing을 이용한 서명 시스템 연구 동향 (A Survey of Signature System using Bilinear Pairing)

  • 유지현;원동호
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2021년도 추계학술발표대회
    • /
    • pp.232-235
    • /
    • 2021
  • 동형암호는 서버에 암호화된 데이터를 통해 연산할 수 있다는 장점으로 대용량의 데이터를 암호화하여 처리하는 시스템에 사용될 수 있어 주목된다. 동형암호의 방법 중 효율성과 실용성을 지니는 장점으로 인해 연구되고 있는 Bilinear Pairing을 사용하는 서명 및 인증 방법들은 DDH와 CDH 문제에 기반을 둔 방법으로, 많은 연구가 진행되어 왔다. 본 논문은 동형암호에서 사용되는 Bilinear Pairing의 핵심인 GDH 그룹과 타원곡선암호, Weil Pairing, SDH 문제를 기반으로 하는 서명 방식과 그룹 서명 방식, 랜덤오라클을 제외한 서명을 소개한다.