Show simple item record

Files in this item

Thumbnail
Name:
Zidaric_2023_ISSAC23_FFCSA_AAM.pdf
Size:
571.1Kb
Format:
PDF
View/Open

FFCSA - Finite Field Constructions, Search, and Algorithms

Item metadata

dc.contributor.authorZidarič, Nuša
dc.contributor.authorGong, Guang
dc.contributor.authorAagaard, Mark
dc.contributor.authorJurišić, Aleksandar
dc.contributor.authorKonovalov, Olexandr
dc.date.accessioned2023-09-25T15:30:01Z
dc.date.available2023-09-25T15:30:01Z
dc.date.issued2023-08-07
dc.identifier293850801
dc.identifiere157e1d3-256a-4d3c-a728-0798e904b403
dc.identifier85168758413
dc.identifier.citationZidarič , N , Gong , G , Aagaard , M , Jurišić , A & Konovalov , O 2023 , ' FFCSA - Finite Field Constructions, Search, and Algorithms ' , ACM Communications in Computer Algebra , vol. 57 , no. 2 , pp. 57-64 . https://doi.org/10.1145/3614408.3614416en
dc.identifier.issn1932-2240
dc.identifier.otherJisc: 1270956
dc.identifier.urihttps://hdl.handle.net/10023/28447
dc.descriptionThe research of G. Gong and M. Aagaard were supported by NSERC Canada and the researchof N. Zidaric by NSERC Canada and NWO Netherlands through the PROACT project. The research of O.Konovalov was supported by the OpenDreamKit Horizon 2020 European Research Infrastructures projecten
dc.description.abstractIn 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.
dc.format.extent8
dc.format.extent584876
dc.language.isoeng
dc.relation.ispartofACM Communications in Computer Algebraen
dc.subjectFFCSAen
dc.subjectGAPen
dc.subjectFSRen
dc.subjectFinite field arithmeticen
dc.subjectCryptographic hardwareen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subjectQA76 Computer softwareen
dc.subjectT-NDASen
dc.subjectACen
dc.subject.lccQA75en
dc.subject.lccQA76en
dc.titleFFCSA - Finite Field Constructions, Search, and Algorithmsen
dc.typeJournal articleen
dc.contributor.sponsorEuropean Commissionen
dc.contributor.institutionUniversity of St Andrews. School of Computer Scienceen
dc.contributor.institutionUniversity of St Andrews. Institute of Behavioural and Neural Sciencesen
dc.contributor.institutionUniversity of St Andrews. Centre for Interdisciplinary Research in Computational Algebraen
dc.contributor.institutionUniversity of St Andrews. St Andrews GAP Centreen
dc.identifier.doi10.1145/3614408.3614416
dc.description.statusPeer revieweden
dc.identifier.grantnumber676541en


This item appears in the following Collection(s)

Show simple item record

Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.