Post-quantum cryptography has become popular in recent years due to advances in quantum computing. Current cryptographic solutions are vulnerable to post-quantum attacks as they can solve computationally hard problems. Many post-quantum cryptographic schemes rely on lattice-based solutions that heavily relies on polynomial multiplications. However, those latticed-based schemes are inefficient without hardware to accelerate the polynomial multiplication computations that are performed. We introduce a hardware implementation of the Number Theoretic Transform to speed up polynomial multiplication. We developed our design on the xc7vx690t-2ffg1761c Virtex 7 platform. We are able to compute a forward NTT calculation in 5.315 us. A full polynomial multiplication can be done in 20.310 us.

• This report represents the work of one or more WPI undergraduate students submitted to the faculty as evidence of completion of a degree requirement. WPI routinely publishes these reports on its website without editorial or peer review.

Creator

• Hartshorn, Austin J.
• Leon Liu, Humberto A.
• Qiao, Noel F.
• Weber, Scott S.

Publisher

• Worcester Polytechnic Institute

Identifier

• E-project-051420-162339

Advisor

• Doroz, Yarkin

Year

• 2020

Date created

• 2020-05-14

Resource type

• Major Qualifying Project

Major

• Electrical & Computer Engineering

Rights statement

• In Copyright