A recent paradigm put forth by Boyle et al.(CCS 2018, Crypto 2019) showed how
pseudorandom correlation generators (PCG) can be used to generate large amounts of …

BIKE is a key encapsulation mechanism that entered the third round of the NIST post-
quantum cryptography standardization process. This paper presents two constant-time …

The novel methods for binary discrete Fourier transform (DFT) computation over the finite
field have been proposed. The methods are based on a binary trace calculation over the …

A zero-knowledge proof is a cryptographic primitive that enables a prover to convince a
verifier the validity of a mathematical statement (an NP statement) without revealing any …

We show a new algorithm and its implementation for multiplying bit-polynomials of large
degrees. The algorithm is based on evaluating polynomials at a specific set comprising a …

We introduce a polylogarithmic-verifier polynomial commitment scheme for multilinears over
towers of binary fields. To achieve this, we adapt an idea of Zeilberger, Chen and Fisch's …

We describe new fast algorithms for evaluation and interpolation on the “novel” polynomial
basis over finite fields of characteristic two introduced by Lin et al.(2014). Fast algorithms are …

In this paper, we investigate the properties of the novel polynomial basis proposed by Lin,
Chung, and Han over Cantor-constructed binary extension finite fields and propose an …

Post-quantum cryptography addresses the threat to our established asymmetric
cryptography posed by quantum computers. Like conventional cryptography …

Remote communications are taking more and more importance in our everyday lives: from
accessing our bank accounts and health data, communicating with family, friends and co …