Lattice-based NIST PQC finalists need efficient multiplication in $\mathbb {Z} _q [x]/(f (x)) $.
Multiplication in this ring can be performed very efficiently via number theoretic transform …

We show that the step “modulo the degree-n field generating irreducible polynomial” in the
classical definition of the GF (2 n) multiplication operation can be avoided. This leads to an …

Some applications like cryptography involve a large number of multiplications of binary
polynomial. In this paper, we consider two-, three-, and four-way methods for parallel …

Polynomial multiplication is a fundamental operation in security and cryptography
applications. However, traditional polynomial multiplication algorithms suffer from high …

In this paper, we present new parallel polynomial multiplication formulas which result in
subquadratic space complexity. The schemes are based on a recently proposed block …

Public key cryptosystems in both classical and post-quantum settings usually involve a lot of
computations. The amount as well as the type of computations involved vary among these …

Comments on “Multiway Splitting Method for Toeplitz Matrix Vector Product”
Page 1 Comments on “Multiway Splitting Method for Toeplitz Matrix Vector Product” Sun-Mi …

Multiplication schemes based on Toeplitz matrix-vector product (TMVP) have been
proposed by many researchers. TMVP can be computed using the recursive two-way and …

Multiplication of polynomials with large integer coefficients and very high degree is used in
cryptography. Residue number system (RNS) helps distribute a very large integer over a set …