What does 'provably secure' mean here?
| This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||
| ||||||||||||||
What does 'provably secure' mean here?
The protocol includes a 'check to see if more than a certain number of them agree'. How is this 'certain number' determined? Or can it be chosen freely? If it can be chosen freely, doesn't a lower number make the protocol 'less secure'? If so, how is the system 'provably secure' if it depends on such a choice? --Raboof (talk) 09:25, 5 July 2008 (UTC)
No discussion of man-in-the-middle? There's no such thing as ideal security in practice. 67.171.234.166 (talk) 00:56, 18 May 2009 (UTC)
To use this protocol, you'd need a 'quantum channel' to send the qubits over, which requires a dedicated fiber line between Alice and Bob, right? --Raboof (talk) 09:30, 5 July 2008 (UTC)
Like all too many articles on quantum mechanics, general relativity, and other areas of advanced physics, this article uses symbols that are not meaningful to most readers. Okay, Alice sends . So what? What does mean?
You need to be a subject matter expert in order to understand this article, but if you already know QM and/or quantum cryptography, you don't need to read this article.
IMHO, articles of this sort should define any symbols not found in high school math or first year calculus. Or maybe even the calculus symbols should be defined. Bgoldnyxnet (talk) 15:22, 28 September 2011 (UTC)
there is a much more thorough explanation on the quantum key distribution page. — Preceding unsigned comment added by 80.216.9.219 (talk) 21:52, 2 January 2012 (UTC)
The first reference, doi:10.1016/j.tcs.2011.08.039, is listed as WITHDRAWN. Why was it withdrawn? Also, why is the year for this reference listed as 2011 rather than 1984? Dstahlke (talk) 22:41, 16 April 2014 (UTC)
Sometimes something quantical does happen in practice, for example A two-qubit logic gate in silicon in 2015. Therefore, it is misleading to assume that the word quantum in a prominent position in the lede conveys that no key was ever distributed using this method. (Do quantum channels exist?)
I'd propose theoretical, but there must be a better adjective to convey that fact. Thanks ale (talk) 18:09, 21 May 2016 (UTC)
Assuming quantum storage, I don't see how this unbreakable. Imagine, if instead of measuring b right away, Eve simply quantumly stores the qubit via quantum entanglement and waits for Alice to announce b, and Bob to communicate which b' values do not match. This tells Eve what b' to use to measure the store qubits. Since all the quantumly entangled qubits are now aligned with Bob's measurements, Eve learns a' simply by measuring the stored qubits. So now Alice, Bob, and Eve all know the same secret.Bill C. Riemers (talk) 19:04, 2 October 2017 (UTC)
This article could use some of the table and explanations from Quantum_key_distribution section on BB84.--ReyHahn (talk) 13:26, 26 May 2021 (UTC)
I’m a total non-expert reading this article. I thought maybe my confusion would be helpful in improving this page. I got confused as soon as I got to the final paragraph in the description of the protocol:
When did Alice measure something? I get from context that this means the bits where and agree, so does this mean where Bob's choice of basis (via the bits in ) matches Alice’s choice of basis (via the bits in )?
And then when Alice discloses bits, is she disclosing just the indices of those bits, or the bits together with their indices? Would these be bits of (on Alice's side) this tensor product , versus (on Bob's side) the mangled, eavesdropped, transmitted version ? Er, maybe on Alice's side it would be the result of her measurement of . Is that right?
They’re creating shared secret keys out of the bit string they've decided they both have a copy of. Is that right? — Preceding unsigned comment added by Yipe! That's me (talk • contribs) 20:35, 9 June 2021 (UTC)
It is stated in the 3rd sentence that "[t]he protocol is provably secure assuming a perfect implementation" and just a few sentences later that "[t]he proof of BB84 depends on a perfect implementation". I'd argue that the latter could be omitted, but as a non-native speaker without experience in the field I'll leave it for other to decide. 79.138.18.89 (talk) 01:57, 22 July 2024 (UTC)
Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.