N
N
nivs2015-10-24 16:57:26
Mathematics
nivs, 2015-10-24 16:57:26

Where should one look when creating a cryptographic system based on nonlinear dynamics (chaos)?

I choose a topic for my master's work, I wanted something related to chaos in cryptography. Mastered Ptitsyn "Application of the theory of deterministic chaos in cryptography" and Danilov "Lectures on nonlinear dynamics. Elementary introduction". I tried to find the latest developments in this direction - nothing really happened.
What should I do now? Which direction to look? Perhaps someone will tell you a specialized resource where they could help me?

Answer the question

In order to leave comments, you need to log in

1 answer(s)
S
Stanislav Makarov, 2015-10-24
@nivs

We find a good entry point in Google, for example: Chaos-based cryptography: a brief overview , and start learning the most important (after the ability to read publications in English in your profile) researcher skill: read the contents of the References and Cited By tabs. The work itself is of course already old, but it already has 180 citations, which is pretty cool. Therefore, we stomp to look at all articles that are closely related to the research topic. Here are a couple of relatively recent ones:
-- Design and implementation of a Chaotic Cipher bloc...
-- Chaos based key expansion function for block ciphers
And so continue to crawl up and down the citation graph (i.e. from cited articles to citing ones and vice versa) until full saturation and enlightenment regarding the state of the area (or blue, whichever comes first).
In Russian, literature is searched in the same way, only not so conveniently.
On the go, we catch links to other major works (master's and candidate's dissertations) and books:
- Information protection using dynamic chaos...
- Chaos-based Cryptography: an overview
- Chaos-Based Public-Key
Cryptography you can do it yourself. Full texts of articles are taken at the university with subscriptions (if you are lucky), or quietly on saihab.

Didn't find what you were looking for?

Ask your question

Ask a Question

731 491 924 answers to any question