Paper 2012/545 Original: eprint.iacr.org/2012/545 ↗
A Versatile Multi-Input Multiplier over Finite Fields
Abstract
Multiplication of three elements over finite fields is used extensively in multivariate public key cryptography and solving system of linear equations over finite fields. This contribution shows the enhancements of multiplication of three elements over finite fields by using specific architecture. We firstly propose a versatile multi-input multiplier over finite fields. The parameters of this multiplier can be changed according to the requirement of the users which makes it reusable in different applications. Our evaluation of this multiplier gives optimum choices for multiplication of three elements over finite fields. Implemented results show that we takes $22.062$ ns and $16.354$ ns to execute each multiplication of three elements over $GF((2^4)^2)$ based on table look-up and polynomial basis on a FPGA respectively. Experimental results and mathematical proofs clearly demonstrate the improvement of the proposed versatile multiplier over finite fields.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2012-11-04: last updated
- 2012-09-20: published
- Short URL
- https://ia.cr/2012/545
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2012/545,
author = {Haibo Yi and Shaohua Tang and Lingling Xu},
title = {A Versatile Multi-Input Multiplier over Finite Fields},
howpublished = {Cryptology {ePrint} Archive, Paper 2012/545},
year = {2012},
url = {https://eprint.iacr.org/2012/545}
}