Abstract: As the most computing-intensive operation in lattice-based cryptography, polynomial multiplication is the bottleneck for high speed and low-latency implementation of these schemes. In this ...
Abstract: Polynomial multiplication (PM) is the computational bottleneck of lattice-based cryptography, such as post-quantum cryptography (PQC). Designing dedicated hardware accelerators for ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results