DocumentCode :
1216892
Title :
The average amount of information lost in multiplication
Author :
Pippenger, Nicholas
Author_Institution :
Dept. of Comput. Sci., Princeton Univ., NJ
Volume :
51
Issue :
2
fYear :
2005
Firstpage :
684
Lastpage :
687
Abstract :
We show that if X and Y are integers independently and uniformly distributed in the set {1,...,N}, then the information lost in forming their product (which is given by the equivocation H(X,Y|XmiddotY)), is Theta(loglogN). We also prove two extremal results regarding cases in which X and Y are not necessarily independently or uniformly distributed. First, we note that the information lost in multiplication can of course be 0. We show that the condition H(X,Y|XmiddotY)=0 implies 2log2N-H(X,Y)=Omega(loglogN). Furthermore, if X and Y are independent and uniformly distributed on disjoint sets of primes, it is possible to have H(X,Y|XmiddotY)=0 with log2N-H(X) and log2N-H(Y) each O(loglogN). Second, we show that no matter how X and Y are distributed, H(X,Y|XmiddotY)=O(logN/loglogN). Furthermore, there are distributions (in which X and Y are independent and uniformly distributed over sets of numbers having only small and distinct prime factors) for which we have H(X,Y|XmiddotY)=Omega(logN/loglogN)
Keywords :
digital arithmetic; entropy; average information amount; entropy; equivocation; multiplicative channel; multiplier; Computer science; Cryptography; Entropy; Entropy; equivocation; multiplicative channel; multiplier;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2004.840866
Filename :
1386536
Link To Document :
بازگشت