Improving Montgomary Modular Algorithm using Data Coding

Different architectures have been offered for hardware implementation of Montgomery modular multiplication for efficiency enhancement. That is not only processing speed has been increased but also area has been considered. In most of these architectures CSA adder is used. The most important advantage of this architecture is prevention of carry propagation time consumption. In this paper a suitable adding method has been proposed that is more efficient than CSA method. This technique by new coding method has resulted in delay decrement (by high speed processing), area improvement and efficiency (about %82) rather than previous architectures. The proposed Montgomery algorithm is suitable for improvement of coding systems efficiency like ECC that use modular multiplication in computations

کلیدواژه ها:

cryptography algorithm ، eliptic curve cryptography ، Montgomery algorithm ، modular multiplication ، modular addition ، Booth recoding