Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:physics/0009015

Perfectly secure cipher system

Arindam Mitra

Published Sep 4, 2000• 0 citations
arXivHTMLPDF

Abstract

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.
DOI
10.48550/arxiv.physics/0009015

Related papers

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/0008240•Aug 30, 2000•0 citations

Completely secure practical cryptography

Arindam Mitra

Cryptography - the art of secure communications, has been developed at leastover 2500 years. Still at present, no perfectly secure as well as practicallysuitable classical or quantum cryptosystems exist. Statistically encoding theindividual bit, here we present a practical key distribution technique which isabsolutely secure both for classical and quantum keys. To achieve perfectsecurity, noise has to be strategically introduced. Noise, a detrimentalfactor, which never becomes helpful anywhere in classical and quantuminformation theory, can be used as a gift of nature in our cryptosystem sincefundamentally the coding of this cipher system does not follow the standardtechnique of classical and quantum information processing.

•Dec 15, 1999•2 citations

A Novel Classical and Quantum Cryptographic Scheme for Data Encryption

Peter Nimbe, Benjamin Asubam Weyori, Adebayo Felix Adekoya

International Journal of Theoretical Physics•Mar 1, 2022•2 citations

Unconditionally secure cryptosystems based on quantum cryptography

Yu‐Fang Chung, Zhen Yu Wu, Tzer‐Shyong Chen

Information Sciences•Dec 4, 2007•14 citations

Alternative Approaches - Quantum Cryptography and Bounded Storage Model

Andreas Würfl

Several encryption algorithms have been discussed in the course of this seminar. This paper will introduce two alternative approaches. A change in the concept of provable security leads to a cipher which is shown to be ”perfect with high probability”. Assuming that the memory capabilities of a potential adversary are limited a strongly-randomized cipher is devised which uses a publicly-accessible string of random bits. In this cipher the secret key is short but the plaintext can be very long. The second approach is based on quantum physics. Heisenberg’s uncertainty principle guarantees the security of quantum cryptography. The first experiment which demonstrated the practicability of the only known encryption unbreakable by law of nature was conducted in 1989. The physical and technical fundamentals are introduced as well as the Quantum Key Exchange (QKE) protocol. We will demonstrate the eects of attempted eavesdropping and its detection. Finally the rapid development of the last 15 years and the currently available implementations will be presented.

•Jan 1, 2005•0 citations

How secure is quantum cryptography

Mario Stipčević

International Convention on Information and Communication Technology, Electronics and Microelectronics•Jan 1, 2012•0 citations
Cryptography - the art of secure communications, has been developed at leastover 2500 years. Still at present, no perfectly secure as well as practicallysuitable classical or quantum cryptosystems exist. Statistically encoding theindividual bit, here we present a practical key distribution technique which isabsolutely secure both for classical and quantum keys. To achieve perfectsecurity, noise has to be strategically introduced. Noise, a detrimentalfactor, which never becomes helpful anywhere in classical and quantuminformation theory, can be used as a gift of nature in our cryptosystem sincefundamentally the coding of this cipher system does not follow the standardtechnique of classical and quantum information processing.
Several encryption algorithms have been discussed in the course of this seminar. This paper will introduce two alternative approaches. A change in the concept of provable security leads to a cipher which is shown to be ”perfect with high probability”. Assuming that the memory capabilities of a potential adversary are limited a strongly-randomized cipher is devised which uses a publicly-accessible string of random bits. In this cipher the secret key is short but the plaintext can be very long. The second approach is based on quantum physics. Heisenberg’s uncertainty principle guarantees the security of quantum cryptography. The first experiment which demonstrated the practicability of the only known encryption unbreakable by law of nature was conducted in 1989. The physical and technical fundamentals are introduced as well as the Quantum Key Exchange (QKE) protocol. We will demonstrate the eects of attempted eavesdropping and its detection. Finally the rapid development of the last 15 years and the currently available implementations will be presented.