Modified Redundant Representation for Designing Arithmetic Circuits with Small Complexity

Abstract

We give a modified redundant representation for designing arithmetic circuits with small complexity. Using our modified redundant representation, we improve many of the complexity values significantly. Our method works for any finite field. We also give some applications in cryptography.