Abstract:

Its presented an indepth algorithmic study of the carry of ones complement addition. The results are based on a fairly simple classification of Fn2, we derive O((n－1)/2)time algorithm to calculate the probability distribution of XOR difference between ones complement addition and XOR. The results solves the probability distribution of noise function produced by macrocosm approximations of ones complement addition with XOR, and reflects the closeto degree of the two operations.

Key words: cryptology, XOR difference, ones complement addition, XOR