Inquiry into Basic Arithmetic About Cipher
Cai Da-peng · 2003
The paper describes the RSA arithmetic about cipher, and shows the exponential expression of it. Proclamation in writing is encrypted by the unit of grouping, which each of them is no more than the value of binary system of a certain number N. It is explained that the magnitude of grouping must be less than or equal to that of log2n. The corresponding schema and introducing the security of RSA arithmetic as well are offered in the paper. What's more, adopting mathematical and timing attacks of two kinds tested with the relevant precautions. RSA arithmetic, universally used as security protocol, is one of the key arithmetic about cipher.