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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2003-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/74362593/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|