Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity

DOI10.1007/978-3-642-17401-8_17zbMath1253.94040OpenAlexW1832661015MaRDI QIDQ3058727

Murat Cenk, Sedat Akleylek, Ferruh Özbudak

Publication date: 7 December 2010

Published in: Progress in Cryptology - INDOCRYPT 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17401-8_17

zbMATH Keywords

Charlier polynomialspolynomial multiplicationbinary field representationsubquadratic space complexity

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Free storage basis conversion over finite fields ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers

This page was built for publication: Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity