◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Arindam Mitra

17 papers hereh-index 479 citations40 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author17

Across the 17 of 17 papers where every author was matched, so the position is known.

fields
  • cs.CR5
  • physics.gen-ph5
  • cs.IT3
  • quant-ph2
  • cs.DS1
  • cs.OH1
same name
  • Arindam Mitra — 14 papers, h 14
  • Arindam Mitra — 10 papers, h 9
  • Arindam Mitra — 9 papers, h 5
  • Arindam Mitra — 5 papers, h 2
  • Arindam Mitra — 3 papers, h 8

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
19982009
most citedAn unbreakable cryptosystem

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

collaborators
Showing cs.CRShow all

5 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.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.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.CR2004★ 5 cited

An unbreakable cryptosystem

Arindam Mitra

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. How…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.