{"title":"三元场高速低面积扩展欧几里得反演的实现","authors":"Ibrahim H. Hazmi, F. Gebali, Atef Ibrahim","doi":"10.1109/CCECE.2019.8861557","DOIUrl":null,"url":null,"abstract":"Hardware implementation of the extended Euclidean algorithm (EEA) over ternary field introduces many challenges, include degree evaluations during and after each iteration of the algorithm. This paper presents a novel realization of the traditional EEA over ternary fields in a concurrent manner, resolving the issues stated above by using a former systolic architectural approach. Polynomial division and multiplication in $GF(3^{m})$ are performed concurrently. Accordingly, an EEA-based ternary inverter is built. Then, the complexity of the proposed inverter is analyzed in comparison with efficient designs in the literature, concluding that our design has the lowest area-time complexity.","PeriodicalId":352860,"journal":{"name":"2019 IEEE Canadian Conference of Electrical and Computer Engineering (CCECE)","volume":"447 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Implementation of High Speed and Low Area Extended Euclidean Inversion over Ternary Fields\",\"authors\":\"Ibrahim H. Hazmi, F. Gebali, Atef Ibrahim\",\"doi\":\"10.1109/CCECE.2019.8861557\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Hardware implementation of the extended Euclidean algorithm (EEA) over ternary field introduces many challenges, include degree evaluations during and after each iteration of the algorithm. This paper presents a novel realization of the traditional EEA over ternary fields in a concurrent manner, resolving the issues stated above by using a former systolic architectural approach. Polynomial division and multiplication in $GF(3^{m})$ are performed concurrently. Accordingly, an EEA-based ternary inverter is built. Then, the complexity of the proposed inverter is analyzed in comparison with efficient designs in the literature, concluding that our design has the lowest area-time complexity.\",\"PeriodicalId\":352860,\"journal\":{\"name\":\"2019 IEEE Canadian Conference of Electrical and Computer Engineering (CCECE)\",\"volume\":\"447 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-05-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE Canadian Conference of Electrical and Computer Engineering (CCECE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCECE.2019.8861557\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Canadian Conference of Electrical and Computer Engineering (CCECE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCECE.2019.8861557","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Implementation of High Speed and Low Area Extended Euclidean Inversion over Ternary Fields
Hardware implementation of the extended Euclidean algorithm (EEA) over ternary field introduces many challenges, include degree evaluations during and after each iteration of the algorithm. This paper presents a novel realization of the traditional EEA over ternary fields in a concurrent manner, resolving the issues stated above by using a former systolic architectural approach. Polynomial division and multiplication in $GF(3^{m})$ are performed concurrently. Accordingly, an EEA-based ternary inverter is built. Then, the complexity of the proposed inverter is analyzed in comparison with efficient designs in the literature, concluding that our design has the lowest area-time complexity.