Non-complete mappings characteristics of RSA

On the basis of the complete mappings concept, this paper gives difference value characteristics between image and inverse image of random permutation. Through giving lower bound of the number of some same difference value between image and inverse image, it is proved that RSA encryption function is...

Full description

Saved in:
Bibliographic Details
Published inTongxin Xuebao pp. 113 - 118
Main Authors XU Jie-l? XU Han-liang, HUANG Hong-mei, LV Shu-wang
Format Journal Article
LanguageChinese
Published Editorial Department of Journal on Communications 01.01.2003
Subjects
complete mappings;omni-direction permutation;RSA public key cryptographic system;polynomial modular equation
Online AccessGet full text

Cover

More Information
Summary:On the basis of the complete mappings concept, this paper gives difference value characteristics between image and inverse image of random permutation. Through giving lower bound of the number of some same difference value between image and inverse image, it is 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.
ISSN:1000-436X