密码学基本算法的探讨  

Inquiry into Basic Arithmetic About Cipher

作　　者：宋维平[1] 蔡大鹏[2] 

机构地区：[1]吉林建筑工程学院网络信息中心,长春130021 [2]锦州师范学院电子信息系,锦州121003

出　　处：《吉林建筑工程学院学报》2003年第3期43-45,共3页Journal of Jilin Architectural and Civil Engineering

摘　　要：针对密码学中的RSA算法进行了描述,指出RSA算法的指数表达式;明文以分组为单位加密,其中,每个分组是小于某个数N的二进制值,说明分组大小必须小于或等于log2[n];并给出了相应的图解.同时,对RSA算法的安全性进行了介绍,并假定采用数学攻击、定时攻击两种方式进行测试其相应的防范措施.RSA算法是被广泛使用的安全协议,是密码学的核心算法之一.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.

关 键 词：算法 安全性 密钥 加密 解密 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]