基本密码学算法

就密码学中的RSA算法进行了描述，指出RSA算法的指数表达式：明文以分组为单位加密，其中每个分组是小于某个数Ⅳ的二进制值。说明分组大小必须小于或等于log2^(n），并给出了相应的图解。同时对RSA算法的安全性进行了介绍，并假定采用数学攻击、定时攻击两种方式进行测试，论述了相应的防范措施。RSA算法是被广泛使用的安全协议，是密码学的核心算法之一。

Algorithm of base cryprography

The paper describes the RSA arithmetic about cipher,showing the exponential expression of it.Proclamation in writing is encrypted by the unit of grouping,each of them being no more than the value of binary system of a certain number N,explaining that the magnitude of grouping must be less than or equal to that of log_2~((n)),offering the corresponding schema and introducing the security of RSA arithmetic as well.What's more,assuming testing by adopting mathematical and timing attacks of two kinds,with the relevant precautions attached.RSA arithmetic,universally used as security protocol,is one of the key arithmetic about cipher.