본문 바로가기
KERD
논문KCI 등재

The roust arithmetic of finite field for fault-tolerant tate pairing with binary field

GYOYONG SOHN
장전수학회 (Jangjeon Mathematical Society)|2012.10|Advanced Studies in Contemporary Mathematics|제22권 제4호|pp. 499-505

2

조회

0

다운로드

0

인용

0

참고문헌

키워드

Tate PairingFault-TolerantRobust Codes
주제분류수학

초록

In this paper, we present a scheme for constructing strong error detection in the Tate pairing algorithm with binary eld. The methods are based upon the robust nonlinear systematic error detecting codes. We also provide not only the explicit formulas for robust eld operations on a binary extension eld but also the computational complexities behind them.

Abstract

In this paper, we present a scheme for constructing strong error detection in the Tate pairing algorithm with binary eld. The methods are based upon the robust nonlinear systematic error detecting codes. We also provide not only the explicit formulas for robust eld operations on a binary extension eld but also the computational complexities behind them.

참고문헌 (15)

  1. P. Barreto, "Ecient pairing computa- tion on supersingular abelian varieties", Des. Codes Cryptogr, 42(3), pp.239~271 (2007)
  2. G. Bertoni, "Parallel hardware Architectures for the Cryptographic Tate Pairing", Proceedings of the Third International Conference on Information Technology: New Generations (ITNG'06), pp.186~191 (2006)
  3. "Computing tate pair- ing on smartcards" (2005)[URL]
  4. D. Boneh, "Identity-Based Encryption from the Weil Pairing", Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology, 2139, pp.213~229 (2001), Springer
  5. D. Boneh, "Collusion resistant broadcast encryption with short ciphertexts and private keys, in CRYPTO 2005", LNCS, 3621, pp.258~275 (2005)
  6. J. C. Choon, "An identity-Based Signature from Gap Die-Hellman Groups, PKC 2003", LNCS, 2567, pp.18~30 (2002), Springer
  7. I. M. Duursma, "Tate pairing implementation for hyperelliptic curves y2 = xp 􀀀 x + d, In Advances in Cryptology - Asiacrypt 2003", LNCS, 2260, pp.360~363 (2003), Springer
  8. G. Gaubatz, "Robust finite field arithmetic for fault tolerant public- key cryptography", 2nd Workshop on Fault Tolerance and Diagonosis in Cryptography (FTDC), pp.196~210 (2005), Springer
  9. "ID based Cryptography and Smartcards" (2005)[URL]
  10. F. Hess, "Exponent group signature schemes and efficient identity based signature schemes based on pairing, SAC 2002", LNCS, 2595, pp.310~324 (2002)
  11. M. Karpovsky, "New class of nonlinear systematic error detecting codes", IEEE Trans. on Information Theory, 50(8), pp.1818~1820 (2004)
  12. K. Kulikowski, "Robust codes and robust, fault-tolerant architectures of the Ad-vanced Encryption Standard", Journal of systems Architecture, 53, pp.139~149 (2007)
  13. V. S. Miller, "The Weil pairing, and its efficient calculation", Journal of Cryptology, 17(4), pp.235~261 (2004)
  14. E.OzturK, "Tate Pairing with Strong Fault Resiliency", Fault Diagnosis and Tolerance in Cryptography(FDTC'07), IEEE Computer Society, pp.103~111 (2007), IEEE Press
  15. R. Ronan, "An Embedded Processor for a Pairing-Based Cryptosystem", Proceedings of the Third International Conference on Information Technology: New Generations (ITNG'06), pp.192~197 (2006)

관련 논문AI추천

Robust Finite Field Arithmetic for Fault-Tolerant Tate Pairing손교용, 이상혁, Anour F. A. Dafa-Alla장전수학회 · Proceedings of the Jangjeon Mathematical Society(장전수학회 논문집)2010 · 제13권 제1호WEAKNESSES OF THE TATE PAIRING ON GENERALIZED HESSIAN CURVESG. Y. Sohn장전수학회 · Proceedings of the Jangjeon Mathematical Society(장전수학회 논문집)2015 · 제18권 제4호The Explicit Computations of Tate Pairing in Projective Coordinates over Characteristic Three김태균, 손교용, 이상혁, 황경원장전수학회 · Proceedings of the Jangjeon Mathematical Society(장전수학회 논문집)2010 · 제13권 제1호Tate pairing computation on the divisors of hyperelliptic curves of genus 2이윤진, Eunjeong Lee대한수학회 · 대한수학회지2008 · 제45권 제4호WEAKNESS OF THE MILLER ALGORITHM ON GENERALIZED HUFF CURVESG. Y. Sohn장전수학회 · Proceedings of the Jangjeon Mathematical Society(장전수학회 논문집)2015 · 제18권 제1호Low Complexity Systolic Montgomery Multiplication over Finite Fields GF(2m)이건직(사)디지털산업정보학회 · (사)디지털산업정보학회 논문지2022 · 제18권 제1호

이 간행물의 다른 논문 (15건)

Some arithmetic properties of Bernoulli and Euler numbers김대산, S. H. LEE, 김영희, T. Kimpp. 467-480A note on the square possible sign pattern matices박진우pp. 481-485The Huygens and Wilker-type inequalities as inequalities for means of two argumentsJ´ozsef S´andorpp. 487-498Geometrical and Pellian sequencesA.G. Shannon, J.V. Leyendekkerspp. 507-508On a convergence theorem of DiniT. S. NANJUNDIAHpp. 509-510
원문 보기