Abstract:
RSA is the mostly wide-spread public key algorithm today. To generate big primes is the slowest operation for RSA in restricted enviroments such as smart card. The article puts forward a method to sieve out mass composite numbers before performing Robin-Miller primitive check. The overall performance of generating key pair for RSA can be improved about 50% by this method.
摘要： 在公钥密码应用中，RSA算法现在仍处于主流地位。RSA算法在受限环境、嵌入式环境中最慢的操作是生成密钥对，即寻找两个大素数。该文在Robin-Miller概率素性判别算法之前，采用适合于嵌入环境实现的方法，先对随机数进行过滤，可以使素数生成的整体效率提高50%。
关键词:
大素数,
RSA,
嵌入式系统,
密码学
CLC Number:
CUI Jingsong1, TU Hang1, PENG Rong1, WANG Lina1,2, ZHANG Huanguo1. Fast Generation of Big Prime in Embedded System[J]. , 2003, 29(05): 32-.
崔竞松,彭蓉,涂航,张焕国,王丽娜. 嵌入式系统中大素数的快速生成[J]. , 2003, 29(05): 32-.