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

SFG Algebra01:16

SFG Algebra

190
In Signal Flow Graph (SFG) algebra, the value a node represents is determined by the sum of all signals entering that node. This summed value is then transmitted through every branch leaving the node, making the SFG a powerful tool for visualizing and analyzing control systems.
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...
190
Theorems of Pappus and Guldinus01:10

Theorems of Pappus and Guldinus

2.1K
The two theorems developed by Pappus and Guldinus are widely used in mathematics, engineering, and physics to find the surface area and volume of any body of revolution. This is done by revolving a plane curve around an axis that does not intersect the curve to find its surface area or revolving a plane area around a non-intersecting axis to calculate its volume.
For finding the surface area, consider a differential line element that generates a ring with surface area dA when revolved.
2.1K
Theorems of Pappus and Guldinus: Problem Solving01:12

Theorems of Pappus and Guldinus: Problem Solving

851
Pappus and Guldinus's theorems are powerful mathematical principles that are used for finding the surface area and volume of composite shapes. For example, consider a cylindrical storage tank with a conical top. Finding the surface area or volume can be challenging for such complex shapes. These theorems are particularly useful in calculating the volume and surface area of such systems. Here, the cylindrical storage tank with a conical top can be broken down into two simple shapes: a...
851
Entropy Change in Reversible Processes01:10

Entropy Change in Reversible Processes

2.8K
In the Carnot engine, which achieves the maximum efficiency between two reservoirs of fixed temperatures, the total change in entropy is zero. The observation can be generalized by considering any reversible cyclic process consisting of many Carnot cycles. Thus, it can be stated that the total entropy change of any ideal reversible cycle is zero.
The statement can be further generalized to prove that entropy is a state function. Take a cyclic process between any two points on a p-V diagram.
2.8K
Relation between Mathematical Equations and Block Diagrams01:20

Relation between Mathematical Equations and Block Diagrams

2.3K
In a spring-mass-damper system, the second-order differential equation describes the dynamic behavior of the system. When transformed into the Laplace domain under zero initial conditions, this equation can be effectively analyzed and manipulated. The transformation into the Laplace domain converts differential equations into algebraic equations, simplifying the process of isolating the output.
2.3K
Radical Chain-Growth Polymerization: Overview01:10

Radical Chain-Growth Polymerization: Overview

2.8K
Chain-growth or addition polymerization is successive addition reactions of monomers with a polymer chain. In radical chain-growth polymerization, the reaction proceeds via a free-radical intermediate. The free radical is formed from radical initiators, which spontaneously generate free radicals by homolytic fission. Organic peroxides (such as dibenzoyl peroxide, as shown in Figure 1) or azo compounds are popular radical initiators. A low concentration ratio of radical initiator to monomer is...
2.8K

You might also read

Related Articles

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

Sort by
Same author

Image encryption based on the pseudo-orbits from 1D chaotic map.

Chaos (Woodbury, N.Y.)·2019
See all related articles

Related Experiment Video

Updated: Oct 18, 2025

Generation and Coherent Control of Pulsed Quantum Frequency Combs
06:42

Generation and Coherent Control of Pulsed Quantum Frequency Combs

Published on: June 8, 2018

9.3K

A reliable chaos-based cryptography using Galois field.

Lucas G Nardo1, Erivelton G Nepomuceno2, Gustavo T Bastos3

  • 1Graduate Program in Electrical Engineering, Department of Electronic Engineering, Federal University of Minas Gerais, Belo Horizonte, MG 31270-901, Brazil.

Chaos (Woodbury, N.Y.)
|October 2, 2021
PubMed
Summary
This summary is machine-generated.

Finite precision errors in chaotic image encryption create different cipher-images across devices. This study introduces a robust cryptosystem using chaotic maps and Galois theory to ensure consistent security across platforms.

More Related Videos

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

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

Published on: September 5, 2019

8.7K
Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

796

Related Experiment Videos

Last Updated: Oct 18, 2025

Generation and Coherent Control of Pulsed Quantum Frequency Combs
06:42

Generation and Coherent Control of Pulsed Quantum Frequency Combs

Published on: June 8, 2018

9.3K
A Photonic System for Generating Unconditional Polarization-Entangled Photons Based on Multiple Quantum Interference
07:56

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

Published on: September 5, 2019

8.7K
Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

796

Area of Science:

  • Cryptography and Information Security
  • Applied Mathematics
  • Computer Science

Background:

  • Chaos-based image encryption is widely used but sensitive to hardware/software variations.
  • Finite precision errors in digital chaotic systems can lead to inconsistent encryption results.
  • Existing solutions often overlook the impact of finite precision on cipher-image integrity.

Purpose of the Study:

  • To address the challenge of finite precision errors in chaos-based image encryption.
  • To develop a robust and device-independent image cryptosystem.
  • To enhance the security and reliability of digital image encryption.

Main Methods:

  • Integration of the chaotic logistic map for generating pseudo-random sequences.
  • Application of Galois field theory to ensure mathematical rigor and security.
  • Development of a novel cryptosystem designed for finite precision environments.

Main Results:

  • Demonstrated that finite precision errors can cause distinct cipher-images on different devices.
  • The proposed cryptosystem successfully passed the ENT test suite and various cyberattacks.
  • Achieved an exceptionally large key space, reaching up to 2^4096.
  • Verified effective encryption and decryption of benchmark images across dissimilar digital devices.

Conclusions:

  • The developed cryptosystem effectively mitigates finite precision errors in chaos-based image encryption.
  • The approach offers enhanced security and consistent performance across diverse hardware and software platforms.
  • This work provides a significant advancement in developing reliable and secure image encryption techniques.