Exponentiation Algorithms

Exponentiation Algorithms is a class of computational methods within number-theoretic algorithms that specialize in efficiently computing the result of raising a base integer to an exponent under modular arithmetic, particularly optimizing for large exponents through techniques such as repeated squaring and residue reduction.

520

Publications

30.6K

Citations

966

Authors

478

Institutions

Publications per year

2017–2026

62

Authors

966

  1. ÇK
    Çetin Kaya Koç

    Oregon State University, United States

    9 publications · 846 citations

    9

    h-index

  2. DH
    David Harvey

    UNSW Sydney, Australia

    8 publications · 435 citations

    8

    h-index

  3. DL
    Der‐Chyuan Lou

    National Defense University, Taiwan

    7 publications · 107 citations

    7

    h-index

  4. JV
    Joris van der Hoeven

    Centre National de la Recherche Scientifique, France

    7 publications · 369 citations

    7

    h-index

  5. NN
    Nadia Nedjah

    Universidade do Estado do Rio de Janeiro, Brazil

    7 publications · 155 citations

    7

    h-index

1–5 of 966

Venues

  1. IEEE Transactions on Computers

    43 publications · 2.9K citations

    29

    h-index

  2. Mathematics of Computation

    MCOM · 19 publications · 3.1K citations

    15

    h-index

  3. Electronics Letters

    17 publications · 678 citations

    15

    h-index

  4. Information Processing Letters

    10 publications · 297 citations

    10

    h-index

  5. 10

    h-index

1–5