1. A method to obtain simultaneous results of modulo7 and modulo9 operation on an unsigned number N, the method comprising the steps of: (1) representing the unsigned number N in binary format; (2) Finding-finding a common multiple ‘M’ of 9 and 7 which is the closest to a number “d”, d being a power of 2; (3) determining Lrem such that 0≦Lrem≦M, by application of the split-and-accumulate method multiple times if required, wherein division of N by d (N/d) is performed by splitting binary representation of N into quotient q d and remainder r d , and subsequently adding them together to form the intermediate sum ‘q d +r d ’; thereafter if this intermediate sum is greater than M, the split-and-accumulate method is applied again on the sum ‘q d +r d ’, this is done repeatedly till the resulting sum ‘q d +r d ’ is assured to be less than or equal to M, at which point Lrem is assigned the value of this sum ‘q d +r d ’; (4) determining N modulo7 according to equation N modulo7=(Lrem) modulo 7 by one or more split-and-accumulate operations (5) determining N modulo9 according to equation N modulo9=(Lrem) modulo 9 by one or more split-and-accumulate operations and (6) providing a circuitry comprising full adders and logic gates capable of performing full-addition operations, comparison and multiplexing functions, configured to perform steps 3-5.