Global Sources
EE Times-Asia
Stay in touch with EE Times Asia
EE Times-Asia > Controls/MCUs

Accelerating modular exponentiation

Posted: 11 Mar 2013 ?? ?Print Version ?Bookmark and Share

Keywords:modular exponentiation? Garner's algorithm Chinese remainder theorem?

This application note tackles how to improve the speed of modular exponentiation by more than 50% when using MAXQ microcontrollers that have a modular arithmetic accelerator (MAA).

Modular exponentiation, ae modulo m, is a common operation in many cryptographic functions. The modular arithmetic accelerator (MAA) in MAXQ microprocessors can perform this operation with modulus sizes of up to 2048 bits. It is easy to load the memory areas with a, e, and m, and start the operation. When the modulus is the product of two or more primes, we can use the results of the Chinese remainder theorem (CRT) to reduce the execution time by doing two smaller modular exponentiations instead of one large one. Specifically, we are using Garner's algorithm for this operation.

View the PDF document for more information.

Originally published by Maxim Integrated Products Inc. at as "Improving the Speed of Modular Exponentiation with DeepCover Secure Microcontrollers (MAXQ1050, MAXQ1850, and MAXQ1103)".

Article Comments - Accelerating modular exponentiation
*? You can enter [0] more charecters.
*Verify code:


Visit Asia Webinars to learn about the latest in technology and get practical design tips.

Back to Top