Multiple RSA encryption method utilizing polynomial coefficient to make information conversion

Application Number: 00103359
Application Date: 2000.03.03
Publication Number: 1263393
Publication Date: 2000.08.16
Priority Information:
International: H04L9/28
Applicant(s) Name: Qinghua Univ.
Inventor(s) Name: Jia Huibo;Shi Xi;Xiong Jianping
Patent Agency Code: 11201
Patent Agent: liao yuanqiu
Abstract The present invention belongs to the field of computer data encryption technology. It utilizes constructive polynomial x'=anRbn+an-1Rbn-1… +a1R+ao, in which n is defined according to conditional formula RB" less than RA less than RBn-1 to convert the dala x' which can not meet RSA algorithm condition of information which must be in the range of [0,R-1] into the data group (an, an-1, …, a1, ao) meeting condition. Said invention overcomes the defect of using RSA algorithm to make multiple encryption process, and implements the multiple encryption of data by using RSA algorithm.