Bertlmann's chocolate balls and quantum type cryptography

Details Bertlmann's chocolate balls and quantum type cryptography Bertlmann's chocolate balls and quantum type cryptography

2009-03-02

arxiv.org/abs/0903.0231v2

Physics

Quantum Physics

18 pages, 6 figures; the photo a box full of colored balls can be downloaded from http://tph.tuwien.ac.at/~svozil/publ/2009-qc

Scientific paper

Some quantum cryptographic protocols can be implemented with specially prepared chocolate balls, others protected by value indefiniteness cannot. Similarities and differences of cryptography with quanta and chocolate are discussed. Motivated by these considerations it is proposed to certify quantum random number generators and quantum cryptographic protocols by value indefiniteness. This feature, which derives itself from Bell- and Kochen-Specker type arguments, is only present in systems with three or more mutually exclusive outcomes.

Affiliated with

Also associated with

No associations

Rating

Bertlmann's chocolate balls and quantum type cryptography does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bertlmann's chocolate balls and quantum type cryptography, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bertlmann's chocolate balls and quantum type cryptography will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-77731