Andrea Galimberti

Flexible and Scalable FPGA-Oriented Design of Multipliers for Large Binary Polynomials

2020 · IEEE Access

With the recent advances in quantum computing, code-based cryptography is foreseen to be one of the few mathematical solutions to design quantum resistant public-key cryptosystems. The binary polynomial multiplication dominates the computational time of the …