Exponentiation in Pairing-Friendly Groups Using Homomorphisms

被引：0
|
作者：
Galbraith, Steven D. [1 ]
Scott, Michael [2 ]
机构：
[1] Univ London, Royal Holloway, Dept Math, Egham TW20 0EX, Surrey, England
[2] Dublin City Univ, Sch Comp, Dublin 9, Ireland
来源：
PAIRING-BASED CRYPTOGRAPHY - PAIRING 2008 | 2008年 / 5209卷
基金：
英国工程与自然科学研究理事会; 爱尔兰科学基金会;
关键词：
pairings;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We present efficiently computable homomorphisms of the groups G(2) and G(T) for pairings G(1) x G(2) --> G(T). This allows exponentiation in G(2) and G(T) to be accelerated using the Gallant-Lambert-Vanstone method.
引用
收藏
页码：211 / +
页数：3
相关论文
共 50 条
  • [21] Generating pairing-friendly elliptic curve parameters using sparse families
    Fotiadis, Georgios
    Konstantinou, Elisavet
    JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2018, 12 (02) : 83 - 99
  • [22] Optimal pairing computation over families of pairing-friendly elliptic curves
    Soo-Kyung Eom
    Hyang-Sook Lee
    Cheol-Min Park
    Applicable Algebra in Engineering, Communication and Computing, 2011, 22 : 235 - 248
  • [23] Faster Ate Pairing Computation over Pairing-Friendly Elliptic Curves Using GLV Decomposition
    Eom, Soo Kyung
    Lee, Eunjeong
    Lee, Hyang-Sook
    ETRI JOURNAL, 2013, 35 (05) : 880 - 888
  • [24] Optimal pairing computation over families of pairing-friendly elliptic curves
    Eom, Soo-Kyung
    Lee, Hyang-Sook
    Park, Cheol-Min
    APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2011, 22 (04) : 235 - 248
  • [25] TNFS resistant families of pairing-friendly elliptic curves
    Fotiadis, Georgios
    Konstantinou, Elisavet
    THEORETICAL COMPUTER SCIENCE, 2019, 800 (73-89) : 73 - 89
  • [26] CONSTRUCTING PAIRING-FRIENDLY CURVES WITH VARIABLE CM DISCRIMINANT
    Lee, Hyang-Sook
    Park, Cheol-Min
    BULLETIN OF THE KOREAN MATHEMATICAL SOCIETY, 2012, 49 (01) : 75 - 88
  • [27] Hashing to G(2) on BLS pairing-friendly curves
    Budroni, Alessandro
    Pintore, Federico
    ACM COMMUNICATIONS IN COMPUTER ALGEBRA, 2018, 52 (03): : 63 - 66
  • [28] A New Method for Constructing Pairing-Friendly Abelian Surfaces
    Drylo, Robert
    PAIRING-BASED CRYPTOGRAPHY-PAIRING 2010, 2010, 6487 : 298 - 311
  • [29] More Sparse Families of Pairing-Friendly Elliptic Curves
    Fotiadis, Georgios
    Konstantinou, Elisavet
    CRYPTOLOGY AND NETWORK SECURITY, CANS 2014, 2014, 8813 : 384 - 399
  • [30] Generating pairing-friendly elliptic curves with fixed embedding degrees
    Liang Li
    Science China Information Sciences, 2017, 60
12345