Based on 2 k High-speed processing acceleration method and system for NTT-free lattice-based cryptography
By using a modular NTT-free lattice cryptography acceleration method, the modular space of the lattice polynomial is designed as a bitwise AND operation, which solves the problems of high resource consumption, long computation path and high power consumption in the hardware implementation of existing NTT algorithms. This achieves hardware resource saving and security improvement, and is suitable for resource-constrained embedded systems and autonomous intelligent agents.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- BEIJING LANGKONG QUANTUM TECHNOLOGY CO LTD
- Filing Date
- 2026-05-09
- Publication Date
- 2026-07-14
AI Technical Summary
Existing NTT-based post-quantum cryptography algorithms suffer from high resource consumption, long computational paths, high power consumption, and difficulties in security hardening in resource-constrained hardware implementations with high real-time requirements, making them difficult to adapt to next-generation autonomous intelligent systems.
A modular NTT-free lattice cryptography acceleration method is adopted. By designing the modular space of the lattice polynomial as a bitwise AND operation, polynomial multiplication is performed directly in the time domain. Hardware masks and gate circuits are used for modular reduction to avoid complex mathematical modulo operations.
It achieves extreme hardware resource conservation and zero cycle latency, improves security, and is suitable for resource-constrained embedded systems and autonomous intelligent agents, meeting the requirements of high concurrency and ultra-low latency.
Smart Images

Figure CN122394787A_ABST