Article
Telecommunications
Evgeniy O. Kiktenko, Aleksei O. Malyshev, Aleksey K. Fedorov
Summary: A new protocol based on polar codes using blind technique for information reconciliation stage in quantum key distribution outperforms blind reconciliation with LDPC codes, especially in cases of high QBER fluctuations.
IEEE COMMUNICATIONS LETTERS
(2021)
Article
Physics, Applied
Zhengwen Cao, Xinlei Chen, Geng Chai, Kexin Liang, Yang Yuan
Summary: Information reconciliation has a significant impact on the performance of practical continuous-variable quantum key distribution (CV QKD) systems. Fixed-rate error-correction codes limit the potential applications of CV QKD due to decreased reconciliation efficiency with changing signal-to-noise ratio in the quantum channel, leading to deteriorated system performance. Therefore, we propose a rate-adaptive polar-coding-based reconciliation scheme for practical CV QKD systems with time-variant quantum channels. Experimental results demonstrate that the proposed scheme can successfully extract secret keys within the signal-to-noise ratio range of -0.5 to -4.5 dB, and the minimum frame-error rate can be less than 10-3. Moreover, the proposed scheme can promote the application of CV QKD systems in realistic environments.
PHYSICAL REVIEW APPLIED
(2023)
Article
Computer Science, Information Systems
Zengpeng Li, Ding Wang
Summary: In this research, we propose a lattice-based one-round PAKE protocol with adaptive smoothness by introducing a lattice-based SPHF. We integrate the proposed SPHF into an existing one-round framework and provide rigorous security analysis. Furthermore, we explore the possibilities of achieving two-round PAKE and universal composable security, and demonstrate the potential application in the Internet of Things.
IEEE TRANSACTIONS ON SERVICES COMPUTING
(2022)
Article
Telecommunications
Shuyan Yu, Qin Huang
Summary: This article introduces a method for constructing the reliability of decoding parity-check codes from syndromes, and proposes an algorithm for decoding and evaluating error-correction capability. This method is applicable to specific application areas such as public key encryption and optical communications.
IEEE COMMUNICATIONS LETTERS
(2022)
Review
Telecommunications
Vivek Dabra, Anju Bala, Saru Kumari
Summary: Lattice-based cryptography is an emerging field in the post-quantum world, resistant to quantum attacks. Key exchange is a crucial part of the Public Key Infrastructure (PKI), and lattices are used to design secure key exchange protocols.
TELECOMMUNICATION SYSTEMS
(2021)
Article
Computer Science, Theory & Methods
Haodong Jiang, Jiang Han, Zhenfeng Zhang, Zhi Ma, Hong Wang
Summary: This paper discusses algorithm substitution attacks (ASAs) which replace the honest implementation of a cryptographic primitive with a subverted one to aid in breaking cryptographic security. The authors present a practical and undetectable substitution method for a general randomized algorithm, and demonstrate a series of ASAs on core primitives in public-key cryptography. These attacks are universal, as they do not rely on the internal description of the underlying cryptographic algorithm, and they have practical implications for widely deployed cryptographic standards and ongoing NIST post-quantum standards.
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY
(2023)
Article
Quantum Science & Technology
Yuqi Wang, Geng Chen, Liya Jian, Yi Zhou, Shiming Liu
Summary: This paper proposes a ternary QPKC protocol by analyzing the supplementary properties of binary qubit rotation and extending it. The protocol can resist forward search attack and achieve higher security than binary QPKC protocol.
QUANTUM INFORMATION PROCESSING
(2022)
Article
Physics, Multidisciplinary
Zhixin Liu, Qiaoling Xie, Yongfu Zha, Yumin Dong
Summary: Asymmetric encryption has important applications in communication, but traditional public key encryption schemes on classical computers are vulnerable to threats when computational power is large enough. Therefore, we propose a quantum public key encryption scheme based on quantum physics properties, which does not rely on computational assumptions and can achieve encryption and decryption with fewer resources. Our scheme ensures information-theoretic security and is easily implementable.
Article
Physics, Multidisciplinary
Chi Zhang, Xiao-Long Hu, Cong Jiang, Jiu-Peng Chen, Yang Liu, Weijun Zhang, Zong-Wen Yu, Hao Li, Lixing You, Zhen Wang, Xiang-Bin Wang, Qiang Zhang, Jian-Wei Pan
Summary: Quantum key distribution provides theoretically unconditional secure key exchange, but in practice, quantum hackers can steal secure keys by observing side channels in emitted photons. This study proposes a side-channel-secure quantum key distribution protocol that is measurement-device independent and immune to all side-channel attacks. The experiment achieved a secure key rate of 1.73 x 10(-6) per pulse through a 50 km fiber spool.
PHYSICAL REVIEW LETTERS
(2022)
Article
Engineering, Electrical & Electronic
Fan Zhou, Brian M. Kurkoski
Summary: This paper presents designs and methods for nested lattice codes using Construction D' lattices for coding and convolutional code lattices for shaping, aiming to construct nested lattice codes with good coding properties, high shaping gain, and low-complexity encoding and decoding. Convolutional code generator polynomials for Construction A lattices with the greatest shaping gain are provided after an extensive search.
IEEE TRANSACTIONS ON COMMUNICATIONS
(2022)
Article
Physics, Multidisciplinary
Wenyuan Wang, Rong Wang, Chengqiu Hu, Victor Zapatero, Li Qian, Bing Qi, Marcos Curty, Hoi-Kwong Lo
Summary: We propose a fully passive linear optical quantum key distribution (QKD) source that eliminates all side channels in active modulators by implementing random decoy-state and encoding choices with postselection only. This source is general purpose and can be used in various QKD protocols. It can even potentially achieve robustness against side channels in both detectors and modulators when combined with measurement-device-independent QKD. We also perform a proof-of-principle experimental source characterization to demonstrate its feasibility.
PHYSICAL REVIEW LETTERS
(2023)
Article
Computer Science, Information Systems
Nibedita Kundu, Sumit Kumar Debnath, Dheerendra Mishra
Summary: Group signatures allow group members to sign messages while hiding their identities, but most existing schemes rely on traditional cryptographic primitives, which may be vulnerable to quantum attacks. Multivariate public key cryptography (MPKC) is a promising option that can withstand quantum attacks and is considered a potential candidate for post-quantum cryptography due to its speed and efficiency. Existing multivariate group signatures have weaknesses in terms of security and efficiency, while the proposed MPKC-based group signature in this paper overcomes these limitations by providing unforgeability, user anonymity, unlinkability, exculpability, and traceability properties.
JOURNAL OF INFORMATION SECURITY AND APPLICATIONS
(2021)
Article
Multidisciplinary Sciences
Min-Gang Zhou, Zhi-Ping Liu, Wen-Bo Liu, Chen-Long Li, Jun-Lin Bai, Yi-Ran Xue, Yao Fu, Hua-Lei Yin, Zeng-Bing Chen
Summary: This study addresses the resource consumption and time-consuming issues of numerical methods used to calculate the secure key rate in quantum key distribution protocols. It proposes a neural network prediction method that achieves fast and accurate secure key rate prediction, significantly improving computation speed and resource efficiency.
SCIENTIFIC REPORTS
(2022)
Article
Quantum Science & Technology
Randy Kuang, Maria Perepechaenko, Michel Barbeau
Summary: This article proposes a new quantum-safe cryptosystem called multivariate polynomial public key (MPPK), which derives its security from the difficulty of finding integer solutions to multivariate equations over a prime field GF(p). MPPK introduces a novel key pair generation method involving the multiplication of a base multivariate polynomial with two univariate multiplier polynomials, solvable by radicals over GF(p). The encryption and decryption process of MPPK involves polynomial evaluations and extraction.
QUANTUM INFORMATION PROCESSING
(2022)
Review
Computer Science, Information Systems
Raza Imam, Qazi Mohammad Areeb, Abdulrahman Alturki, Faisal Anwer
Summary: RSA is one of the most widely used algorithms in public key cryptography, but there is currently a lack of systematic and extensive survey in literature. This study provides a thorough investigation of RSA-based cryptography, categorizing related works into 11 different categories across multiple domains.
Article
Computer Science, Information Systems
Thomas Debris-Alazard, Leo Ducas, Wessel P. J. van Woerden
Summary: This article proposes an adaptation of the algorithmic reduction theory of lattices to binary codes, including the LLL algorithm and adaptations of associated algorithms. It demonstrates a small polynomial speed-up over existing algorithms for random binary codes, without relying on time-memory trade-offs.
IEEE TRANSACTIONS ON INFORMATION THEORY
(2022)
Article
Computer Science, Information Systems
Venkatesan Guruswami, Jonathan Moshieff, Nicolas Resch, Shashwat Silas, Mary Wootters
Summary: The article discusses the threshold rate for random codes satisfying specific properties, by studying properties defined by symmetric sets of codewords, the conclusion is reached that the threshold rate is equal to the lower bound obtained by a first-moment calculation.
IEEE TRANSACTIONS ON INFORMATION THEORY
(2022)
Article
Computer Science, Information Systems
Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters
Summary: This work investigates the list size of random linear codes for both list-decoding and list-recovery as the rate approaches capacity. Lower and upper bounds are obtained by exhibiting explicit subsets of codewords and strengthening existing results.
IEEE TRANSACTIONS ON INFORMATION THEORY
(2022)
Proceedings Paper
Computer Science, Information Systems
Maxime Bombar, Alain Couvreur, Thomas Debris-Alazard
Summary: We propose a function field version of the structured decoding problem for linear codes in the lattice-based cryptography setting. This new framework provides another perspective on structured codes such as quasi-cyclic codes and strengthens the connection between lattice-based and code-based cryptography.
ADVANCES IN CRYPTOLOGY - CRYPTO 2022, PT II
(2022)