Results 21 to 30 of about 120,753 (284)
IEEE Access, 2021 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
Managing NFV using SDN and control theory [PDF]
, 2015 Control theory and SDN (Software Defined Networking) are key components for NFV (Network Function Virtualization) deployment. However little has been done to use a control-theoretic approach for SDN and NFV management.
Akhtar, Nabeel +2 more
core +2 more sources
The Number Theoretic Hilbert Transform [PDF]
Circuits, Systems, and Signal Processing, 2014 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
QUANTUM ASPECTS OF 2+1 GRAVITY [PDF]
, 1995 We review and systematize recent attempts to canonically quantize general relativity in 2+1 dimensions, defined on space-times $\R\times\Sigma^g$, where $\Sigma^g$ is a compact Riemann surface of genus $g$.
Okai T., R. Loll
core +3 more sources
NTT and Inverse NTT Quantum Circuits in CRYSTALS-Kyber for Post-Quantum Security Evaluation
Applied Sciences, 2023 The emergence of quantum computers threatens current cryptographic systems, and NIST is preparing for the post-quantum era through the post-quantum cryptography (PQC) contest. CRYSTALS-Kyber is a lattice-based cipher suite that is used as a PQC standard.
Gyeongju Song +4 more
doaj +1 more source
Very fast discrete Fourier transform using number theoretic transform [PDF]
IEE Proceedings G (Electronic Circuits and Systems), 1983 Indexing terms: Mathematical techniques, Transforms Abstract: It is shown that number theoretic transforms (NTT) can be used to compute discrete Fourier transform (DFT) very efficiently. By noting some simple properties of number theory and the DFT, the total number of real multiplications for a length-P DFT is reduced to (P — 1).
null Wan-Chi Siu, A.G. Constantinides
openaire +1 more source
Number Theoretic Transforms for Secure Signal Processing [PDF]
IEEE Transactions on Information Forensics and Security, 2017 Multimedia contents are inherently sensitive signals that must be protected whenever they are outsourced to an untrusted environment. This problem becomes a challenge when the untrusted environment must perform some processing on the sensitive signals; a paradigmatic example is Cloud-based signal processing services.
Pedrouzo-Ulloa, Alberto +2 more
openaire +2 more sources
On the Spectrum of Large Random Hermitian Finite-Band Matrices
, 2008 The open problem of calculating the limiting spectrum (or its Shannon transform) of increasingly large random Hermitian finite-band matrices is described. In general, these matrices include a finite number of non-zero diagonals around their main diagonal
Poor, H. Vincent +4 more
core +1 more source
A Flexible NTT-Based Multiplier for Post-Quantum Cryptography
IEEE Access, 2023 In this work an NTT-based (Number Theoretic Transform) multiplier for code-based Post-Quantum Cryptography (PQC) is presented, supporting Quasi Cyclic Low/Moderate-Density Parity-Check (QC LDPC/MDPC) codes.
Kristjane Koleci +3 more
doaj +1 more source
Exact deconvolution using number-theoretic transforms
Computers & Mathematics with Applications, 1988 Let us consider a one- (or two-) dimensional deconvolution problem \(a*x=b\) where * stands for cyclic convolution, a and b are known integer vectors (or matrices) and x is a vector (matrix) of the formal solution in the field of rational numbers \({\mathbb{Q}}\).
Drauschke, G., Tasche, M.
openaire +2 more sources