By Topic

Architectures for Montgomery's multiplication

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)

Many public key cryptographic algorithms require modular multiplication of very large operands as their core arithmetic operation. One method to perform this operation reasonably fast is to use specialised hardware. However, larger sizes are often required to increase security. This comes at the expense of either reducing the clock rate or dramatically increasing the size and hence the cost of the system. Therefore, techniques that allow efficient and fast computation of this operation at the algorithmic level are desired. An algorithm/structure for the computation of Montgomery's modular multiplication is presented. The modified algorithm splits the original algorithm into two multiplication operations, which can be executed in parallel. The derived architectures can be pipelined to the bit-level by interleaving multiple modular multiplication operations onto the same structure.

Published in:

Computers and Digital Techniques, IEE Proceedings -  (Volume:150 ,  Issue: 6 )