相关实验视频

Updated: May 17, 2025

On-Chip Crystallization and Large-Scale Serial Diffraction at Room Temperature
07:42

On-Chip Crystallization and Large-Scale Serial Diffraction at Room Temperature

Published on: March 11, 2022

1.8K

面积-时间高效管道数理论变换用于Crystals-Kyber

Ayesha Waris1, Arshad Aziz1, Bilal Muhammad Khan1

  • 1National University of Sciences and Technology (NUST), Pakistan.

PloS one
|May 14, 2025
PubMed
概括

这项研究介绍了用于CRYSTALS-Kyber的高效FPGA架构,这是一种抗量子算法. 新设计优化了使用数理论变换 (NTT) 的多项式乘法,提高了性能并减少了资源使用.

更多相关视频

Rapid Repetition Rate Fluctuation Measurement of Soliton Crystals in a Microresonator07:42

Rapid Repetition Rate Fluctuation Measurement of Soliton Crystals in a Microresonator

Published on: December 15, 2021

3.0K
A Photonic System for Generating Unconditional Polarization-Entangled Photons Based on Multiple Quantum Interference00:07

A Photonic System for Generating Unconditional Polarization-Entangled Photons Based on Multiple Quantum Interference

Published on: September 5, 2019

8.3K

相关概念视频

Phasor Arithmetics01:13

Phasor Arithmetics

Phasors and their corresponding sinusoids are interrelated, offering unique insights into the behavior of alternating current (AC) circuits. One way to understand this relationship is through the operations of differentiation and integration in both the time and phasor domains.
When the derivative of a sinusoid is taken in the time domain, it transforms into its corresponding phasor multiplied by j-omega (jω) in the phasor domain, where j is the imaginary unit, and ω is the angular...
220
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
230
Linear Approximation in Time Domain01:21

Linear Approximation in Time Domain

Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
58
Continuous -time Fourier Transform01:11

Continuous -time Fourier Transform

The Fourier series is instrumental in representing periodic functions, offering a powerful method to decompose such functions into a sum of sinusoids. This technique, however, necessitates modification when applied to nonperiodic functions. Consider a pulse-train waveform consisting of a series of rectangular pulses. When these pulses have a finite period, they can be accurately represented by a Fourier series. Yet, as the period approaches infinity, resulting in a single, isolated pulse, the...
251
Discrete-time Fourier transform01:26

Discrete-time Fourier transform

The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
237
Upsampling01:22

Upsampling

Managing signal sampling rates is essential in digital signal processing to maintain signal integrity. A decimated signal, characterized by a reduced frequency range due to its lower sampling rate, can be upsampled by inserting zeros between each sample. This upsampling process expands the original spectrum and introduces repeated spectral replicas at intervals dictated by the new Nyquist frequency. To refine this zero-inserted sequence, it is passed through a lowpass filter with a cutoff...
175