An unbreakable cryptosystem
Arindam Mitra

TL;DR
This paper introduces a simple classical cryptosystem claiming to generate completely secure keys, challenging the common belief that classical cryptography cannot achieve perfect security.
Contribution
It presents a novel classical cryptosystem that purportedly provides complete security, countering the prevailing assumption that only quantum cryptography can do so.
Findings
Proposes a simple classical cryptosystem with complete security.
Challenges the belief that classical cryptography cannot achieve perfect security.
No proof of security provided, but claims to be unbreakable.
Abstract
The remarkably long-standing problem of cryptography is to generate completely secure key. It is widely believed that the task cannot be achieved within classical cryptography. However, there is no proof in support of this belief. We present an incredibly simple classical cryptosystem which can generate completely secure key.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsChaos-based Image/Signal Encryption · Coding theory and cryptography · Algorithms and Data Compression
