A generalized method for constructing subquadratic complexity GF(2/sup k/) multipliers
From MaRDI portal
Publication:3417031
DOI10.1109/TC.2004.52zbMath1231.68045MaRDI QIDQ3417031
Publication date: 9 January 2007
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
time complexitiesKaratsuba multiplierconstruction of subquadratic complexity multipliers for even characteristic field extensionssubquadratic space complexitiesWinograd convolution
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Mathematical problems of computer architecture (68M07)
Related Items (8)
Improved Three-Way Split Formulas for Binary Polynomial Multiplication ⋮ Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over $\mathbb{F}_{2^{1223}}$ ⋮ Speedup of bit-parallel Karatsuba multiplier in \(\mathrm{GF}(m^2)\) generated by trinomials ⋮ Efficient multiplications in \(\mathbb F_5^{5n}\) and \(\mathbb F_7^{7n}\) ⋮ Recovering RSA Secret Keys from Noisy Key Bits with Erasures and Errors ⋮ On multiplication in finite fields ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers ⋮ Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering
This page was built for publication: A generalized method for constructing subquadratic complexity GF(2/sup k/) multipliers
