Modular Arithmetic In Cryptography

Modular Arithmetic in Cryptography is a cryptographic methodology that employs modular arithmetic as its foundational mathematical framework to enable secure encryption, decryption, and key exchange by leveraging the computational hardness of modular inverse and discrete logarithm problems.

175

Publications

5.9K

Citations

391

Authors

184

Institutions

Publications per year

2017–2026

39

Authors

391

  1. ÇK
    Çetin Kaya Koç

    Oregon State University, United States

    8 publications · 769 citations

    8

    h-index

  2. CD
    Colin D. Walter

    University of Manchester, United Kingdom

    6 publications · 329 citations

    6

    h-index

  3. BP
    Bart Preneel

    KU Leuven, Belgium

    4 publications · 134 citations

    4

    h-index

  4. ZL
    Zhe Liu

    Nanjing University of Aeronautics and Astronautics, China

    4 publications · 130 citations

    4

    h-index

  5. IV
    Ingrid Verbauwhede

    KU Leuven, Belgium

    4 publications · 353 citations

    4

    h-index

1–5 of 391

Venues

  1. IEEE Transactions on Computers

    13 publications · 1K citations

    12

    h-index

  2. 6

    h-index

  3. International Journal of Computer Mathematics

    4 publications · 75 citations

    4

    h-index

  4. 4

    h-index

  5. Electronics Letters

    3 publications · 70 citations

    3

    h-index

1–5