Results 131 to 140 of about 9,400 (191)

When NTT Meets Karatsuba: Preprocess-then-NTT Technique Revisited

Lecture Notes in Computer Science, 2021
The Number Theoretic Transform (NTT) technique is widely used to implement cryptographic schemes based on the Ring Learning With Errors problem(RLWE), since it provides efficient algorithm for multiplication of polynomials over the finite field. However, the module in NTT must be big enough such that the finite field has some special root of unity ...
Zhu Yiming, Pan Yanbin
exaly   +3 more sources

MCS-NTT: Multi-Chip System Design for NTT Acceleration

2024 IFIP/IEEE 32nd International Conference on Very Large Scale Integration (VLSI-SoC)
Johann Knechtel   +2 more
exaly   +2 more sources

ESC-NTT: An Elastic, Seamless and Compact Architecture for Multi-Parameter NTT Acceleration

2024 Design, Automation & Test in Europe Conference & Exhibition (DATE)
Zhenyu Guan, Xueyan Wang, Song Bian
exaly   +2 more sources

Semiconductor Device Simulation at NTT

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985
The current status of semiconductor device simulation at NTT is described. Device simulators at NTT are classified into two categories. One is the conventional macroscopic approach and the other is microscopic particle analysis using a Monte Carlo method. In this paper, these simulators are introduced together with the more interesting results. Through
Kiyoyuki Yokoyama   +3 more
openaire   +1 more source

3D-NTT: a versatile integral field spectro-imager for the NTT

SPIE Proceedings, 2008
The 3D-NTT is a visible integral field spectro-imager offering two modes. A low resolution mode (R ~ 300 to 6 000) with a large field of view Tunable Filter (17'x17') and a high resolution mode (R ~ 10 000 to 40 000) with a scanning Fabry-Perot (7'x7'). It will be operated as a visitor instrument on the NTT from 2009.
Marcelin, M.   +13 more
openaire   +1 more source

Verification of an Optimized NTT Algorithm

2020
The Number Theoretic Transform (NTT) is an efficient algorithm for computing products of polynomials with coefficients in finite fields. It is a common procedure in lattice-based key-exchange and signature schemes. These new cryptographic algorithms are becoming increasingly important because they are quantum resistant. No quantum algorithm is known to
Jorge A. Navas   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy