Jove
Visualize
Contact Us
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 Concept Videos

Fast Fourier Transform01:10

Fast Fourier Transform

410
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...
410
Phasor Arithmetics01:13

Phasor Arithmetics

339
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...
339
Fast Decoupled and DC Powerflow01:24

Fast Decoupled and DC Powerflow

246
The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:
246
Discrete-time Fourier transform01:26

Discrete-time Fourier transform

397
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...
397
Linear Approximation in Time Domain01:21

Linear Approximation in Time Domain

110
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,...
110
Continuous -time Fourier Transform01:11

Continuous -time Fourier Transform

358
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...
358

You might also read

Related Articles

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

Sort by
Same author

Experimentally Validated Quantum-Secure Federated Learning over a Multi-user Quantum Network.

Research (Washington, D.C.)·2026
Same author

Experimental asymmetric relativistic zero-knowledge proofs with unconditional security.

Nature communications·2026
Same author

Interfacial dipolar interactions drive giant second-harmonic generation in 2D organic-inorganic heterostructures.

Nature communications·2026
Same author

Time-bin encoded quantum key distribution over 120 km with a telecom quantum dot source.

Light, science & applications·2026
Same author

Experimental coherent one-way quantum key distribution with simplicity and practical security.

Science advances·2026
Same author

Experimental Efficient Source-Independent Quantum Conference Key Agreement.

Research (Washington, D.C.)·2025
Same journal

Research on a Regional Availability Evaluation Model for Road-Area High-Entropy Energy Based on Synergy Factors.

Entropy (Basel, Switzerland)·2026
Same journal

Atmospheric Turbulence Channel Modeling and Performance Analysis of a CO-ZP-OFDM Coherent Optical Communication System for UAV Air-to-Ground Scenarios.

Entropy (Basel, Switzerland)·2026
Same journal

Information Geometry and Asymptotic Theory for SMML Estimators.

Entropy (Basel, Switzerland)·2026
Same journal

Correlation Entropy and Power-Law Kinetics.

Entropy (Basel, Switzerland)·2026
Same journal

Research on the Contagion of Systemic Financial Risk Under the Impact of Climate Risks-From the Perspective of Complex Networks and Machine Learning.

Entropy (Basel, Switzerland)·2026
Same journal

The Statistical-Mechanical Meaning of the Wave Function of Quantum Mechanics.

Entropy (Basel, Switzerland)·2026
See all related articles

Related Experiment Video

Updated: Jul 30, 2025

Characterization of Anisotropic Leaky Mode Modulators for Holovideo
09:36

Characterization of Anisotropic Leaky Mode Modulators for Holovideo

Published on: March 19, 2016

8.0K

High-Speed Variable Polynomial Toeplitz Hash Algorithm Based on FPGA.

Si-Cheng Huang1, Shan Huang2, Hua-Lei Yin2

  • 1National Synchrotron Radiation Laboratory, State Key Laboratory of Particle Detection and Electronics, University of Science and Technology of China, Hefei 230029, China.

Entropy (Basel, Switzerland)
|May 16, 2023
PubMed
Summary
This summary is machine-generated.

This study introduces variational irreducible polynomials for faster, more secure authentication in Quantum Key Distribution (QKD) networks. The new method significantly boosts processing speed and enhances security against attacks.

Keywords:
Fast Modular Composition AlgorithmField-Programmable Gate ArraySecure Hash Algorithmquantum digital authenticationvariable irreducible polynomial

More Related Videos

Efficient and Scalable Production of Full-length Human Huntingtin Variants in Mammalian Cells using a Transient Expression System
10:52

Efficient and Scalable Production of Full-length Human Huntingtin Variants in Mammalian Cells using a Transient Expression System

Published on: December 10, 2021

2.6K
Detection of Rare Genomic Variants from Pooled Sequencing Using SPLINTER
14:06

Detection of Rare Genomic Variants from Pooled Sequencing Using SPLINTER

Published on: June 23, 2012

15.3K

Related Experiment Videos

Last Updated: Jul 30, 2025

Characterization of Anisotropic Leaky Mode Modulators for Holovideo
09:36

Characterization of Anisotropic Leaky Mode Modulators for Holovideo

Published on: March 19, 2016

8.0K
Efficient and Scalable Production of Full-length Human Huntingtin Variants in Mammalian Cells using a Transient Expression System
10:52

Efficient and Scalable Production of Full-length Human Huntingtin Variants in Mammalian Cells using a Transient Expression System

Published on: December 10, 2021

2.6K
Detection of Rare Genomic Variants from Pooled Sequencing Using SPLINTER
14:06

Detection of Rare Genomic Variants from Pooled Sequencing Using SPLINTER

Published on: June 23, 2012

15.3K

Area of Science:

  • Quantum Information Science
  • Cryptography
  • Computer Engineering

Background:

  • Authentication protocols are vital for secure data exchange in Quantum Key Distribution (QKD) networks.
  • Current Secure Hash Algorithm (SHA) implementations using fixed irreducible polynomials in FPGAs are limited to 1 Gbps and pose security risks.
  • The fixed nature of polynomials restricts parallel processing and allows attackers to deduce algorithm details.

Purpose of the Study:

  • To propose and implement a novel method for enhancing authentication protocols in QKD networks using variational irreducible polynomials on FPGAs.
  • To accelerate data processing speeds beyond current limitations.
  • To improve the security of authentication protocols against potential attacks.

Main Methods:

  • Implementing variational irreducible polynomials within a hashing algorithm on Field-Programmable Gate Arrays (FPGAs).
  • Utilizing real-time computation of equivalent polynomials and dynamic updating of the Toeplitz matrix with pipeline operations.
  • Leveraging irreducible polynomials as characteristic functions for Linear Feedback Shift Registers (LFSRs) to generate pseudo-random sequences.

Main Results:

  • Achieved an operational rate of 6.8 Gbps, a significant increase from the previous 1 Gbps.
  • Enhanced the security of the authentication protocol by employing dynamic, variational polynomials.
  • Demonstrated the potential for extending the optimized algorithm to quantum randomness extraction, increasing random number generation rates.

Conclusions:

  • The proposed method significantly accelerates QKD authentication protocols through variational irreducible polynomials implemented on FPGAs.
  • The dynamic nature of the polynomials enhances security, mitigating risks associated with fixed algorithms.
  • This approach offers a scalable solution for faster quantum randomness generation.