FFCSA-有限域构造、搜索和算法

IF 0.4 Q4 MATHEMATICS, APPLIED

ACM Communications in Computer Algebra Pub Date : 2023-06-01 DOI:10.1145/3614408.3614416

N. Zidarič, G. Gong, M. Aagaard, Aleksandar Jurisic, Olexandr Konovalov

{"title":"FFCSA-有限域构造、搜索和算法","authors":"N. Zidarič, G. Gong, M. Aagaard, Aleksandar Jurisic, Olexandr Konovalov","doi":"10.1145/3614408.3614416","DOIUrl":null,"url":null,"abstract":"In this work we present the new GAP package FFCSA - Finite Field Constructions, Search, and Algorithms. It was designed to enable Design Space Exploration for hardware implementations of cryptographic algorithms defined over finite fields. FFCSA constructions and searches are used to produce the design space, and FFCSA algorithms, parameterized for the current candidate field, are used to generate expressions needed for implementation in hardware.","PeriodicalId":41965,"journal":{"name":"ACM Communications in Computer Algebra","volume":"57 1","pages":"57 - 64"},"PeriodicalIF":0.4000,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"FFCSA - Finite Field Constructions, Search, and Algorithms\",\"authors\":\"N. Zidarič, G. Gong, M. Aagaard, Aleksandar Jurisic, Olexandr Konovalov\",\"doi\":\"10.1145/3614408.3614416\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work we present the new GAP package FFCSA - Finite Field Constructions, Search, and Algorithms. It was designed to enable Design Space Exploration for hardware implementations of cryptographic algorithms defined over finite fields. FFCSA constructions and searches are used to produce the design space, and FFCSA algorithms, parameterized for the current candidate field, are used to generate expressions needed for implementation in hardware.\",\"PeriodicalId\":41965,\"journal\":{\"name\":\"ACM Communications in Computer Algebra\",\"volume\":\"57 1\",\"pages\":\"57 - 64\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2023-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Communications in Computer Algebra\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3614408.3614416\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Communications in Computer Algebra","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3614408.3614416","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}

引用次数: 0

摘要

在这项工作中，我们提出了新的GAP包FFCSA -有限域构造，搜索和算法。它的设计目的是为在有限域上定义的加密算法的硬件实现启用设计空间探索。FFCSA构造和搜索用于生成设计空间，FFCSA算法(为当前候选字段参数化)用于生成在硬件中实现所需的表达式。

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

查看原文本刊更多论文

FFCSA - Finite Field Constructions, Search, and Algorithms

In this work we present the new GAP package FFCSA - Finite Field Constructions, Search, and Algorithms. It was designed to enable Design Space Exploration for hardware implementations of cryptographic algorithms defined over finite fields. FFCSA constructions and searches are used to produce the design space, and FFCSA algorithms, parameterized for the current candidate field, are used to generate expressions needed for implementation in hardware.

求助全文

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

来源期刊

ACM Communications in Computer Algebra MATHEMATICS, APPLIED-

CiteScore

0.70

自引率

0.00%

发文量