Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,475,742 papers from all fields of science
Search
Sign In
Create Free Account
Montgomery modular multiplication
Known as:
Montgomery reduction
, Montgomery modular reduction
, Montgomery multiplication
Expand
In modular arithmetic computation, Montgomery modular multiplication, more commonly referred to as Montgomery multiplication, is a method for…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Barrett reduction
Carry-save adder
Diffie–Hellman key exchange
Exponentiation by squaring
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Montgomery Modular Multiplication on ARM-NEON Revisited
Hwajeong Seo
,
Zhe Liu
,
J. Großschädl
,
Jongseok Choi
,
Howon Kim
International Conference on Information Security…
2014
Corpus ID: 11366939
Montgomery modular multiplication constitutes the “arithmetic foundation” of modern public-key cryptography with applications…
Expand
2010
2010
Fault and simple power attack resistant RSA using Montgomery modular multiplication
A. Fournaris
Proceedings of IEEE International Symposium on…
2010
Corpus ID: 25253681
Side channel attacks and more specifically fault, simple power attacks, constitute a pragmatic, potent mean of braking a…
Expand
2009
2009
Hardware Implementation of Improved Montgomery Modular Multiplication Algorithm
Jia Hong Zhang
,
Xiong Tinggang
,
X. Fang
WRI International Conference on Communications…
2009
Corpus ID: 15916881
This paper describes a hardware implementation of modular multiplication coprocessor for both RSA and ECC Cryptosystems. Using a…
Expand
2007
2007
New and Improved Architectures for Montgomery Modular Multiplication
M. Sudhakar
,
R. V. Kamala
,
M. Srinivas
Mob. Networks Appl.
2007
Corpus ID: 29576997
In this paper an improved Montgomery multiplier, based on modified four-to-two carry-save adders (CSAs) to reduce critical path…
Expand
2006
2006
Modified Montgomery modular multiplication using 4:2 compressor and CSA adder
H. Thapliyal
,
Anvesh Ramasahayam
,
V. Kotha
,
Kunul Gottimukkula
,
M. Srinivas
Delta
2006
Corpus ID: 10091318
The efficiency of the public key encryption systems like RSA and ECC can be improved with the adoption of a faster multiplication…
Expand
Highly Cited
2003
Highly Cited
2003
Balanced self-checking asynchronous logic for smart card applications
S. Moore
,
Ross J. Anderson
,
R. Mullins
,
G. Taylor
,
J. Fournier
Microprocessors and microsystems
2003
Corpus ID: 2186513
2003
2003
Architectures for Montgomery's multiplication
O. Nibouche
,
A. Bouridane
,
M. Nibouche
2003
Corpus ID: 62562037
Many public key cryptographic algorithms require modular multiplication of very large operands as their core arithmetic operation…
Expand
Review
2003
Review
2003
Library Economic Metrics: Examples of the Comparison of Electronic and Print Journal Collections and Collection Services
D. King
,
P. B. Boyce
,
C. Montgomery
,
C. Tenopir
Library Trends
2003
Corpus ID: 7536721
This article deals with a framework of library economic metrics including service input and output, performance, usage…
Expand
2000
2000
An expandable Montgomery modular multiplication processor
A. Gutub
,
A. Amin
ICM'99. Proceedings. Eleventh International…
2000
Corpus ID: 54911130
Several public-key cryptographic systems (Schneier, 1996) make heavy use of modular multiplication. A design for expandable…
Expand
Highly Cited
1994
Highly Cited
1994
A Systolic, Linear-Array Multiplier for a Class of Right-Shift Algorithms
Peter Kornerup
IEEE Trans. Computers
1994
Corpus ID: 18678340
A very simple multiplier cell is developed for use in a linear, purely systolic array forming a digit-serial multiplier for…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE