GF(2163)上的椭圆曲线点乘法

2008 4th Southern Conference on Programmable Logic Pub Date : 2008-03-26 DOI:10.1109/SPL.2008.4547727

J. Deschamps, G. Sutter

{"title":"GF(2163)上的椭圆曲线点乘法","authors":"J. Deschamps, G. Sutter","doi":"10.1109/SPL.2008.4547727","DOIUrl":null,"url":null,"abstract":"This paper describes algorithms and circuits for executing the point-multiplication operation in the particular case of the K-163 NIST-recommended curve. The circuits have been described in VHDL and implemented within the low cost Spartan-3 FPGA devices. Three point-multiplication algorithms are considered: the basic algorithm, the Montgomery algorithm and an algorithm based on the Frobenius map.","PeriodicalId":372678,"journal":{"name":"2008 4th Southern Conference on Programmable Logic","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Elliptic-Curve Point-Multiplication over GF(2163)\",\"authors\":\"J. Deschamps, G. Sutter\",\"doi\":\"10.1109/SPL.2008.4547727\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes algorithms and circuits for executing the point-multiplication operation in the particular case of the K-163 NIST-recommended curve. The circuits have been described in VHDL and implemented within the low cost Spartan-3 FPGA devices. Three point-multiplication algorithms are considered: the basic algorithm, the Montgomery algorithm and an algorithm based on the Frobenius map.\",\"PeriodicalId\":372678,\"journal\":{\"name\":\"2008 4th Southern Conference on Programmable Logic\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-03-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 4th Southern Conference on Programmable Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPL.2008.4547727\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 4th Southern Conference on Programmable Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPL.2008.4547727","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

本文描述了在nist推荐的K-163曲线的特殊情况下执行点乘法运算的算法和电路。电路已在VHDL中描述，并在低成本的Spartan-3 FPGA器件中实现。本文考虑了三种点乘法算法:基本算法、Montgomery算法和基于Frobenius映射的算法。

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

查看原文本刊更多论文

Elliptic-Curve Point-Multiplication over GF(2163)

This paper describes algorithms and circuits for executing the point-multiplication operation in the particular case of the K-163 NIST-recommended curve. The circuits have been described in VHDL and implemented within the low cost Spartan-3 FPGA devices. Three point-multiplication algorithms are considered: the basic algorithm, the Montgomery algorithm and an algorithm based on the Frobenius map.

求助全文

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

来源期刊

2008 4th Southern Conference on Programmable Logic

自引率

0.00%

发文量