Results 61 to 70 of about 120,587 (184)

A Pipelined Hardware Design of FNTT and INTT of CRYSTALS-Kyber PQC Algorithm

open access: yesInformation
Lattice-based post-quantum cryptography (PQC) algorithms demand number theoretic transform (NTT)-based polynomial multiplications. NTT-based polynomials’ multiplication relies on the computation of forward number theoretic transform (FNTT) and inverse ...
Muhammad Rashid   +4 more
doaj   +1 more source

Identifying generators for number theoretic transforms

open access: yesElectronics Letters, 1996
The author presents results that can be used to obtain all the possible generators for a given number theoretic transform (NTT). A generalisation of the well known Euler theorem is derived which can be used to determine all the generators of a given NTT once the generators over the underlying finite field are identified.
openaire   +1 more source

Compact and Low-Latency FPGA-Based Number Theoretic Transform Architecture for CRYSTALS Kyber Postquantum Cryptography Scheme

open access: yesInformation
In the modern era of the Internet of Things (IoT), especially with the rapid development of quantum computers, the implementation of postquantum cryptography algorithms in numerous terminals allows them to defend against potential future quantum attack ...
Binh Kieu-Do-Nguyen   +6 more
doaj   +1 more source

Fractional angular transform: a number‐theoretic approach

open access: yesElectronics Letters, 2019
In this Letter, the authors introduce a fractional angular number transform (FrANT). The new transform corresponds to a finite field version of the complex‐valued discrete fractional angular transform and, therefore, its computation requires integer arithmetic only. Differently from other number‐theoretic transforms, the possible lengths of an FrANT do
R.B.D. Figueiredo, J.B. Lima
openaire   +1 more source

Through-Wall Image Enhancement Based on Singular Value Decomposition

open access: yesInternational Journal of Antennas and Propagation, 2012
Singular value decomposition and information theoretic criterion-based image enhancement is proposed for through-wall imaging. The scheme is capable of discriminating target, clutter, and noise subspaces.
Muhammad Mohsin Riaz, Abdul Ghafoor
doaj   +1 more source

RTL fast convolution using the mersenne number transform [PDF]

open access: yes, 1997
VHDL is a versatile high level language for the specification and simulation of hardware components. Here a functional VHDL model is presented for performing fast convolution based on Mersenne's number theoretic transform.\nFor filtering a rather long ...
Bria, Oscar N.   +1 more
core   +1 more source

Introduction to Number Theoretic Transform

open access: yes
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.
Sengupta, Banhirup   +2 more
openaire   +2 more sources

Hints from Hertz: Dynamic Frequency Scaling Side-Channel Analysis of Number Theoretic Transform in Lattice-Based KEMs

open access: yesTransactions on Cryptographic Hardware and Embedded Systems
Number Theoretic Transform (NTT) has been widely used in accelerating computations in lattice-based cryptography. However, attackers can potentially launch power analysis targeting the NTT because it is one of the most time-consuming parts of the ...
Tianrun Yu   +5 more
doaj   +1 more source

Unif-NTT: A Unified Hardware Design of Forward and Inverse NTT for PQC Algorithms

open access: yesIEEE Access
Polynomial multiplications based on the number theoretic transform (NTT) are critical in lattice-based post-quantum cryptography algorithms. Therefore, this paper presents a platform-agnostic unified hardware accelerator design (Unif-NTT) to compute the ...
Ali Yahya Hummdi   +5 more
doaj   +1 more source

A Bootstrapping-Capable Configurable NTT Architecture for Fully Homomorphic Encryption

open access: yesIEEE Access
Fully homomorphic encryption (FHE) provides a solution to privacy-preserving applications because of its ability to perform computations on encrypted data without exposing raw data.
Rella Mareta   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy