Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Browse all Theses and Dissertations

2016

Finite Field Multiplication

Articles 1 - 2 of 2

Full-Text Articles in Engineering

Fpga Realization Of Low Register Systolic Multipliers Over Gf(2^M), Qiliang Shao Jan 2016

Fpga Realization Of Low Register Systolic Multipliers Over Gf(2^M), Qiliang Shao

Browse all Theses and Dissertations

Finite field multiplication over GF(2^m) is a critical component for elliptic curve cryptography (ECC). National Institute of Standards and Technology (NIST) has recommended five polynomials (two trinomials and three pentanomials) for ECC implementation. Although there are a lot reports available on polynomial basis multipliers, efficient implementation of a design with flexible field-size is quite rare. There is another basis to represent the field called normal basis. Normal basis multiplication over GF(2^m) is widely used in various applications such as elliptic curve cryptography (ECC). As a special class of normal basis with low complexity, Gaussian normal basis (GNB) has received considerable …


Fpga Realization Of Low Register Systolic All One-Polynomial Multipliers Over Gf (2M) And Their Applications In Trinomial Multipliers, Pingxiuqi Chen Jan 2016

Fpga Realization Of Low Register Systolic All One-Polynomial Multipliers Over Gf (2M) And Their Applications In Trinomial Multipliers, Pingxiuqi Chen

Browse all Theses and Dissertations

All-one-polynomial (AOP)-based systolic multipliers over GF (2m) are usually not con-sidered for practical implementation of cryptosystems such as elliptic curve cryptography (ECC) due to security reasons. Besides that, systolic AOP multipliers usually suer from the problem of high register-complexity, especially in field-programmable gate array (FPGA) platforms where the register resources are not that abundant. In this thesis, however, we have shown that the AOP-based systolic multipliers can easily achieve low register-complexity implementations and the proposed architectures can be employed as computation cores to derive ecient implementations of systolic Montgomery multipli-ers based on trinomials, which are recommended by the National Institute …