Keyword

modular multiplication

Description: Modular multiplication is the operation of multiplying integers and reducing the result modulo a specified modulus, commonly used in number theory and cryptography.

Primary topic: Cryptography and Residue Arithmetic (80%)

OpenAlex ID: keywords/modular-multiplication

How To Prove Yourself: Practical Solutions to Identification and Signature Problems

2007 · Amos Fiat, Adi Shamir · Springer eBooks · 3,946

Modular Multiplication Without Trial Division

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

PDF

Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing

2007 · Torben Pryds Pedersen · Springer eBooks · 2,452

Self-testing/correcting with applications to numerical problems

1993 · Manuel Blum, Michael Luby, et al. · Journal of Computer and System Sciences · 711

Analyzing and comparing Montgomery multiplication algorithms

1996 · C. Kaya Koc, T. Acar, et al. · IEEE Micro · 563

Realization of a scalable Shor algorithm

2016 · Thomas Monz, Daniel Nigg, et al. · Science · 486

PDF

Improved Online/Offline Signature Schemes

2001 · Adi Shamir, Yael Tauman · Lecture notes in computer science · 391

Fast decipherment algorithm for RSA public-key cryptosystem

1982 · J.-J. Quisquater, C. Couvreur · Electronics Letters · 388

On-line/off-line digital signatures

1996 · Shimon Even, Oded Goldreich, et al. · Journal of Cryptology · 319

Self-testing/correcting with applications to numerical problems

1990 · M. Blum, M. Luby, et al. · ACM Symposium on Theory of Computing (STOC) · 303

PDF

Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes

1999 · Jan Camenisch, Markus Michels · Lecture notes in computer science · 300

Montgomery Multiplication in GF(2k)

1998 · Cetin K. Koc, Tolga Acar · Designs Codes and Cryptography · 266

Montgomery exponentiation needs no final subtractions

1999 · C.D. Walter · Electronics Letters · 250

A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost

1997 · Mihir Bellare, Daniele Micciancio · Lecture notes in computer science · 250

A scalable architecture for modular multiplication based on montgomery's algorithm

2003 · A.F. Tenca, C.K. Koc · IEEE Transactions on Computers · 227

Hardware implementation of Montgomery's modular multiplication algorithm

1993 · S.E. Eldridge, C.D. Walter · IEEE Transactions on Computers · 218

Systolic modular multiplication

1993 · C.D. Walter · IEEE Transactions on Computers · 217

Lower bounds by probabilistic arguments

1983 · Andrew C. Yao · Annual Symposium on Foundations of Computer Science · 209

Schnelle Multiplikation von Polynomen �ber K�rpern der Charakteristik 2

1977 · Arnold Sch�nhage · Acta Informatica · 193

Montgomery modular exponentiation on reconfigurable hardware

2003 · T. Blum, C. Paar · Proceedings/Proceedings - Symposium on Computer Arithmetic · 182

Simplifying quotient determination in high-radix modular multiplication

2002 · H. Orup · 169

A Computer Algorithm for Calculating the Product AB Modulo M

1983 · G.R. Blakely · IEEE Transactions on Computers · 168

Can D.S.A. be improved? — Complexity trade-offs with the digital signature standard —

1995 · David Naccache, David M'RaÏhi, et al. · Lecture notes in computer science · 166

PDF

A Cryptographic Library for the Motorola DSP56000

1991 · Stephen R. Dussé, Burton S. Kaliski · Lecture notes in computer science · 162

A Scalable Architecture for Montgomery Nultiplication

1999 · Alexandre F. Tenca, Çetin K. Koç · Lecture notes in computer science · 159

Works count: 2,075

Citation count: 29,530