Subgroup membership testing on elliptic curves via the Tate pairing

被引:0
|
作者
Dmitrii Koshelev
机构
[1] Computer Sciences and Networks Department,
[2] Télécom Paris,undefined
来源
Journal of Cryptographic Engineering | 2023年 / 13卷
关键词
Non-prime-order elliptic curves; Power residue symbol; Subgroup membership testing; Tate pairing;
D O I
暂无
中图分类号
学科分类号
摘要
This note explains how to guarantee the membership of a point in the prime-order subgroup of an elliptic curve (over a finite field) satisfying some moderate conditions. For this purpose, we apply the Tate pairing on the curve; however, it is not required to be pairing-friendly. Whenever the cofactor is small, the new subgroup test is much more efficient than other known ones, because it needs to compute at most two n-th power residue symbols (with small n) in the basic field. More precisely, the running time of the test is (sub-)quadratic in the bit length of the field size, which is comparable with the Decaf-style technique. The test is relevant, e.g., for the zk-SNARK friendly curves Bandersnatch and Jubjub proposed by the Ethereum and Zcash research teams, respectively.
引用
收藏
页码:125 / 128
页数:3
相关论文
共 24 条
  • [1] Subgroup membership testing on elliptic curves via the Tate pairing
    Koshelev, Dmitrii
    JOURNAL OF CRYPTOGRAPHIC ENGINEERING, 2023, 13 (01) : 125 - 128
  • [2] Fast computation of tate pairing using elliptic curves with prime subgroup order of proth form
    Su Z.
    Sun C.
    Li H.
    Ma J.
    Advances in Information Sciences and Service Sciences, 2011, 3 (07): : 384 - 393
  • [3] The tate pairing via elliptic nets
    Stange, Katherine E.
    PAIRING-BASED CRYPTOGRAPHY - PAIRING 2007, 2007, 4575 : 329 - +
  • [4] Efficient Tate pairing computation for elliptic curves over binary fields
    Kwon, S
    INFORMATION SECURITY AND PRIVACY, PROCEEDINGS, 2005, 3574 : 134 - 145
  • [5] An optimal Tate pairing computation using Jacobi quartic elliptic curves
    Srinath Doss
    Roselyn Kaondera-Shava
    Journal of Combinatorial Optimization, 2018, 35 : 1086 - 1103
  • [6] An optimal Tate pairing computation using Jacobi quartic elliptic curves
    Doss, Srinath
    Kaondera-Shava, Roselyn
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2018, 35 (04) : 1086 - 1103
  • [7] Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves
    Beuchat, Jean-Luc
    Lopez-Trejo, Emmanuel
    Martinez-Ramos, Luis
    Mitsunari, Shigeo
    Rodriguez-Henriquez, Francisco
    CRYPTOLOGY AND NETWORK SECURITY, PROCEEDINGS, 2009, 5888 : 413 - +
  • [8] New formulae for Tate pairing computation on Weierstrass curves
    WANG Hong
    WANG Kun-peng
    SONG Jun-de
    TheJournalofChinaUniversitiesofPostsandTelecommunications, 2013, 20 (03) : 85 - 89
  • [9] The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems
    Frey, G
    Müller, M
    Rück, HG
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (05) : 1717 - 1719
  • [10] Tate pairing computation on the divisors of hyperelliptic curves of genus 2
    Lee, Eunjeong
    Lee, Yoonjin
    JOURNAL OF THE KOREAN MATHEMATICAL SOCIETY, 2008, 45 (04) : 1057 - 1073