Seeking prime numbers quickly through parallelcomputin求素数快速通过并行计算.pptVIP

下载本文档

2
0
约4.94千字
约 23页
2018-06-19 发布于福建
举报
版权申诉

Seeking prime numbers quickly through parallelcomputin求素数快速通过并行计算.ppt

1、有哪些信誉好的足球投注网站（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Seeking prime numbers quickly through parallelcomputin求素数快速通过并行计算

Seeking prime numbers quickly through parallel-computing Daniel J. Wright Seeking prime numbers quickly through parallel-computing Reasoning / Background Project Goals Methodology and Assumptions Software Description Result Data Conclusions Reasoning / Background DES: U.S. Government Data Encryption Standard: 72,057,594,037,927,936 (72 quadrillion) possible keys. Cracked by the Electronic Frontier Foundation’s “Deep Crack” software and hardware in just over 22 hours, trying 245 billion keys per second. How? Parallel Processing!!! Multiple CPU’s networked together and assigned only a portion of the entire work to be completed. Reasoning / Background RC5: Public key encryption Two keys (one public and one private) are generated based on the factors of a third number. Recipe for a hard-to-factor number: Multiply two very large prime numbers together. How do we find large prime numbers quickly? Parallel Processing!!! Multiple CPU’s networked together to find very large prime numbers faster than any one machine could. Project Goals To develop software that utilizes multiple CPUs to solve a problem more quickly than any one of the CPUs alone. To demonstrate a usage for legacy equipment. To implement the software within a frame of three months. Description Two sets of software were written for comparison purposes. Standalone version designed to find prime numbers very quickly. Networked version designed to cooperate with multiple PCs to find the same range of prime numbers. Methodologies and Assumptions Finding prime numbers is not a hard task. Fast prime number algorithms are not 100% effective. The networked version uses identical algorithms for actually calculating the primes. Both software versions are capable of benchmarking themselves. Software Description Standalone Version: Accepts all project details on the command line. Uses the Rabin-Miller algorithm for finding prime numbers. Outputs resulting data to pre-designated output files. Networked Client: Accepts p