Keyword

modular arithmetic

Description: A system of integer arithmetic in which values wrap around after reaching a fixed modulus, commonly used in number theory and cryptography.

Primary topic: Cryptography and Residue Arithmetic (31%)

Wikidata ID: wiki/Q319400

OpenAlex ID: keywords/modular-arithmetic

Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

2007 · Pascal Paillier · Springer eBooks · 7,245

Modular Multiplication Without Trial Division

1985 · Peter L. Montgomery · Mathematics of Computation · 2,671

PDF

Fully Homomorphic Encryption over the Integers

2010 · Marten van Dijk, Craig Gentry, et al. · Lecture notes in computer science · 1,859

Computer Arithmetic: Algorithms and Hardware Designs

1999 · Behrooz Parhami · 1,151

New automatic equaliser employing modulo arithmetic

1971 · M. Tomlinson · Electronics Letters · 897

Residue arithmetic and its applications to computer technology

1967 · Nicholas S. Szabó, Richard I. Tanaka · Medical Entomology and Zoology · 897

Monte Carlo methods for index computation (𝑚𝑜𝑑𝑝)

1978 · J. M. Pollard · Mathematics of Computation · 825

PDF

Residue number system arithmetic: modern applications in digital signal processing

1986 · M.A. Soderstrand, W.K. Jenkins, et al. · 675

A modular approach to key safeguarding

1983 · C. Asmuth, J. Bloom · IEEE Transactions on Information Theory · 673

A Course in Number Theory and Cryptography

1994 · Neal Koblitz · Graduate texts in mathematics · 576

Some Properties of Enumeration in the Theory of Modular Systems

1927 · F. S. MacAulay · Proceedings of the London Mathematical Society · 518

Secret image sharing with steganography and authentication

2003 · Chang-Chou Lin, Wen-Hsiang Tsai · Journal of Systems and Software · 470

Kira—A Feynman integral reduction program

2018 · P. Maierhöfer, J. Usovitsch, et al. · Computer Physics Communications · 415

PDF

Monte Carlo Methods for Index Computation (mod p)

1978 · J. M. Pollard · Mathematics of Computation · 396

FIRE6: Feynman Integral REduction with modular arithmetic

2019 · A.V. Smirnov, F.S. Chukharev · Computer Physics Communications · 392

PDF

A pseudo-random number generator for the System/360

1969 · P. A. W. Lewis, A. S. Goodman, et al. · IBM Systems Journal · 370

The residue number system

1959 · Harvey L. Garner · 355

Medical image encryption using high-speed scrambling and pixel adaptive diffusion

2017 · Zhongyun Hua, Shuang Yi, et al. · Signal Processing · 347

Residue Number Systems - Theory and Implementation

2007 · Amos Omondi, Benjamin Premkumar · Advances in computer science and engineering · 347

Chinese Remainder Theorem

1996 · C Ding, D Pei, et al. · WORLD SCIENTIFIC eBooks · 346

Fibonacci Series Modulo m

1960 · D. D. Wall · American Mathematical Monthly · 332

The Multiple Zeta Value data mine

2009 · J. Blümlein, D.J. Broadhurst, et al. · Computer Physics Communications · 331

PDF

Modern Computer Arithmetic

2010 · Richard P. Brent, Paul Zimmermann · Cambridge University Press eBooks · 321

PDF

Efficient VLSI implementation of modulo (2/sup n/±1) addition and multiplication

2003 · R. Zimmermann · Proceedings/Proceedings - Symposium on Computer Arithmetic · 308

The Theory of Autonomous Linear Sequential Networks

1959 · B. Elspas · IRE Transactions on Circuit Theory · 305

Works count: 10,900

Citation count: 66,260