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: Implementing hardware-efficient and high-performance polynomial multiplication in finite fields is crucial for enhancing crypto-systems on silicon, which is desirable for system-on-chip (SoC ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results