Nov. 9, 2023, 2:10 a.m. | Suraj Mandal, Debapriya Basu Roy

cs.CR updates on arXiv.org arxiv.org

Large-degree polynomial multiplication is an integral component of
post-quantum secure lattice-based cryptographic algorithms like CRYSTALS-Kyber
and Dilithium. The computational complexity of large-degree polynomial
multiplication can be reduced significantly through Number Theoretic
Transformation (NTT). In this paper, we aim to develop a unified and shared NTT
architecture that can support polynomial multiplication for both CRYSTALS-Kyber
and Dilithium. More specifically, in this paper, we have proposed three
different unified architectures for NTT multiplication in CRYSTALS-Kyber and
Dilithium with varying numbers of configurable …

aim algorithms complexity computational cryptographic cryptographic algorithms crystals-dilithium crystals-kyber design fpga framework hardware large ntt post-quantum quantum quantum secure targeting transformation

CyberSOC Technical Lead

@ Integrity360 | Sandyford, Dublin, Ireland

Cyber Security Strategy Consultant

@ Capco | New York City

Cyber Security Senior Consultant

@ Capco | Chicago, IL

Sr. Product Manager

@ MixMode | Remote, US

Security Compliance Strategist

@ Grab | Petaling Jaya, Malaysia

Cloud Security Architect, Lead

@ Booz Allen Hamilton | USA, VA, McLean (1500 Tysons McLean Dr)