Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Parseval's Theorem for Fourier transform

Parseval's Theorem for Fourier transform

Parseval's theorem is a fundamental principle in signal processing that enables the calculation of a signal's energy in either the time domain or the frequency domain. This theorem is pivotal in demonstrating energy conservation between these two domains, ensuring that the computed energy value remains consistent regardless of the domain of analysis.
To understand Parseval's theorem, it is essential to first comprehend how signal energy is typically calculated. When considering a signal's...

Fast Fourier Transform

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

Linear Approximation in Frequency Domain

Linear Approximation in Frequency Domain

Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear.

Properties of Fourier series II

Properties of Fourier series II

Time scaling of signals is a crucial concept in signal processing that affects the Fourier series representation without altering its coefficients. The process modifies the fundamental frequency, thereby changing how the series represents the signal over time. This principle is essential in various applications, including audio and image processing, where signal manipulation is frequent. Understanding function symmetries is fundamental to simplifying the Fourier series.
A function f(t) is...

Trigonometric Fourier series

Trigonometric Fourier series

Fourier series is a foundational mathematical technique that decomposes periodic functions into an infinite series of sinusoidal harmonics. This method enables the representation of complex periodic signals as sums of simple sine and cosine functions, facilitating their analysis and interpretation in various fields, including signal processing, acoustics, and electrical engineering.
The trigonometric Fourier series specifically expresses a periodic function with a defined period T using sine...

Properties of Fourier Transform II

Properties of Fourier Transform II

The Fourier Transform (FT) is an essential mathematical tool in signal processing, transforming a time-domain signal into its frequency-domain representation. This transformation elucidates the relationship between time and frequency domains through several properties, each revealing unique aspects of signal behavior.
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...

You might also read

Related Articles

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

Sort by

Same author

UFC1 maintains ACSL3 abundance through UFMylation-associated mechanisms to modulate lipid metabolism in skeletal muscle myoblasts.

Biochemical and biophysical research communications·2026

Same author

Real-world effectiveness of rezvilutamide plus androgen deprivation therapy in patients with high-volume metastatic hormone-sensitive prostate cancer: a retrospective multicenter cohort study.

Translational andrology and urology·2026

Same author

Retraction notice to 'Chemical identification of the Viola phillipina extracts and their anti-acne activity: A comparison with isotretinoin and salicylic acid' [Fitoterapia 191 (2026) 107238].

Fitoterapia·2026

Same author

Past, present, and future of thermogenic fat research: A bibliometric analysis from 2000 to 2023.

Medicine·2026

Same author

Neuroimaging studies of non-suicidal self-injury in young adults with major depressive disorder.

Behavioural brain research·2026

Same author

The intratumoral microbiota: from origin and identification to function and therapeutic perspective.

Acta biochimica et biophysica Sinica·2026

Search research articles

Related Experiment Videos

A hybrid heuristic algorithm to improve known-plaintext attack on Fourier plane encryption.

Wensi Liu¹, Guanglin Yang, Haiyan Xie

¹State Key Laboratory on Advanced Optical Communication Systems and Networks, Peking University, Beijing 100871, China.

|August 6, 2009

Summary

This study introduces a hybrid heuristic attack combining hill climbing and simulated annealing for Fourier plane encryption. The new method significantly speeds up key searching and improves decryption accuracy for images.

Related Experiment Videos

Area of Science:

Cryptography
Computer Science
Image Processing

Background:

Fourier plane encryption is a method for securing images.
Known-plaintext attacks pose a threat to such encryption schemes.
Existing attack methods may be slow or inaccurate.

Purpose of the Study:

To develop a faster and more accurate known-plaintext attack for Fourier plane encryption.
To enhance the practicality and effectiveness of cryptanalysis for image encryption.

Main Methods:

A hybrid heuristic attack scheme combining hill climbing and simulated annealing algorithms.
Analysis of the random phase value space using a unit cycle.
Experimental validation on encrypted images.

Main Results:

The proposed scheme significantly reduces search time for the encryption key.
Achieved a normalized root mean squared error of 0.1 for a 64x64 pixel image in approximately 1 minute.
Demonstrated accurate key retrieval and improved decryption for both known and unseen ciphertext images.

Conclusions:

The hybrid heuristic attack is a practical, stable, and effective method for known-plaintext attacks on Fourier plane image encryption.
The enhanced search procedure leads to better decryption results and reduced computational time.
This approach advances the field of image cryptanalysis.