{"title":"Julia/Nemo中基于等基因的密码学:一个案例研究","authors":"J. Kieffer, L. Feo","doi":"10.1145/3338637.3338643","DOIUrl":null,"url":null,"abstract":"The Couveignes-Rostovtsev-Stolbunov key-exchange protocol based on isogenies of elliptic curves is of interest because it may resist quantum attacks, but its efficient implementation remains a challenge. We briefly present the computations involved, and efficient algorithms to achieve the critical steps, with timing results for our implementations in Sage and Julia/Nemo.","PeriodicalId":7093,"journal":{"name":"ACM Commun. Comput. Algebra","volume":"30 1","pages":"130-132"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Isogeny-based cryptography in Julia/Nemo: a case study\",\"authors\":\"J. Kieffer, L. Feo\",\"doi\":\"10.1145/3338637.3338643\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Couveignes-Rostovtsev-Stolbunov key-exchange protocol based on isogenies of elliptic curves is of interest because it may resist quantum attacks, but its efficient implementation remains a challenge. We briefly present the computations involved, and efficient algorithms to achieve the critical steps, with timing results for our implementations in Sage and Julia/Nemo.\",\"PeriodicalId\":7093,\"journal\":{\"name\":\"ACM Commun. Comput. Algebra\",\"volume\":\"30 1\",\"pages\":\"130-132\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-05-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Commun. Comput. Algebra\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3338637.3338643\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Commun. Comput. Algebra","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3338637.3338643","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Isogeny-based cryptography in Julia/Nemo: a case study
The Couveignes-Rostovtsev-Stolbunov key-exchange protocol based on isogenies of elliptic curves is of interest because it may resist quantum attacks, but its efficient implementation remains a challenge. We briefly present the computations involved, and efficient algorithms to achieve the critical steps, with timing results for our implementations in Sage and Julia/Nemo.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
