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

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

You might also read

Related Articles

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

Sort by
Same author

Association of the global inflammatory-nutritional index (GINI) with time to next treatment and overall survival in patients with metastatic colorectal cancer receiving third-line therapy: a real-world retrospective study.

Journal of gastrointestinal oncology·2026
Same author

Wideband high-gain Fabry-Perot resonator antenna based on a water-based metasurface.

Optics express·2026
Same author

Moxibustion for gastrointestinal cancer-related fatigue: study protocol for a randomized clinical trial.

Frontiers in psychiatry·2026
Same author

GLUT3 drives paclitaxel resistance in peritoneal metastatic gastric cancer by promoting H3K18 lactylation-mediated MAPKAP1 transcription to suppress ferroptosis.

International journal of biological sciences·2026
Same author

METTL16 S-glutathionylation-triggered RNA m<sup>6</sup>A modification of IGF2BP3 inhibits CFTR expression and promotes chemoresistance in colorectal cancer.

Acta pharmacologica Sinica·2026
Same author

Single-cell and deep learning identify hypoxia-responsive lncRNAs predicting outcomes in colorectal cancer.

NPJ precision oncology·2026

Related Experiment Video

Updated: Mar 12, 2026

A Guide to Structured Illumination TIRF Microscopy at High Speed with Multiple Colors
11:15

A Guide to Structured Illumination TIRF Microscopy at High Speed with Multiple Colors

Published on: May 30, 2016

26.4K

A Fast Color Image Encryption Algorithm Using 4-Pixel Feistel Structure.

Wang Yao1,2, Faguo Wu1,2, Xiao Zhang1,2

  • 1Key Laboratory of Mathematics, Informatics and Behavioral Semantics, Ministry of Education, Beijing 100191, China.

Plos One
|November 9, 2016
PubMed
Summary

This study introduces a fast color image encryption algorithm using a modified 4-pixel Feistel structure and chaotic maps. The novel approach significantly enhances encryption speed while maintaining robust security performance.

More Related Videos

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques
11:34

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques

Published on: December 3, 2013

16.1K
Lensless Fluorescent Microscopy on a Chip
11:23

Lensless Fluorescent Microscopy on a Chip

Published on: August 17, 2011

18.3K

Related Experiment Videos

Last Updated: Mar 12, 2026

A Guide to Structured Illumination TIRF Microscopy at High Speed with Multiple Colors
11:15

A Guide to Structured Illumination TIRF Microscopy at High Speed with Multiple Colors

Published on: May 30, 2016

26.4K
High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques
11:34

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques

Published on: December 3, 2013

16.1K
Lensless Fluorescent Microscopy on a Chip
11:23

Lensless Fluorescent Microscopy on a Chip

Published on: August 17, 2011

18.3K

Area of Science:

  • Computer Science
  • Cryptography
  • Information Security

Background:

  • Traditional image encryption methods struggle with large data capacities and high pixel correlation.
  • Existing algorithms based on Feistel structures and chaotic systems offer solutions but often lack efficiency.

Purpose of the Study:

  • To propose a fast and efficient color image encryption algorithm.
  • To improve the speed of image encryption without compromising security.

Main Methods:

  • Utilizing a modified 4-pixel Feistel structure for reduced rounds and secure twist direction.
  • Employing a simple round function with a piecewise linear function and tent map to lower computational cost.
  • Integrating multiple chaotic maps for enhanced cryptographic strength.

Main Results:

  • The proposed algorithm achieves encryption in 0.15s for a 256*256 color image, twice as fast as similar structures (0.37s).
  • Simulation experiments confirm strong security performance.
  • The algorithm demonstrates superior speed compared to other recent encryption methods.

Conclusions:

  • The modified 4-pixel Feistel structure and chaotic maps provide an efficient and secure solution for color image encryption.
  • The proposed methods effectively address the trade-off between speed and security in image encryption.
  • This algorithm represents a significant advancement in fast and secure image encryption techniques.