Non-complete mappings characteristics of RSA

Non-complete mappings characteristics of RSA

Blog Article

On the basis of the complete mappings concept, this paper gives difference value characteristics between image and inverse image of Douches random permutation.Through giving lower bound of the number of some same difference value between image and inverse image, it is Dining Extension Table proved that RSA encryption function is not a complete mappings.At the same time, a conceive of attack to RSA digital signature scheme is given based on non-complete mappings characteristics of RSA.