RSA密码系统中生成大素数的快速算法

Proceedings of the 1992 South African Symposium on Communications and Signal Processing Pub Date : 1992-09-11 DOI:10.1109/COMSIG.1992.274291

W. Penzhorn

{"title":"RSA密码系统中生成大素数的快速算法","authors":"W. Penzhorn","doi":"10.1109/COMSIG.1992.274291","DOIUrl":null,"url":null,"abstract":"The generation of large primes is of particular importance in the context of public key cryptography. The Miller-Rabin test is currently one of the most efficient ways of determining whether a given odd integer is composite. Repeated use of this test allows one to certify an integer as 'probable' prime with an arbitrary small probability of error. Based on the observation that prime numbers tend to occur in clusters, or constellations, an algorithm is proposed for the efficient generation of large primes. It is readily implementable on an IBM-PC.<<ETX>>","PeriodicalId":342857,"journal":{"name":"Proceedings of the 1992 South African Symposium on Communications and Signal Processing","volume":"103 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Fast algorithms for the generation of large primes for the RSA cryptosystem\",\"authors\":\"W. Penzhorn\",\"doi\":\"10.1109/COMSIG.1992.274291\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The generation of large primes is of particular importance in the context of public key cryptography. The Miller-Rabin test is currently one of the most efficient ways of determining whether a given odd integer is composite. Repeated use of this test allows one to certify an integer as 'probable' prime with an arbitrary small probability of error. Based on the observation that prime numbers tend to occur in clusters, or constellations, an algorithm is proposed for the efficient generation of large primes. It is readily implementable on an IBM-PC.<<ETX>>\",\"PeriodicalId\":342857,\"journal\":{\"name\":\"Proceedings of the 1992 South African Symposium on Communications and Signal Processing\",\"volume\":\"103 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-09-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 1992 South African Symposium on Communications and Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COMSIG.1992.274291\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 1992 South African Symposium on Communications and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSIG.1992.274291","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

大素数的生成在公钥密码学中具有特别重要的意义。米勒-拉宾检验是目前确定给定奇数是否为合数的最有效方法之一。重复使用这个测试可以证明一个整数是具有任意小误差概率的“可能”素数。基于对质数往往出现在簇或星座中的观察，提出了一种高效生成大质数的算法。它很容易在IBM-PC上实现。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Fast algorithms for the generation of large primes for the RSA cryptosystem

The generation of large primes is of particular importance in the context of public key cryptography. The Miller-Rabin test is currently one of the most efficient ways of determining whether a given odd integer is composite. Repeated use of this test allows one to certify an integer as 'probable' prime with an arbitrary small probability of error. Based on the observation that prime numbers tend to occur in clusters, or constellations, an algorithm is proposed for the efficient generation of large primes. It is readily implementable on an IBM-PC.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the 1992 South African Symposium on Communications and Signal Processing

自引率

0.00%

发文量