Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 30 tok/s
Gemini 2.5 Pro 46 tok/s Pro
GPT-5 Medium 18 tok/s Pro
GPT-5 High 12 tok/s Pro
GPT-4o 91 tok/s Pro
Kimi K2 184 tok/s Pro
GPT OSS 120B 462 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

Chaotic Encryption Scheme Using 1-D Chaotic Map (1312.4042v1)

Published 14 Dec 2013 in cs.CR

Abstract: This paper proposes three different chaotic encryption methods using 1-D chaotic map known as Logistic map named as Logistic, NLFSR and Modified NLFSR according to the name of chaotic map and non-linear function involved in the scheme. The designed schemes have been crypt analyzed for five different methods for testing its strength. Cryptanalysis has been performed for various texts using various keys selected from domain of key space. Logistic and NLFSR methods are found to resist known plaintext attack for available first two characters of plaintext. Plaintext sensitivity of both methods is within small range along with medium key sensitivity. Identifiability for keys of first two of the scheme has not been derived concluding that methods may prove to be weak against brute-force attack. In the last modified scheme avalanche effect found to be improved compared to the previous ones and method is found to resist brute-force attack as it derives the conclusion for identifiability.

Citations (13)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.