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

Social Engineer For Reverse Engineering Exploit Study

@ Independent study | Remote

Application Security Engineer - Remote Friendly

@ Unit21 | San Francisco,CA; New York City; Remote USA;

Cloud Security Specialist

@ AppsFlyer | Herzliya

Malware Analysis Engineer - Canberra, Australia

@ Apple | Canberra, Australian Capital Territory, Australia

Product CISO

@ Fortinet | Sunnyvale, CA, United States

Manager, Security Engineering

@ Thrive | United States - Remote