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 条
  • [41] Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
    Kachisa, Ezekiel J.
    Schaefer, Edward F.
    Scott, Michael
    PAIRING-BASED CRYPTOGRAPHY - PAIRING 2008, 2008, 5209 : 126 - +
  • [42] On the non-idealness of cyclotomic families of pairing-friendly elliptic curves
    Sha, Min
    JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2014, 8 (04) : 417 - 440
  • [43] Pairing-Friendly Curves with Minimal Security Loss by Cheon's Algorithm
    Park, Cheol-Min
    Lee, Hyang-Sook
    ETRI JOURNAL, 2011, 33 (04) : 656 - 659
  • [44] Experimantal Analysis of Cheon's Algorithm against Pairing-Friendly Curves
    Izu, Tetsuya
    Takenaka, Masahiko
    Yasuda, Masaya
    25TH IEEE INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS (AINA 2011), 2011, : 90 - 96
  • [45] On the rho-values of complete families of pairing-friendly elliptic curves
    Okano, Keiji
    JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2012, 6 (3-4) : 249 - 268
  • [46] Efficient Hardware Implementation of Fp-Arithmetic for Pairing-Friendly Curves
    Fan, Junfeng
    Vercauteren, Frederik
    Verbauwhede, Ingrid
    IEEE TRANSACTIONS ON COMPUTERS, 2012, 61 (05) : 676 - 685
  • [47] ON THE NUMBER OF ISOGENY CLASSES OF PAIRING-FRIENDLY ELLIPTIC CURVES AND STATISTICS OF MNT CURVES
    Jimenez Urroz, Jorge
    Luca, Florian
    Shparlinski, Igor E.
    MATHEMATICS OF COMPUTATION, 2012, 81 (278) : 1093 - 1110
  • [48] Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting
    Canard, Sebastien
    Pointcheval, David
    Sanders, Olivier
    PUBLIC-KEY CRYPTOGRAPHY - PKC 2014, 2014, 8383 : 167 - 184
  • [49] Template-Based Design Optimization for Selecting Pairing-Friendly Curve Parameters
    Fukuda, Momoko
    Ikeda, Makoto
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2024, E107A (03) : 549 - 556
  • [50] Co-factor Clearing and Subgroup Membership Testing on Pairing-Friendly Curves
    El Housni, Youssef
    Guillevic, Aurore
    Piellard, Thomas
    PROGRESS IN CRYPTOLOGY - AFRICACRYPT 2022, 2022, 13503 : 518 - 536
12345