Results 211 to 220 of about 5,425 (258)

FPGA Acceleration of Number Theoretic Transform

Lecture Notes in Computer Science, 2021
Fully Homomorphic Encryption (FHE) is a technique that enables arbitrary computations on encrypted data directly. Number Theoretic Transform (NTT) is a fundamental component in FHE computations as it allows faster polynomial multiplication. However, it is computationally intensive and requires acceleration for practical deployment of FHE.
Rajgopal Kannan, Viktor K Prasanna, Prasanna Viktor K   +2 more
exaly   +2 more sources

Fast Fourier Transformation Based on Number Theoretic Transforms

Journal of the Franklin Institute, 1988
A technique, denoted as FFT/NTT \((FFT=fast\) Fourier transform, \(NTT=number\) theoretic transform), is proposed for the fast computation of DFT (discrete Fourier transform) of a real sequence with prime length \(p=2^ M+1\). This technique is essentially a modification of \textit{Rader}'s method [Proc. IEEE, Vol.
Adhami, Reza, Polge, Robert J.
openaire   +1 more source

A Fast Number Theoretic Finite Radon Transform

2009 Digital Image Computing: Techniques and Applications, 2009
This paper presents a new fast method to map between images and their digital projections based on the Number Theoretic Transform (NTT) and the Finite Radon Transform (FRT). The FRT is a Discrete Radon Transform (DRT) defined on the same finite geometry as the Finite or Discrete Fourier Transform (DFT).
Shekhar Chandra, Imants D. Svalbe
openaire   +2 more sources

Fast Multipliers for Number Theoretic Transforms

IEEE Transactions on Computers, 1978
Summary: When digital filters are implemented with number theoretic transforms (NTTs), the bulk of the computation usually corresponds to multiplications in residue arithmetic. We show that, with the most commonly used NTTs, multiplication can be speeded up at the expense of small additional storage requirements.
openaire   +1 more source

Mersenne numbers rooted on 3 for number theoretic transforms

ICASSP '80. IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005
Number Theoretic Transforms (NTT) have been shown capable of implementing efficiently finite digital convolutions for signal processing applications in voice, video, and pattern recognition areas. In this paper the concept of Generalized Mersenne Numbers (GMN) is introduced with the goal of obtaining a new discrete transform having certain desirable ...
Daniel Minoli, Wendell Nakamine
openaire   +1 more source

Hartley number theoretic transforms

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252), 2002
The Hartley number theoretic transform (HNTT) is introduced, in particular, the Mersenne HNTT is defined and some multiplication free transforms are given.
R.M. Campello de Souza, H.M. de Oliveira, L.B. Espinola Palma, M.M. Campello de Souza   +3 more
openaire   +1 more source

Number theoretic transform based on ternary arithmetic

ICASSP '83. IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005
A number theoretic transform (NTT) is proposed, which can efficiently be computed by using ternary modular arithmetic. The new NTT relaxes the restriction imposed on the convolution length and, as in other efficient NTT's, its computation can be performed by means of data shifts and additions.
Prabhakara C. Balla, Andreas Antoniou
openaire   +1 more source

Conditions for the Existence of Fast Number Theoretic Transforms

IEEE Transactions on Computers, 1981
A new theorem that gives necessary and sufficient conditions for the existence of computationally fast number theoretic transforms is presented. The theorem combines the general conditions for the existence of number theoretic transforms in the rings of integers modulo m with two conditions for high computational efficiency.
openaire   +2 more sources

The design space of the number theoretic transform: A survey

2017 International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation (SAMOS), 2017
The Number Theoretic Transform (NTT) is a necessary part of most Lattice-based cryptographic schemes. In particular, it offers an efficient means to achieve polynomial multiplication within the more efficient ring-based schemes. The NTT is also a crucial component which needs to be implemented in a critical way, since it is often the bottle-neck and ...
Felipe Valencia, Ayesha Khalid, Elizabeth O'Sullivan, Francesco Regazzoni 0001   +3 more
openaire   +2 more sources