Since redundant number systems allow constant time addition, they are often at the heart of modular multipliers designed for public key cryptography (PKC) applications.
PKC involves large operands (160 to 1024 bits) and several researchers proposed carry-save or borrow-save algorithms.