Modular Arithmetic Algorithms

Modular Arithmetic Algorithms is a class of computational methods that perform arithmetic operations within the finite set of integers modulo a given integer, distinguished by their reliance on congruence relations to enable efficient computation in number-theoretic and cryptographic applications.

357

Publications

17.8K

Citations

641

Authors

354

Institutions

Publications per year

2017–2026

56

Authors

641

  1. ÇK
    Çetin Kaya Koç

    Oregon State University, United States

    13 publications · 1.2K citations

    12

    h-index

  2. NT
    Naofumi Takagi

    Nagoya University, Japan

    11 publications · 429 citations

    10

    h-index

  3. CD
    Colin D. Walter

    University of Manchester, United Kingdom

    9 publications · 815 citations

    9

    h-index

  4. SL
    Shuguo Li

    Tsinghua University, China

    8 publications · 190 citations

    8

    h-index

  5. JB
    Jean-Claude Bajard

    Centre National de la Recherche Scientifique, France

    7 publications · 398 citations

    7

    h-index

1–5 of 641

Venues

  1. IEEE Transactions on Computers

    28 publications · 1.8K citations

    21

    h-index

  2. Mathematics of Computation

    MCOM · 13 publications · 3.8K citations

    12

    h-index

  3. Electronics Letters

    10 publications · 794 citations

    10

    h-index

  4. 10

    h-index

  5. International Journal of Computer Mathematics

    8 publications · 147 citations

    8

    h-index

1–5