Results 231 to 240 of about 9,400,159 (276)

PipeNTT: A Pipelined Number Theoretic Transform Architecture

IEEE Transactions on Circuits and Systems II: Express Briefs, 2022
Chak Chung Ray Cheung, Kejie Huang, Lucas Zewen Ye   +2 more
exaly   +2 more sources

Asymmetric Fragile Watermarking Using a Number Theoretic Transform [PDF]

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2009
We propose an asymmetric fragile watermarking technique that uses a number theoretic transform (NTT). Signature data is extracted from a watermarked image by determining correlation functions that are computed using the NTT.
Tsuyoshi Yamamoto
exaly   +2 more sources

A Survey of Software Implementations for the Number Theoretic Transform

, 2023
This survey summarizes the software implementation knowledge of the Number Theoretic Transform (NTT)—a major subroutine of lattice-based cryptosystems.
Ahmet Can Mert, Ferhat Yaman, Emre Karabulut, Erdinç Öztürk, Erkay Savas, Aydin Aysu   +5 more
openaire   +3 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   +3 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   +2 more sources

A Note on the Implementation of the Number Theoretic Transform

2017
The Number Theoretic Transform (NTT) is a time critical function required by many post-quantum cryptographic protocols based on lattices. For example it is commonly used in the context of the Ring Learning With Errors problem (RLWE), which is a popular basis for post-quantum key exchange, digital signature, and encryption.
openaire   +2 more sources

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

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   +2 more sources

Number Theoretic Transforms

1981
Most of the fast convolution techniques discussed so far are essentially algebraic methods which can be implemented with any type of arithmetic. In this chapter, we shall show that the computation of convolutions can be greatly simplified when special arithmetic is used.
openaire   +1 more source