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 Experiment Videos

A cryptosystem based on cellular automata.

Jesus Urias1, Edgardo Ugalde, Gelasio Salazar

  • 1IICO, Universidad Autonoma de San Luis Potosi, 78000 San Luis Potosi, SLP, Mexico.

Chaos (Woodbury, N.Y.)
|June 5, 2003
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

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

Sort by
Same author

RNA-ligand complexes and the attenuation of neutral confinement in the evolution of RNA secondary structures.

Journal of the Royal Society, Interface·2026
Same author

On the Correspondence between Subshifts of Finite Type and Statistical Mechanics Models.

Entropy (Basel, Switzerland)·2022
Same author

Maximally nonlocal Clauser-Horne-Shimony-Holt scenarios.

Scientific reports·2018
Same author

An algorithm for constructing the skeleton graph of degenerate systems of linear inequalities.

PloS one·2017
Same author

Structural comparison of biological networks based on dominant vertices.

Molecular bioSystems·2013
Same author

Regulatory dynamics of standard two-component systems in bacteria.

Journal of theoretical biology·2010

This study presents efficient cryptosystems for binary data using cellular automata synchronization. These systems leverage permutations and pseudorandom sequences for enhanced security.

Area of Science:

  • Computer Science
  • Cryptography
  • Information Theory

Background:

  • Binary cryptosystems rely on permutations and pseudorandom sequence generators.
  • Cellular automata offer potential for efficient primitive implementation.

Purpose of the Study:

  • To construct an efficient implementation of cryptosystem primitives.
  • To utilize cellular automata synchronization for cryptographic applications.

Main Methods:

  • Developing an indexed family of permutations for binary words.
  • Implementing a generator for pseudorandom sequences of indices.
  • Leveraging the synchronization phenomenon in cellular automata.

Main Results:

  • An efficient implementation of the core cryptosystem primitives was achieved.

Related Experiment Videos

  • The proposed method demonstrates the practical application of cellular automata in cryptography.

    • Conclusions:

    • Cellular automata synchronization provides an effective mechanism for building efficient binary cryptosystems.
    • This approach enhances the performance of cryptographic primitive implementations.