Results 21 to 30 of about 9,400,159 (276)
New Number Theoretic Transform
A new number theoretic transform is introduced. This transform is defined modulo the Mersenne primes, has long transform length which is a power of two, a fast algorithm, and the inverse transform has within a factor of (1/N) the same form as the forward
Holt AGJ, Boussakta S
core +5 more sources
Hardware Acceleration of Number Theoretic Transform in zk-SNARK [PDF]
The proof in zk-SNARK has a fixed length and can be verified quickly, promoting the application of zero-knowledge proof in areas such as digital signature, blockchain, distributed storage, and outsourced computing.
ZHAO Haixu, CHAI Zhilei, HUA Pengcheng, WANG Feng, DING Dong
doaj +1 more source
The Number Theoretic Hilbert Transform [PDF]
This paper presents a general expression for a number-theoretic Hilbert transform (NHT). The transformations preserve the circulant nature of the discrete Hilbert transform (DHT) matrix together with alternating values in each row being zero and non-zero. Specific examples for 4-point, 6-point, and 8-point NHT are provided.
openaire +2 more sources
Adapting Belief Propagation to Counter Shuffling of NTTs
The Number Theoretic Transform (NTT) is a major building block in recently introduced lattice based post-quantum (PQ) cryptography. The NTT was target of a number of recently proposed Belief Propagation (BP)-based Side Channel Attacks (SCAs). Ravi et al.
Julius Hermelink +3 more
doaj +1 more source
Number-Theoretic Transform with Constant Time Computation for Embedded Post-Quantum Cryptography
In this article, we describe the principles and advantages of using the Number-Theoretic Transform (NTT) in post-quantum cryptography. We deal with usages of NTT in post-quantum algorithms included in the competition announced by the National Institute ...
Kupcová Eva, Drutarovský Miloš
doaj +1 more source
Number Theoretic Transform (NTT) FPGA Accelerator
Post-quantum cryptography has become popular in recent years due to advances in quantum computing. Current cryptographic solutions are vulnerable to post-quantum attacks as they can solve computationally hard problems.
Weber, Scott S. +3 more
core +3 more sources
Long Polynomial Modular Multiplication using Low-Complexity Number Theoretic Transform [PDF]
This tutorial aims to establish connections between polynomial modular multiplication over a ring to circular convolution and discrete Fourier transform (DFT).
Parhi, Keshab K., Chiu, Sin-Wei
core +1 more source
In recent years, public-key cryptography has become a fundamental component of digital infrastructures. Such a scenario has to face a new and increasing threat, represented by quantum computers.
Pietro Nannipieri +5 more
doaj +1 more source
Introduction to Number Theoretic Transform
The Number Theoretic Transform (NTT) can be regarded as a variant of the Discrete Fourier Transform. NTT has been quite a powerful mathematical tool in developing Post-Quantum Cryptography and Homomorphic Encryption. The Fourier Transform essentially decomposes a signal into its frequencies. They are traditionally sine or cosine waves.
Banhirup Sengupta +2 more
openaire +2 more sources
Optimization of Parallel Number Theoretic Transform Algorithms for Multi-Core Digital Signal Processors [PDF]
The Number Theoretic Transform (NTT), a finite-field variant of FFT, is critical in cryptography and digital signal processing, but its efficiency on FT-M7032 Digital Signal Processors(DSPs) remains suboptimal due to memory bottlenecks and ...
Dingxing Xie +6 more
doaj +3 more sources

