用类的RSA体制实现方案

通过对 RSA算法原理的分析和实现方法的研究 ,构造了数字签名软件的数据结构 .用类的对象对自定义函数设计模块进行调用 ,实现任意长度数据的运算 .针对 RSA实现算法运算速度慢的特点 ,在生成密钥对的过程中采用小素数翻番、欧几里得扩展算法、二元法等一系列方法 ,以加快算法实现速度 .从而 ,在微机上实现了数字签名的软件开发 .

Realization of Class-Based RSA System

By analysing the principle of Rivest-Shamir-Adelman(RSA) system or RSA system for short and by studying the realization of RSA algorithm, the data structure of digital signature software is constructed. By using class as object to call the module of self defining function design, the operation of data with arbitrary length is realized. In view of slow realization of RSA algorithm operation, a series of methods including doubling of small prime and Euclidean algorithm extension and binary algorithm are adopted during the generation of private key cryptosystem. By which the realization of algorithm can be accelerated; and software of digital signature can be developed and realized on microcomputer