High-speed hardware architecture for implementations of multivariate signature generations on FPGAs
Abstract Multivariate signature belongs to Multivariate-Quadratic-Equations Public Key Cryptography (MPKC), which is secure to quantum computer attacks. Compared with RSA and ECC, it is required to speed up multivariate signature implementations. A high-speed hardware architecture for signature gene...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2018-05-01
|
Series: | EURASIP Journal on Wireless Communications and Networking |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1186/s13638-018-1117-2 |
id |
doaj-1909fe56c3304a6b950963038d5743d0 |
---|---|
record_format |
Article |
spelling |
doaj-1909fe56c3304a6b950963038d5743d02020-11-25T00:39:41ZengSpringerOpenEURASIP Journal on Wireless Communications and Networking1687-14992018-05-01201811910.1186/s13638-018-1117-2High-speed hardware architecture for implementations of multivariate signature generations on FPGAsHaibo Yi0Zhe Nie1School of Computer Engineering, Shenzhen PolytechnicSchool of Computer Engineering, Shenzhen PolytechnicAbstract Multivariate signature belongs to Multivariate-Quadratic-Equations Public Key Cryptography (MPKC), which is secure to quantum computer attacks. Compared with RSA and ECC, it is required to speed up multivariate signature implementations. A high-speed hardware architecture for signature generations of a multivariate scheme is proposed in this paper. The main computations of signature generations of multivariate schemes are additions, multiplications, inversions, and solving systems of linear equations (LSEs) in a finite field. Thus, we improve the finite field multiplications via using composite field expression and design a finite field inversion via using binary trees. Besides, we improve solving LSEs in a finite field based on a variant algorithm of Gauss-Jordan elimination and use the XOR gates to compute additions. We implement the high-speed hardware architecture based on the above improvements on an Altera Stratix Field-Programmable Gate Array (FPGA), which shows that it takes only 90 clock cycles and 0.9 μs to generate a multivariate signature. The comparison shows that the hardware architecture is much faster than other implementations.http://link.springer.com/article/10.1186/s13638-018-1117-2Cryptographic systemMultivariate-Quadratic-Equations Public Key Cryptography (MPKC)Multivariate signatureField-Programmable Gate Array (FPGA) |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Haibo Yi Zhe Nie |
spellingShingle |
Haibo Yi Zhe Nie High-speed hardware architecture for implementations of multivariate signature generations on FPGAs EURASIP Journal on Wireless Communications and Networking Cryptographic system Multivariate-Quadratic-Equations Public Key Cryptography (MPKC) Multivariate signature Field-Programmable Gate Array (FPGA) |
author_facet |
Haibo Yi Zhe Nie |
author_sort |
Haibo Yi |
title |
High-speed hardware architecture for implementations of multivariate signature generations on FPGAs |
title_short |
High-speed hardware architecture for implementations of multivariate signature generations on FPGAs |
title_full |
High-speed hardware architecture for implementations of multivariate signature generations on FPGAs |
title_fullStr |
High-speed hardware architecture for implementations of multivariate signature generations on FPGAs |
title_full_unstemmed |
High-speed hardware architecture for implementations of multivariate signature generations on FPGAs |
title_sort |
high-speed hardware architecture for implementations of multivariate signature generations on fpgas |
publisher |
SpringerOpen |
series |
EURASIP Journal on Wireless Communications and Networking |
issn |
1687-1499 |
publishDate |
2018-05-01 |
description |
Abstract Multivariate signature belongs to Multivariate-Quadratic-Equations Public Key Cryptography (MPKC), which is secure to quantum computer attacks. Compared with RSA and ECC, it is required to speed up multivariate signature implementations. A high-speed hardware architecture for signature generations of a multivariate scheme is proposed in this paper. The main computations of signature generations of multivariate schemes are additions, multiplications, inversions, and solving systems of linear equations (LSEs) in a finite field. Thus, we improve the finite field multiplications via using composite field expression and design a finite field inversion via using binary trees. Besides, we improve solving LSEs in a finite field based on a variant algorithm of Gauss-Jordan elimination and use the XOR gates to compute additions. We implement the high-speed hardware architecture based on the above improvements on an Altera Stratix Field-Programmable Gate Array (FPGA), which shows that it takes only 90 clock cycles and 0.9 μs to generate a multivariate signature. The comparison shows that the hardware architecture is much faster than other implementations. |
topic |
Cryptographic system Multivariate-Quadratic-Equations Public Key Cryptography (MPKC) Multivariate signature Field-Programmable Gate Array (FPGA) |
url |
http://link.springer.com/article/10.1186/s13638-018-1117-2 |
work_keys_str_mv |
AT haiboyi highspeedhardwarearchitectureforimplementationsofmultivariatesignaturegenerationsonfpgas AT zhenie highspeedhardwarearchitectureforimplementationsofmultivariatesignaturegenerationsonfpgas |
_version_ |
1725293065797632000 |