{"title":"QKD:一百万信号任务","authors":"V. Scarani","doi":"10.3233/978-1-60750-547-1-76","DOIUrl":null,"url":null,"abstract":"I review the ideas and main results in the derivation of security bounds in quantum key distribution for keys of finite length. In particular, all the detailed studies on specific protocols and implementations indicate that no secret key can be extracted if the number of processed signals per run is smaller than 10^5-10^6. I show how these numbers can be recovered from very basic estimates.","PeriodicalId":116912,"journal":{"name":"Quantum Cryptography and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"QKD: a million signal task\",\"authors\":\"V. Scarani\",\"doi\":\"10.3233/978-1-60750-547-1-76\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"I review the ideas and main results in the derivation of security bounds in quantum key distribution for keys of finite length. In particular, all the detailed studies on specific protocols and implementations indicate that no secret key can be extracted if the number of processed signals per run is smaller than 10^5-10^6. I show how these numbers can be recovered from very basic estimates.\",\"PeriodicalId\":116912,\"journal\":{\"name\":\"Quantum Cryptography and Computing\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-10-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Quantum Cryptography and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3233/978-1-60750-547-1-76\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum Cryptography and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/978-1-60750-547-1-76","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
I review the ideas and main results in the derivation of security bounds in quantum key distribution for keys of finite length. In particular, all the detailed studies on specific protocols and implementations indicate that no secret key can be extracted if the number of processed signals per run is smaller than 10^5-10^6. I show how these numbers can be recovered from very basic estimates.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
