activity
19982009
most citedAn unbreakable cryptosystem

5 citations · 15 across the 17 of their papers we have counts for

collaborators
Showing 2005Show all

6 papers · 1 filter

cs.IT2005★ 1 cited

A particle can carry more than one bit of information

Arindam Mitra

It is believed that a particle cannot carry more than one bit of information. It is pointed out that particle or single-particle quantum state can carry more than one bit of inform…

cs.CR2005★ 3 cited

Honesty can be the best policy within quantum mechanics

Arindam Mitra

Honesty has never been scientifically proved to be the best policy in any case. It is pointed out that only honest person can prevent his dishonest partner to bias the outcome of q…

cs.DS2005★ 3 cited

Human being is a living random number generator

Arindam Mitra

General wisdom is, mathematical operation is needed to generate number by numbers. It is pointed out that without any mathematical operation true random numbers can be generated by…

cs.CR2005

Is entanglement necessary to have unconditional security in quantum bit commitment ?

Arindam Mitra

A simple un-entanglement based quantum bit commitment scheme is presented. Although commitment is unconditionally secure but concealment is not.

cs.CR2005

Quantum mechanics can provide unbiased result

Arindam Mitra

Getting an unbiased result is a remarkably long standing problem of collective observation/measurement. It is pointed out that quantum coin tossing can generate unbiased result def…

cs.IT2005

No-cloning principal can alone provide security

Arindam Mitra

Existing quantum key distribution schemes need the support of classical authentication scheme to ensure security. This is a conceptual drawback of quantum cryptography. It is point…