Could packet round-trip times be an analog to qubits?

  • Context: Graduate 
  • Thread starter Thread starter MerryMoose
  • Start date Start date
  • Tags Tags
    Analog Qubits
Click For Summary
SUMMARY

This discussion centers on the feasibility of implementing pseudo-quantum cryptography algorithms without quantum computers, specifically examining the analogy between packet round-trip times and qubits. Participants highlight that while packet round-trip times may exhibit properties similar to qubits, they cannot replicate the unique characteristics of quantum mechanics as outlined by Bell's Theorem. The conversation emphasizes that physical attacks on classical connections undermine the potential benefits of such cryptographic methods, reinforcing the necessity of quantum cryptography for true security against eavesdropping.

PREREQUISITES
  • Understanding of quantum mechanics principles, particularly Bell's Theorem
  • Familiarity with cryptographic algorithms and their security implications
  • Knowledge of packet transmission and network protocols
  • Awareness of eavesdropping techniques in classical communications
NEXT STEPS
  • Research quantum cryptography techniques, focusing on Quantum Key Distribution (QKD)
  • Explore Bell's Theorem and its implications for local realism in cryptography
  • Study the impact of network latency and round-trip time on data transmission security
  • Investigate methods for detecting eavesdropping in classical networks
USEFUL FOR

This discussion is beneficial for cryptographers, network security professionals, and programmers interested in the intersection of quantum mechanics and cybersecurity, particularly those exploring advanced cryptographic solutions.

MerryMoose
Messages
1
Reaction score
0
I'm a programmer who is trying to figure out if there is any possible way to implement a pseudo-quantum cryptography algorithm without quantum computers, or is Bell's Inequality something that is going to get in the way of that goal? Or if I am anywhere in the ballpark. I wouldn't be surprised if I were way off on everything.

The reason I'm looking at packet round-trip times is because it seems like an analog to a qubit. It doesn't have a certain value until you measure it.

This may be good for cryptography since an eavesdropping party couldn't measure it and see what you would see, and the eavesdropping would affect the value you end up with. For example, the owner of megaupload figured out that authorities were eavesdropping on his internet connection due to a decline in his connections performance, he then noticed an extra hop when running a trace route.

Compromised computers or routers on a local network could do similar things and not be nearly as noticeable. It still takes a cpu tick to process, it could be almost impossible to notice or measure in that circumstance, but it still changes the round-trip time, a very subtle change.

Oh and this is my first post here. Hello :-)
 
Physics news on Phys.org
MerryMoose said:
The reason I'm looking at packet round-trip times is because it seems like an analog to a qubit. It doesn't have a certain value until you measure it.

It is not the same thing. The fact that a qubit can be in a superposition of 0 and 1 has nothing as such to do with measurements, it simply means that it is in state which does not have a classical analouge. It has nothing to do with our inability to measure it.

This may be good for cryptography since an eavesdropping party couldn't measure it and see what you would see, and the eavesdropping would affect the value you end up with.

There are many ways one could eavesdrop on a classical connection, both in theory and practice. Anyone with physical access to the cables could just eavesdrop on the lines directly by putting current clamps around the wires in an electrical cable, or insert a splitter if it is a fibre.
[/quote]

Hence, your method does nothing to prevent someone from a "physical" attack where someone can directly access your physical connection, whereas QC does.

Oh and this is my first post here. Hello :-)

Hello. Welcome to PF :-p
 
MerryMoose said:
I'm a programmer who is trying to figure out if there is any possible way to implement a pseudo-quantum cryptography algorithm without quantum computers, or is Bell's Inequality something that is going to get in the way of that goal?

No. That's the point. See Gilder's Age of Entanglement. Bell's Theorem shows that there is "No Way" to duplicate the features of QM in a "Local Real" Cryptographic Setting:

"So it happened that Eckert, in the quiet of Clarendon's library, sat back in shock when he read for the first time the famous EPR definition of "an element of reality: if, without in any way disturbing a system, we can predict with certainty the value of a physical quantity, then there exists an element of reality corresponding to this physical quantity. "It just clicked in my brain: wow - this is about eavesdropping!"...
""Local Realism", Eckert realized, "allows you somehow to incorporate the definition of perfect eavesdropping into the formulation: "Ha! - but I know it was refuted!" An entangled code would be an un-eavesdroppable code..."

AoE, p. 314.

CW
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 7 ·
Replies
7
Views
6K
  • · Replies 19 ·
Replies
19
Views
4K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 21 ·
Replies
21
Views
7K
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 1 ·
Replies
1
Views
4K