Related Experiment Video
Updated: Jul 6, 2026
09:43
Transmission of Multiple Signals through an Optical Fiber Using Wavefront Shaping
Published on: March 20, 2017
Stream cipher based on pseudorandom number generation with optical affine transformation
Applied Optics
|March 18, 2008
Summary
We introduce a novel stream cipher for 2-D image encryption using iterative optical transformations and a pseudorandom number generator (PRNG). This method promises efficient, parallel processing for enhanced image security.
Area of Science:
- Computer Science
- Optical Engineering
- Cryptography
Background:
- Stream ciphers are crucial for secure data transmission.
- Existing methods may lack efficiency for large image datasets.
- Optical processing offers potential for high-speed computation.
Purpose of the Study:
- To propose a new stream cipher technique for 2-D image data.
- To enable implementation via iterative optical transformation.
- To leverage optical parallel processing for efficiency.
Main Methods:
- A novel pseudorandom number generator (PRNG) is developed.
- The PRNG utilizes iterative 2-D affine transformations.
- Modulo-n addition of transformed images generates the pseudorandom sequence.
Main Results:
- The proposed stream cipher is designed for 2-D image data.
- Iterative optical transformation is the core implementation method.
- Performance is evaluated for security strength.
Conclusions:
- The proposed stream cipher offers a new approach to image encryption.
- Optical parallel processing is expected to enhance execution efficiency.
- Challenges in optical implementation were identified using an optical fractal synthesizer.
Related Concept Videos
00:59Propagation of Uncertainty from Random Error
An experiment often consists of more than a single step. In this case, measurements at each step give rise to uncertainty. Because the measurements occur in successive steps, the uncertainty in one step necessarily contributes to that in the subsequent step. As we perform statistical analysis on these types of experiments, we must learn to account for the propagation of uncertainty from one step to the next. The propagation of uncertainty depends on the type of arithmetic operation performed on...
01:26Linear 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.
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.
01:28Synthetic Disvision of Polynomials
Synthetic division is an efficient algorithmic approach for dividing a polynomial by a linear binomial of the form x - c, where c is a real number. This method is helpful due to its streamlined process, which avoids the more cumbersome steps involved in the traditional long division of polynomials. It simplifies computation and serves as a practical tool for evaluating polynomials and identifying their factors.To perform synthetic division, one begins by listing the coefficients of the...
01:13Phasor Arithmetics
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 frequency.
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 frequency.
01:26Discrete-time Fourier transform
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...
One of the notable...
01:09Random Sampling Method
Sampling is a technique to select a portion (or subset) of the larger population and study that portion (the sample) to gain information about the population. Data are the result of sampling from a population. The sampling method ensures that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest. Among the various sampling methods used by...