FFCSA - Finite Field Constructions, Search, and Algorithms

Nuša Zidarič; Guang Gong; Mark Aagaard; Aleksandar Jurišić; Olexandr Konovalov

doi:10.1145/3614408.3614416

FFCSA - Finite Field Constructions, Search, and Algorithms

Nuša Zidarič^*, Guang Gong, Mark Aagaard, Aleksandar Jurišić, Olexandr Konovalov

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	57-64
Number of pages	8
Journal	ACM Communications in Computer Algebra
Volume	57
Issue number	2
DOIs	https://doi.org/10.1145/3614408.3614416
Publication status	Published - 7 Aug 2023

Keywords

FFCSA
GAP
FSR
Finite field arithmetic
Cryptographic hardware

Access to Document

10.1145/3614408.3614416

Zidaric_2023_ISSAC23-FFCSA_AAM
Copyright © 2023 Association for Computing Machinery. This work has been made available online in accordance with publisher policies or with permission. Permission for further reuse of this content should be sought from the publisher or the rights holder. This is the author created accepted manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at https://doi.org/10.1145/3614408.3614416.
Accepted author manuscript, 571 KB

H2020 OPENDREAMKIT: OPENDREAMKIT (partner)
Linton, S. A. (PI) & Konovalov, O. (CoI)
European Commission
1/09/15 → 31/08/19
Project: Standard

Cite this

@article{e157e1d3256a4d3ca7280798e904b403,

title = "FFCSA - Finite Field Constructions, Search, and Algorithms",

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.",

keywords = "FFCSA, GAP, FSR, Finite field arithmetic, Cryptographic hardware",

author = "Nu{\v s}a Zidari{\v c} and Guang Gong and Mark Aagaard and Aleksandar Juri{\v s}i{\'c} and Olexandr Konovalov",

note = "The 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 project",

year = "2023",

month = aug,

day = "7",

doi = "10.1145/3614408.3614416",

language = "English",

volume = "57",

pages = "57--64",

journal = "ACM Communications in Computer Algebra",

issn = "1932-2240",

publisher = "ACM",

number = "2",

}

TY - JOUR

T1 - FFCSA - Finite Field Constructions, Search, and Algorithms

AU - Zidarič, Nuša

AU - Gong, Guang

AU - Aagaard, Mark

AU - Jurišić, Aleksandar

AU - Konovalov, Olexandr

N1 - The 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 project

PY - 2023/8/7

Y1 - 2023/8/7

N2 - 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.

AB - 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.

KW - FFCSA

KW - GAP

KW - FSR

KW - Finite field arithmetic

KW - Cryptographic hardware

U2 - 10.1145/3614408.3614416

DO - 10.1145/3614408.3614416

M3 - Article

SN - 1932-2240

VL - 57

SP - 57

EP - 64

JO - ACM Communications in Computer Algebra

JF - ACM Communications in Computer Algebra

IS - 2

ER -

FFCSA - Finite Field Constructions, Search, and Algorithms

Abstract

Keywords

Access to Document

Fingerprint

Projects

H2020 OPENDREAMKIT: OPENDREAMKIT (partner)

Cite this