Jove
Visualize
Contact Us

Related Concept Videos

Phasor Arithmetics01:13

Phasor Arithmetics

220
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

230
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

58
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

251
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

237
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

175
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

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Blockchain-enabled identity management for IoT: a multi-layered defense against adversarial AI.

Scientific reports·2026
Same author

Pipelined and conflict-free number theoretic transform accelerator for CRYSTALS-Kyber on FPGA.

PloS one·2025
Same author

Optimization of satellite-based communication links.

PloS one·2025
Same author

Synergistic transfer learning and adversarial networks for breast cancer diagnosis: benign vs. invasive classification.

Scientific reports·2025
Same author

Low profile high gain RHCP antenna for L-Band and S-Band using rectangular ring metasurface with backlobe suppression.

PloS one·2024
Same author

A Low Cost Structurally Optimized Design for Diverse Filter Types.

PloS one·2016
Same journal

Analysis of strength degradation of coal and rock masses and stability of mined areas under long term immersion environment.

PloS one·2026
Same journal

Biogenic Silver-Selenium nanocomposite with anticancer activity and potent efficacy against vancomycin-resistant Staphylococcus aureus.

PloS one·2026
Same journal

Preparation and physicochemical characterization of a biodegradable chitosan/carboxymethyl cellulose hydrogel synthesized in NaOH/urea medium.

PloS one·2026
Same journal

Action-guilt, survivor-guilt, and depression in combat-related PTSD.

PloS one·2026
Same journal

Explainable machine learning for predicting activities of daily living at discharge in stroke patients: A retrospective study using SHAP interpretability.

PloS one·2026
Same journal

Deep learning based two-way feature depiction model for brain tumor detection.

PloS one·2026
See all related articles
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Video

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

Area-time efficient pipelined number theoretic transform for CRYSTALS-Kyber.

Ayesha Waris1, Arshad Aziz1, Bilal Muhammad Khan1

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

Plos One
|May 14, 2025
PubMed
Summary
This summary is machine-generated.

This study introduces efficient FPGA architectures for CRYSTALS-Kyber, a quantum-resistant algorithm. The new designs optimize polynomial multiplication using the Number Theoretic Transform (NTT), improving performance and reducing resource usage.

More Related Videos

Rapid Repetition Rate Fluctuation Measurement of Soliton Crystals in a Microresonator
07: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 Interference
00:07

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

Published on: September 5, 2019

8.3K

Related Experiment Videos

Last 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
Rapid Repetition Rate Fluctuation Measurement of Soliton Crystals in a Microresonator
07: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 Interference
00:07

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

Published on: September 5, 2019

8.3K

Area of Science:

  • Cryptography and Security
  • Hardware Acceleration
  • Post-Quantum Cryptography

Background:

  • CRYSTALS-Kyber, a NIST-standardized quantum-resistant algorithm, faces performance bottlenecks in polynomial multiplication.
  • Number Theoretic Transform (NTT) is crucial for Kyber's polynomial multiplication, necessitating efficient hardware implementations.

Purpose of the Study:

  • To develop and evaluate novel parallel FPGA architectures for accelerating CRYSTALS-Kyber's NTT-based polynomial multiplication.
  • To optimize resource utilization and enhance the performance of Kyber's core computational tasks.

Main Methods:

  • Implementation of two parallel architectures using the Multi-Path Delay Commutator (MDC) approach on FPGAs.
  • Adoption of resource sharing for Polynomial Multiplication (PWM) operations via MDC NTT/INTT architecture.
  • Application of architectural optimizations including FIFO-based memory, LUT-based modular multipliers, and distributed-ROM for twiddle factors.

Main Results:

  • Developed BRAM and DSP-free designs achieving a 68% improved area-time product for PWM operations.
  • The two-parallel MDC architecture demonstrated superior performance compared to state-of-the-art designs, utilizing 29% fewer resources.
  • Successful implementation on a Xilinx Artix-7 XC7A100T-3 device using Verilog HDL.

Conclusions:

  • The proposed MDC-based parallel architectures offer significant improvements in area-time product and resource efficiency for CRYSTALS-Kyber.
  • These optimized designs provide a viable solution for high-performance, resource-constrained implementations of post-quantum cryptography algorithms.
  • The study highlights the effectiveness of architectural-level optimizations for accelerating cryptographic primitives on FPGAs.