Comparison of Hardware Complexity of Multipliers GF(p^)

The article discusses the use of Galois field (GF) multipliers for cryptographic data protection based on elliptical curves. It recommends using extended Galois fields with characteristics \mathrm{d} > 2 for digital signatures. The article proposes a criterion for determining the best field to us...

Full description

Saved in:
Bibliographic Details
Main Authors: Zholubak, Ivan, Hlukhov, Valeriy, Muliarevych, Oleksandr
Format: Conference Proceeding
Language:English
Subjects:
adder
Complexity theory
Data protection
field characteristic
Generators
Hardware
IP core generator
Logic gates
multiplier
multiplier generator
Pipelines
the order of the generating polynomial
VHDL
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The article discusses the use of Galois field (GF) multipliers for cryptographic data protection based on elliptical curves. It recommends using extended Galois fields with characteristics \mathrm{d} > 2 for digital signatures. The article proposes a criterion for determining the best field to use for data protection. It also describes methods for creating cryptoprocessors cores, including a VHDL generator for extended Galois field multipliers. However, generating field multipliers with large characteristics can be time-consuming. To improve efficiency, the article suggests simplifying the design and minimizing logic gates in an FPGA. The article determines the best fields for data protection based on the selected criterion and a certain algorithm.
ISSN:2770-4254
DOI:10.1109/IDAACS58523.2023.10348861