Public Key encryption, which enables authentication and key exchange is essential for eCommerce and mobile commerce. The calculations of Public Key algorithms are the most demanding calculations in terms of processing power, time and energy. The Modular Reduction calculation of big numbers (1024 bit or 2048 bit), consumes about 70% of the whole process of Public Key calculation. Since 1985 most implementations of Public Key algorithms use Montgomery multiplication method to calculate Modular Reduction. CipherActive has developed an innovative, patent pending, mathematical algorithm for modular reduction, which replaces the Montgomery method.
CipherActive's Modular Reduction method is totally different from the Montgomery method. for example, while in Montgomery method each calculation step depends on the result of the previous step, our method enable parallel calculations. As a result using our algorithm in core design will improve performance x4 or reduce gates count in at least x4.

Software Reference Model

The Software Reference Model, which implementing our PKI/AES algorithms, represents a simulator of possible implementation of hardware design and contains:

• Logic diagram providing obvious parallelism of functional blocks
• Functional block's interface definition
• SRM implementing each of the FUB
• Detailization of each FUB
• Data flow with data valid consideration

The performance simulator version taking into account required latency of each logic block but without calculations themselves. Such model gives objective evaluation of the cycles per block.