Very Fast Multi Operand Addition Method by Bitwise Subtraction

• Published in: Fifth International Conference on Information Technology: New Generations (itng 2008) pp. 1240 - 1241
• Main Authors: Manochehri, K., Pourmozafari, S., Sadeghian, B.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01-04-2008
• Subjects: Bitwise subtraction; Computer arithmetic; CSA; Elliptic curve cryptography; Energy consumption; Fast multi addition; Hamming weight; Information technology; Logic gates; Power engineering and energy; Power engineering computing; Public key cryptography; Recoding
• ISBN: 0769530990; 9780769530994
• DOI: 10.1109/ITNG.2008.32

Basic operations of public key cryptography are multiplication and exponentiation. Because of long operand length, their processing is very time consuming operations. The basic of all of these operations is multi operand addition. To improve this operation's performance, many methods are used, that carry save adder (CSA) is the best method until now. This paper proposed a new method with the same performance as CSA but with 40% less logic gates than CSA. This area reduction may lead to less power consumption and sometimes more processing speed, that are suitable for embedded processor. The idea of proposed method is bitwise subtraction that there is no carry propagation needed that is very useful for long length multi additions.