Efficient Pairing Computation

Efficient Pairing Computation is a computational method in identity-based cryptography that belongs to the class of pairing-based cryptographic techniques and is distinguished by its optimization of bilinear pairing operations to minimize computational cost and latency while maintaining cryptographic security.

93

Publications

4.2K

Citations

195

Authors

103

Institutions

Publications per year

2017–2026

7

Authors

195

  1. MS
    Michael Scott

    Dublin City University, Ireland

    8 publications · 812 citations

    8

    h-index

  2. SD
    Steven D. Galbraith⋆

    Royal Holloway University of London, United Kingdom

    5 publications · 587 citations

    5

    h-index

  3. TK
    Tim Kerins

    University College Cork, Ireland

    5 publications · 82 citations

    5

    h-index

  4. PS
    Paulo S. L. M. Barreto

    Universidade de São Paulo, Brazil

    5 publications · 703 citations

    5

    h-index

  5. FV
    Fréderik Vercauteren

    KU Leuven, Belgium

    5 publications · 481 citations

    5

    h-index

1–5 of 195

Venues

  1. IACR Cryptology ePrint Archive

    Repository · 15 publications · 406 citations

    12

    h-index

  2. 4

    h-index

  3. Designs Codes and Cryptography

    3 publications · 496 citations

    3

    h-index

  4. IEEE Transactions on Computers

    3 publications · 226 citations

    3

    h-index

  5. IEEE Transactions on Information Theory

    3 publications · 545 citations

    3

    h-index

1–5