1 citations · 1 across the 3 of their papers we have counts for
Showing 2006Show all
2 papers · 1 filter
cs.CR2006★ 1 cited
An unbreakable cryptosystem for common people
Arindam Mitra
It has been found that an algorithm can generate true random numbers on classical computer. The algorithm can be used to generate unbreakable message PIN (personal identification n…
cs.IT2006
Quantum communication is possible with pure state
Arindam Mitra
It is believed that quantum communication is not possible with a pure ensemble of states because quantum entropy of pure state is zero. This is indeed possible due to geometric con…