loading page

Efficient Twiddle Factor Generation for Post Quantum Cryptography FALCON-based Number Theoretic Transform
  • +2
  • Ghada Alsuhli,
  • Hani Saleh,
  • Mahmoud Al-Qutayri,
  • Baker Mohammad,
  • Thanos Stouraitis
Ghada Alsuhli
Department of Computer and Communication Engineering, System-on-Chip Center, Khalifa University

Corresponding Author:[email protected]

Author Profile
Hani Saleh
Department of Computer and Communication Engineering, System-on-Chip Center, Khalifa University
Mahmoud Al-Qutayri
Department of Computer and Communication Engineering, System-on-Chip Center, Khalifa University
Baker Mohammad
Department of Computer and Communication Engineering, System-on-Chip Center, Khalifa University
Thanos Stouraitis
Department of Computer and Communication Engineering, System-on-Chip Center, Khalifa University

Abstract

Area and power-efficient hardware implementations are crucial for the widespread adoption of post-quantum cryptography (PQC) algorithms like FALCON. One of the main operations in FALCON is the Number Theoretic Transform (NTT), which needs to be performed with many prime numbers. Having one set of twiddle factors (TFs) for each prime makes storing all of these TFs impractical. In this paper, we propose an architecture for generating TFs on the fly for FALCON-oriented NTT, designed for area and power efficiency. Our approach dynamically generates TFs during NTT computations, significantly reducing on-chip memory requirements. The ASIC implementation results demonstrate significant improvements, with the proposed design reducing on-chip memory requirements by 99%, occupying 95% less area, and consuming 87.4% less power compared to the traditional ROM-based implementation. Furthermore, our design achieved a much higher maximum clock frequency, indicating superior performance in accessing twiddle factors. These findings highlight the potential of our proposed architecture for efficient hardware implementations of FALCON-based cryptographic systems.
01 Apr 2024Submitted to TechRxiv
01 Apr 2024Published in TechRxiv