kim
Uploaded by
8 SLIDES
619 VUES
190LIKES

Chaos in Cryptography

DESCRIPTION

Chaos in Cryptography. What is Chaos in Cryptography Chaos Functions Application in Cryptography Why it isn’t used. What does it mean?. Use Chaos Functions Pseudo Random Generation One-Time Pad. Chaos Functions. Sensitive to Initial Value Sequence Based on Seed

1 / 8

Télécharger la présentation

Chaos in Cryptography

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Chaos in Cryptography • What is Chaos in Cryptography • Chaos Functions • Application in Cryptography • Why it isn’t used

  2. What does it mean? • Use Chaos Functions • Pseudo Random Generation • One-Time Pad

  3. Chaos Functions • Sensitive to Initial Value • Sequence Based on Seed • Non-Computable Generation

  4. The Logistic Map • Xn+1 = R * Xn (1 – Xn) • R = 4 Bifurcation Diagram Diagram shows accuracy based on initial seed.

  5. Application in Cryptography • Seed Unique to Key • Generate One-Time Pad • Symmetric Key System

  6. 64 Bit Example • Generate Key • Convert to Seed • Iterate • XOR with Data • Symmetrical Operation

  7. Why it isn’t used • Security Cannot Be Proven • Attractors • Computationally Expensive

  8. References Dr. Ranjan Bose and Amitabha Banerjee. “Implementing Symmetric Cryptography Using Chaos Functions” Wikipedia http://en.wikipedia.org/wiki/Logistic_map M. S. Baptista, “Cryptography with Chaos” Physics Letters A , Vol. 240, Pages 50–54, 1998 Shujun Li, Guanrong Chen, Kwok-Wo Wong, Xuanqin Mou, and Yuanlong Cai. “Baptista-type chaotic cryptosystems: Problems and countermeasures”

More Related