{"title":"求解有限域线性方程组的小型FPGA实现","authors":"Haibo Yi, Weijian Li","doi":"10.1109/ICSESS.2015.7339120","DOIUrl":null,"url":null,"abstract":"Solving systems of linear equations in finite fields is among the most fundamental operations and used extensively in areas of cryptography, signal processing and clustered file system. In order to implement such systems, it is desirable to improve solving systems of linear equations. We propose FPGA implementations for Gaussian elimination in finite fields. Experimental results and comparisons show that our designs provide significant reductions in both area and clock-area product.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Small FPGA implementations for solving systems of linear equations in finite fields\",\"authors\":\"Haibo Yi, Weijian Li\",\"doi\":\"10.1109/ICSESS.2015.7339120\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Solving systems of linear equations in finite fields is among the most fundamental operations and used extensively in areas of cryptography, signal processing and clustered file system. In order to implement such systems, it is desirable to improve solving systems of linear equations. We propose FPGA implementations for Gaussian elimination in finite fields. Experimental results and comparisons show that our designs provide significant reductions in both area and clock-area product.\",\"PeriodicalId\":335871,\"journal\":{\"name\":\"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSESS.2015.7339120\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSESS.2015.7339120","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Small FPGA implementations for solving systems of linear equations in finite fields
Solving systems of linear equations in finite fields is among the most fundamental operations and used extensively in areas of cryptography, signal processing and clustered file system. In order to implement such systems, it is desirable to improve solving systems of linear equations. We propose FPGA implementations for Gaussian elimination in finite fields. Experimental results and comparisons show that our designs provide significant reductions in both area and clock-area product.