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

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

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 primitives in such cryptosystems, thus the...

Full description

Bibliographic Details
Main Authors: Davide Zoni, Andrea Galimberti, William Fornaciari
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Computer arithmetic
FPGA
hardware design
multiplication
GF2
applied cryptography
Online Access:https://ieeexplore.ieee.org/document/9075203/

Internet

https://ieeexplore.ieee.org/document/9075203/

Similar Items