arXiv:cs/0412099

An unbreakable cryptosystem

Arindam Mitra

Published Dec 22, 2004• 5 citations

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.

DOI: 10.48550/arxiv.cs/0412099

Related papers

Post-Quantum Cryptosystems for Internet-of-Things: A Survey on Lattice-Based Algorithms

Rameez Asif

The latest quantum computers have the ability to solve incredibly complex classical cryptography equations particularly to decode the secret encrypted keys and making the network vulnerable to hacking. They can solve complex mathematical problems almost instantaneously compared to the billions of years of computation needed by traditional computing machines. Researchers advocate the development of novel strategies to include data encryption in the post-quantum era. Lattices have been widely used in cryptography, somewhat peculiarly, and these algorithms have been used in both; (a) cryptoanalysis by using lattice approximation to break cryptosystems; and (b) cryptography by using computationally hard lattice problems (non-deterministic polynomial time hardness) to construct stable cryptographic functions. Most of the dominant features of lattice-based cryptography (LBC), which holds it ahead in the post-quantum league, include resistance to quantum attack vectors, high concurrent performance, parallelism, security under worst-case intractability assumptions, and solutions to long-standing open problems in cryptography. While these methods offer possible security for classical cryptosytems in theory and experimentation, their implementation in energy-restricted Internet-of-Things (IoT) devices requires careful study of regular lattice-based implantation and its simplification in lightweight lattice-based cryptography (LW-LBC). This streamlined post-quantum algorithm is ideal for levelled IoT device security. The key aim of this survey was to provide the scientific community with comprehensive information on elementary mathematical facts, as well as to address real-time implementation, hardware architecture, open problems, attack vectors, and the significance for the IoT networks.

IoTFeb 5, 2021139 citations

Perfectly secure cipher system

Arindam Mitra

We present a perfectly secure cipher system based on the concept of fake bits which has never been used in either classical or quantum cryptography.

arXiv:physics/0009015Sep 4, 20000 citations

Quantum mechanics can alone provide security in communication

Arindam Mitra

To ensure security in communication. existing quantum cryptosystems need the support of classical cryptosystem. This is a long-standing conceptual drawback of quantum cryptography. It is pointed out that without any support of classical cryptosystem quantum cryptosystem can alone provide security in communication. That is, secure quantum communication is possible.

Jan 12, 20051 citation

A simple unbreakable code

Arindam Mitra

A simple unbreakable cipher system is presented which uses the concept of "pseudo-bits" that has never been used in either classical or quantum cryptography.

arXiv:physics/0008240Aug 30, 20000 citations

A Novel Classical and Quantum Cryptographic Scheme for Data Encryption

Peter Nimbe, Benjamin Asubam Weyori, Adebayo Felix Adekoya

International Journal of Theoretical PhysicsMar 1, 20222 citations

A Tutorial Introduction to Lattice-based Cryptography and Homomorphic Encryption

Yang Li, Kee Siong Ng, Purcell, Michael

Why study Lattice-based Cryptography? There are a few ways to answer this question. 1. It is useful to have cryptosystems that are based on a variety of hard computational problems so the different cryptosystems are not all vulnerable in the same way. 2. The computational aspects of lattice-based cryptosystem are usually simple to understand and fairly easy to implement in practice. 3. Lattice-based cryptosystems have lower encryption/decryption computational complexities compared to popular cryptosystems that are based on the integer factorisation or the discrete logarithm problems. 4. Lattice-based cryptosystems enjoy strong worst-case hardness security proofs based on approximate versions of known NP-hard lattice problems. 5. Lattice-based cryptosystems are believed to be good candidates for post-quantum cryptography, since there are currently no known quantum algorithms for solving lattice problems that perform significantly better than the best-known classical (non-quantum) algorithms, unlike for integer factorisation and (elliptic curve) discrete logarithm problems. 6. Last but not least, interesting structures in lattice problems have led to significant advances in Homomorphic Encryption, a new research area with wide-ranging applications.

arXiv:2208.08125Aug 17, 20223 citations