http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Enhanced Upper Bound for Erasure Recovery in SPC Product Codes
Ali Muqaibel 한국전자통신연구원 2009 ETRI Journal Vol.31 No.5
Single parity check (SPC) product codes are simple yet powerful codes that are used to correct errors and/or recover erasures. The focus of this paper is to evaluate the performance of such codes under erasure scenarios and to develop a closed-form tight upper bound for the post-decoding erasure rate. Closed-form exact expressions are derived for up to seven erasures. Previously published closed-form bounds assumed that all unrecoverable patterns should contain four erasures in a square. Additional non-square patterns are accounted for in the proposed expressions. The derived expressions are verified using exhaustive search. Eight or more erasures are accounted for by using a bound. The developed expressions improve the evaluation of the recoverability of SPC product codes without the need for simulation or search algorithms, whether exhaustive or novel.
박동준,김규상,허동회,김서리,김희석,홍석희 한국통신학회 2021 ICT Express Vol.7 No.1
Although quantum mechanics guarantees the security of the quantum key distribution system, it is crucial to examine whether the implementation flaws can lead to the disclosure of sensitive information. In this paper, we propose the side-channel attack on the key reconciliation in the quantum key distribution system. In this system, the sifted key and the syndrome are used to derive a shared secret key between two users. From our attack, these can be fully recovered through a single power consumption trace measured during the syndrome computation on the sender’s side. Additionally, we propose efficient countermeasures to thwart such side-channel attacks.