M. Morales-Sandoval, C. F. Uribe, R. Cumplido, I. Algredo-Badillo
{"title":"椭圆曲线标量乘法的运行时可重构协处理器","authors":"M. Morales-Sandoval, C. F. Uribe, R. Cumplido, I. Algredo-Badillo","doi":"10.1109/ENC.2009.57","DOIUrl":null,"url":null,"abstract":"This paper reports a run-time reconfigurable co-processor for scalar multiplication in elliptic curve cryptography. By reconfiguration, the co-processor can support various finite field orders and hence, different security levels. This is a contribution to solve the current interoperability problems in elliptic curve cryptography. We report the co-processor hardware organization and the cost in terms of area and speed of the reconfigurable solution compared to a static implementation.","PeriodicalId":273670,"journal":{"name":"2009 Mexican International Conference on Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Run Time Reconfigurable Co-processor for Elliptic Curve Scalar Multiplication\",\"authors\":\"M. Morales-Sandoval, C. F. Uribe, R. Cumplido, I. Algredo-Badillo\",\"doi\":\"10.1109/ENC.2009.57\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper reports a run-time reconfigurable co-processor for scalar multiplication in elliptic curve cryptography. By reconfiguration, the co-processor can support various finite field orders and hence, different security levels. This is a contribution to solve the current interoperability problems in elliptic curve cryptography. We report the co-processor hardware organization and the cost in terms of area and speed of the reconfigurable solution compared to a static implementation.\",\"PeriodicalId\":273670,\"journal\":{\"name\":\"2009 Mexican International Conference on Computer Science\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-09-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Mexican International Conference on Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ENC.2009.57\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Mexican International Conference on Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ENC.2009.57","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Run Time Reconfigurable Co-processor for Elliptic Curve Scalar Multiplication
This paper reports a run-time reconfigurable co-processor for scalar multiplication in elliptic curve cryptography. By reconfiguration, the co-processor can support various finite field orders and hence, different security levels. This is a contribution to solve the current interoperability problems in elliptic curve cryptography. We report the co-processor hardware organization and the cost in terms of area and speed of the reconfigurable solution compared to a static implementation.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
