RSA密码术

100 Years of Math Milestones Pub Date : 2019-06-12 DOI:10.1090/mbk/121/65

K. Bryan

{"title":"RSA密码术","authors":"K. Bryan","doi":"10.1090/mbk/121/65","DOIUrl":null,"url":null,"abstract":"Private communication has been a concern throughout history. People have developed many clever ways to send secret messages to their partners in business, politics, war, and adultery. In the age of computer communication, we assume that anyone may examine the bits flying around the internet, and we use mathematical techniques to scramble the bits in our message so that it is intelligible only at the endpoints of the transmission.","PeriodicalId":423691,"journal":{"name":"100 Years of Math Milestones","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"RSA encryption\",\"authors\":\"K. Bryan\",\"doi\":\"10.1090/mbk/121/65\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Private communication has been a concern throughout history. People have developed many clever ways to send secret messages to their partners in business, politics, war, and adultery. In the age of computer communication, we assume that anyone may examine the bits flying around the internet, and we use mathematical techniques to scramble the bits in our message so that it is intelligible only at the endpoints of the transmission.\",\"PeriodicalId\":423691,\"journal\":{\"name\":\"100 Years of Math Milestones\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-06-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"100 Years of Math Milestones\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1090/mbk/121/65\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"100 Years of Math Milestones","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1090/mbk/121/65","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 13

摘要

纵观历史，私人通信一直是一个令人担忧的问题。人们发明了许多聪明的方法来向他们在商业、政治、战争和通奸中的伙伴发送秘密信息。在计算机通信的时代，我们假定任何人都可以检查在互联网上传播的比特，我们使用数学技术来打乱我们信息中的比特，以便它只有在传输的端点才能被理解。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

RSA encryption

Private communication has been a concern throughout history. People have developed many clever ways to send secret messages to their partners in business, politics, war, and adultery. In the age of computer communication, we assume that anyone may examine the bits flying around the internet, and we use mathematical techniques to scramble the bits in our message so that it is intelligible only at the endpoints of the transmission.

求助全文

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

来源期刊

100 Years of Math Milestones

自引率

0.00%

发文量

期刊最新文献

Ackermann’s function Skewes’s number National Museum of Mathematics Great Internet Mersenne Prime Search (GIMPS) The 15-theorem