information reconciliation調整(調和、融和、一致、服従? ) and privacy amplificationプラ イバシー増幅, 秘匿性増幅《quantum cryptography において, 漏洩の痕跡のある乱数を適宜( てきぎ)捨てることで暗号鍵の安全性を高めること 》

The quantum key distribution protocols described above provide Alice and Bob with nearly identical shared keys, and also with an estimate of the discrepancy between the keys. These differences can be caused by eavesdropping, but also by imperfections in the transmission line and detectors. As it is impossible to distinguish between these two types of errors, guaranteed security requires the assumption that all errors are due to eavesdropping. Provided the error rate between the keys is lower than a certain threshold (27.6% as of 2002 ), two steps can be performed to first remove the erroneous bits and then reduce Eve's knowledge of the key to an arbitrary small value. These two steps are known as information reconciliation and privacy amplification respectively, and were first described in 1988.
Information reconciliation is a form of error correction carried out between Alice and Bob's keys, in order to ensure both keys are identical. It is conducted over the public channel and as such it is vital to minimise the information sent about each key, as this can be read by Eve. A common protocol used for information reconciliation is the cascade protocol, proposed in 1994. This operates in several rounds, with both keys divided into blocks in each round and the parity of those blocks compared. If a difference in parity is found then a binary search is performed to find and correct the error. If an error is found in a block from a previous round that had correct parity then another error must be contained in that block; this error is found and corrected as before. This process is repeated recursively, which is the source of the cascade name. After all blocks have been compared, Alice and Bob both reorder their keys in the same random way, and a new round begins. At the end of multiple rounds Alice and Bob have identical keys with high probability; however, Eve has additional information about the key from the parity information exchanged. However, from a coding theory point of view information reconciliation is essentially source coding with side information. In consequence any coding scheme that works for this problem can be used for information reconciliation. Lately turbocodes, LDPC codes and polar codes have been used for this purpose improving the efficiency of the cascade protocol.
Privacy amplification is a method for reducing (and effectively eliminating) Eve's partial information about Alice and Bob's key. This partial information could have been gained both by eavesdropping on the quantum channel during key transmission (thus introducing detectable errors), and on the public channel during information reconciliation (where it is assumed Eve gains all possible parity information ). Privacy amplification uses Alice and Bob's key to produce a new, shorter key, in such a way that Eve has only negligible information about the new key. This is performed using a randomness extractor, for example, by applying a universal hash function, chosen at random from a publicly known set of such functions, which takes as its input a binary string of length equal to the key and outputs a binary string of a chosen shorter length. The amount by which this new key is shortened is calculated, based on how much information Eve could have gained about the old key (which is known due to the errors this would introduce), in order to reduce the probability of Eve having any knowledge of the new key to a very low value.
< https://en.wikipedia.org/wiki/Quantum_key_distribution#Information_reconciliation_and_privacy_amplification >
{quantum Key Distribution, QKD量子鍵配送 は、量子力学の性質を利用した暗号が実装された安全な通信方式である. 量子鍵配送では、通信を行う二者間のセキュア通信を保証するためにランダムに生成された秘密鍵を共有し、その鍵を使って情報を暗号化・復号する. 量子鍵配送は、しばしば量子暗号と呼称されるが、より正確には量子暗号技術の一手法である. また、「量子鍵配布 」とも呼ばれる.< https://ja.wikipedia.org/wiki/%E9%87%8F%E5%AD%90%E9%8D%B5%E9%85%8D%E9%80%81 >/wiki/量子鍵配送 }・ ・ keys鍵ってdeadly{全く正確な、絶対の、大いに効果的な、徹底的な、断固たる、全くの(致死の、致命的な、痛烈な、破壊的な、命がけの、命にかかわる、命取りになる、死に至る危険のある、極めて有害な、殺害を意図した、あくまでも戦う?? ? ) } weed(~の雑草を^除く[取る・引く ](マリファナ、タバコ、雑草、喪章、役に立たない人? ? ) ) 大事(必要!? )カナ?・??・ ・、・
↑↓
https://shinichiwanko2000.livedoor.blog/archives/29584706.html
2025年10月29日 BB84 protocol: Charles H. Bennett and Gilles Brassard (1984)---Quantum key distribution (QKD)

c.f, ,
https://metalife.co.jp/business-words/2554/#google_vignette
「秘匿性 」と「機密性 」の違いは?それぞれの意味や正しい使い方を解説2024/1/19

コメント

このブログの人気の投稿

after a long interval[separation ], for the first time in quite some time久しぶりのin-law 姻族インゾク?, grave cleaning墓掃除・・passingly[apropos折よい、適切な ]序ツイで? !に、done with kin親戚のも遣ヤっ付ツけてシモタ♪?? ?, ,[20250429 ]

co-opで、purchase買った・・〝easy as lite & folded軽くて折り畳みも簡単? ! 〟ori-con {ori-口 の開いた形状? ? } carry(持ち運び, , ) [20250625 ]

THE LIST,? ,, u.k. [20250611 ]