Mitsuru Hamada
A conjugate code pair is defined as a pair of linear codes such that one contains the dual of the other. The conjugate code pair represents the essential structure of the corresponding Calderbank-Shor-Steane (CSS) quantum code. It is argued that conjugate code pairs are applicable to quantum cryptography in order to motivate studies on conjugate code pairs.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
A generalization of the quantum cryptographic protocol by Bennett and Brassard is discussed, using three conjugate bases, i.e. six states. By calculating the optimal mutual information between sender and eavesdropper it is shown that this scheme is safer against eavesdropping on single qubits than the one based on two conjugate bases. We also address the question for a connection between the maximal classical correlation in a generalized Bell inequality and the intersection of mutual informations between sender/receiver and sender/eavesdropper.
We consider the Bennett-Brassard cryptographic scheme, which uses two conjugate quantum bases. An eavesdropper who attempts to obtain information on qubits sent in one of the bases causes a disturbance to qubits sent in the other basis. We derive an upper bound to the accessible information in one basis, for a given error rate in the conjugate basis. Independently fixing the error rate in the conjugate bases, we show that both bounds can be attained simultaneously by an optimal eavesdropping probe, consisting of two qubits. The qubits' interaction and their subsequent measurement are described…
A conjugate code pair is defined as a pair of linear codes either of which contains the dual of the other. A conjugate code pair represents the essential structure of the corresponding Calderbank-Shor-Steane (CSS) quantum code. It is known that conjugate code pairs are applicable to (quantum) cryptography. We give a construction method for efficiently decodable conjugate code pairs.
It is shown that the optimum strategy of the eavesdropper, as described in the preceding paper, can be expressed in terms of a quantum circuit in a way which makes it obvious why certain parameters take on particular values, and why obtaining information in one basis gives rise to noise in the conjugate basis.
We provide a complete proof of the security of quantum cryptography against any eavesdropping attack including coherent measurements even in the presence of noise. Polarization-based cryptographic schemes are shown to be equivalent to EPR-based schemes. We also show that the performance of a noisy channel approaches that of a noiseless one as the error rate tends to zero. (i.e., the secrecy capacity $C_s (ε) \to C_s (0)$ as $ε\to 0$.) One implication of our results is that one can {\it double} the efficiency of a most well-known quantum cryptographic scheme proposed by Bennett and Brassard sim…
We analyze the security of quantum cryptography schemes for $d$-level systems using 2 or $d+1$ maximally conjugated bases, under individual eavesdropping attacks based on cloning machines and measurement after the basis reconciliation. We consider classical advantage distillation protocols, that allow to extract a key even in situations where the mutual information between the honest parties is smaller than the eavesdropper's information. In this scenario, advantage distillation protocols are shown to be as powerful as quantum distillation: key distillation is possible using classical techniqu…
The cloning of quantum variables with continuous spectra is investigated. We define a Gaussian 1-to-2 cloning machine, which copies equally well two conjugate variables such as position and momentum or the two quadrature components of a light mode. The resulting cloning fidelity for coherent states, namely $F=2/3$, is shown to be optimal. An asymmetric version of this Gaussian cloner is then used to assess the security of a continuous-variable quantum key distribution scheme that allows two remote parties to share a Gaussian key. The information versus disturbance tradeoff underlying this cont…
As an alternative to the usual key generation by two-way communication in schemes for quantum cryptography, we consider codes for key generation by one-way communication. We study codes that could be applied to the raw key sequences that are ideally obtained in recently proposed scenarios for quantum key distribution, which can be regarded as communication through symmetric four-letter channels.
We consider the distinguishability of Gaussian states from the view point of continuous-variable quantum cryptography using post-selection. Specifically, we use the probability of error to distinguish between two pure coherent (squeezed) states and two particular mixed symmetric coherent (squeezed) states where each mixed state is an incoherent mixture of two pure coherent (squeezed) states with equal and opposite displacements in the conjugate quadrature. We show that the two mixed symmetric Gaussian states (where the various components have the same real part) never give an eavesdropper more…
Quantum key distribution protocols based on equiangular spherical codes are introduced and their behavior under the intercept/resend attack investigated. Such protocols offer a greater range of secure noise tolerance and speed options than protocols based on their cousins, the mutually-unbiased bases, while also enabling the determination of the channel noise rate without the need to sacrifice key bits. For fixed number of signal states in a given dimension, the spherical code protocols offer Alice and Bob more noise tolerance at the price of slower key generation rates.
In the last few years the world in which Quantum Cryptography evolves has deeply changed. On the one side the revelations of Snowden, though he said nothing really new, made the world more aware of the importance to protect sensitive data from all kinds of adversaries, including sometimes "friends." On the other side, breakthroughs in quantum computation, in particular in superconducting qubits and surface-codes, made it possible that in 15 to 25 years there might be a quantum machine able to break today's codes. This implies that in order to protect today's data over a few decades, one has to…
Recently, position-based quantum cryptography has been claimed to be unconditionally secure. In contrary, here we show that the existing proposals for position-based quantum cryptography are, in fact, insecure if entanglement is shared among two adversaries. Specifically, we demonstrate how the adversaries can incorporate ideas of quantum teleportation and quantum secret sharing to compromise the security with certainty. The common flaw to all current protocols is that the Pauli operators always map a codeword to a codeword (up to an irrelevant overall phase). We propose a modified scheme lack…
We give a brief introduction to private quantum codes, a basic notion in quantum cryptography and key distribution. Private code states are characterized by indistinguishability of their output states under the action of a quantum channel, and we show that higher rank numerical ranges can be used to describe them. We also show how this description arises naturally via conjugate channels and the bridge between quantum error correction and cryptography.
The problem of unconditional security of quantum cryptography (i.e. the security which is guaranteed by the fundamental laws of nature rather than by technical limitations) is one of the central points in quantum information theory. We propose a relativistic quantum cryptosystem and prove its unconditional security against any eavesdropping attempts. Relativistic causality arguments allow to demonstrate the security of the system in a simple way. Since the proposed protocol does not employ collective measurements and quantum codes, the cryptosystem can be experimentally realized with the prese…
A Bravyi-König theorem for Floquet codes generated by locally conjugate instantaneous stabiliser groups
本文提出Floquet码中基于局部共轭稳定子群的Bravyi-König定理成立，并引入广义单位元以实现有效逻辑操作。
The concept of asymptotic correctability of Bell-diagonal quantum states is generalised to elementary quantum systems of higher dimensions. Based on these results basic properties of quantum state purification protocols are investigated which are capable of purifying tensor products of Bell-diagonal states and which are based on $B$-steps of the Gottesman-Lo-type with the subsequent application of a Calderbank-Shor-Steane quantum code. Consequences for maximum tolerable error rates of quantum cryptographic protocols are discussed.
Although practised as an art and science for ages, cryptography had to wait until the mid-twentieth century before Claude Shannon gave it a strong mathematical foundation. However, Shannon's approach was rooted is his own information theory, itself inspired by the classical physics of Newton and Einstein. But our world is ruled by the laws of quantum mechanics. When quantum-mechanical phenomena are taken into account, new vistas open up both for codemakers and codebreakers. Is quantum mechanics a blessing or a curse for the protection of privacy? As we shall see, the jury is still out!
An efficient quantum cryptography network protocol is proposed with d-dimension polarized photons, without resorting to entanglement and quantum memory. A server on the network, say Alice, provides the service for preparing and measuring single photons whose initial state are |0>. The users code the information on the single photons with some unitary operations. For preventing the untrustworthy server Alice from eavesdropping the quantum lines, a nonorthogonal-coding technique (decoy-photon technique) is used in the process that the quantum signal is transmitted between the users. This protoco…
The present thesis deals with various methods of quantum error correction. It is divided into two parts. In the first part, dynamical decoupling methods are considered which have the task of suppressing the influence of residual imperfections in a quantum memory. The suppression is achieved by altering the dynamics of an imperfect quantum memory with the help of a sequence of local unitary operations applied to the qudits. Whereas up to now the operations of such decoupling sequences have been constructed in a deterministic fashion, strategies are developed in this thesis which construct the o…
We have improved the hardware and software of our autocompensating system for quantum key distribution by replacing bulk optical components at the end stations with fiber-optic equivalents and implementing software that synchronizes end-station activities, communicates basis choices, corrects errors and performs privacy amplification over a local area network. The all fiber-optic arrangement provides stable, efficient and high-contrast routing of the photons. The low bit error rate leads to high error correction efficiency and minimizes data sacrifice during privacy amplification. Characteriza…
This is a semi-popular overview of quantum entanglement as an important physical resource in the field of data security and quantum computing. After a brief outline of entanglement's key role in philosophical debates about the meaning of quantum mechanics I describe its current impact on both cryptography and cryptanalysis. The paper is based on the lecture given at the conference "Geometric Issues in the Foundations of Science" (Oxford, June 1996) in honor of Roger Penrose.
We examine a situation in which an information-carrying signal is sent from two sources to a common receiver. The radiation travels through free space in the presence of noise. The information resides in a relationship between the two beams. We inquire into whether itis possible, in principle, that the locations of the transmitters can be concealed from a party who receives the radiation and decodes the information. Direction finding entails making a set of measurements on asignal and constructing an analytic continuation of the time dependent fields from the results. The fact that this proces…
[Shortened abstract:] This thesis investigates the importance of quantum memory in quantum cryptography, concentrating on quantum key distribution schemes. In the hands of an eavesdropper -- a quantum memory is a powerful tool, putting in question the security of quantum cryptography; Classical privacy amplification techniques, used to prove security against less powerful eavesdroppers, might not be effective when the eavesdropper can keep quantum states for a long time. In this work we suggest a possible direction for approaching this problem. We define strong attacks of this type, and show s…
Quantum-Safe Code Auditing: LLM-Assisted Static Analysis and Quantum-Aware Risk Scoring for Post-Quantum Cryptography Migration
本文提出量子安全代码审计工具，结合正则表达式检测量子脆弱算法、LLM辅助上下文丰富及VQE模型风险评分，评估五个开源库发现5775项问题，实现高精度和召回率。
Secret Entanglement, Public Geometry. Quantum Cryptography from a Geometric Perspective
从几何视角提出量子密码学的新方法，利用纠缠分层和几何度量实现信息编码与安全传输。
In this paper, we introduce the concept of dual universality of hash functions and present its applications to quantum cryptography. We begin by establishing the one-to-one correspondence between a linear function family {\cal F} and a code family {\cal C}, and thereby defining \varepsilon-almost dual universal_2 hash functions, as a generalization of the conventional universal_2 hash functions. Then we show that this generalized (and thus broader) class of hash functions is in fact sufficient for the security of quantum cryptography. This result can be explained in two different formalisms. F…
Logical Spectroscopy: Lifted-Product Codes with Addressable Bases
研究量子LDPC存储器中提升积码问题，用逻辑光谱方法，通过有限域计算构建可寻址共轭逻辑基，还给出设计诊断及工作坐标，让提升积码有类似超图积码特征且保留布局自由。
The recent discovery of fully-homomorphic classical encryption schemes has had a dramatic effect on the direction of modern cryptography. Such schemes, however, implicitly rely on the assumptions that solving certain computation problems are intractable. Here we present a quantum encryption scheme which is homomorphic for arbitrary classical and quantum circuits which have at most some constant number of non-Clifford gates. Unlike classical schemes, the security of the scheme we present is information theoretic and hence independent of the computational power of an adversary.
The speed at which two remote parties can exchange secret keys over a fixed-length fiber-optic cable in continuous-variable quantum key distribution (CV-QKD) is currently limited by the computational complexity of post-processing algorithms for key reconciliation. Multi-edge low-density parity-check (LDPC) codes with low code rates and long block lengths were proposed for CV-QKD, in order to extend the maximum reconciliation distance between the two remote parties. Key reconciliation over multiple dimensions has been shown to further improve the error-correction performance of multi-edge LDPC …
On Lattices, Learning with Errors, Random Linear Codes, and Cryptography
本文将最坏情况格问题（如GapSVP和SIVP）量子归约到带误差学习问题，并提出一种基于该问题的高效公钥密码系统，显著降低了公钥和密文扩展开销。
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding and encoded Hilbert spaces. However, this bound only applies to codes which recover the message exactly. Naively, one might expect that correcting errors to very high fidelity would only allow small violations of this bound. This intuition is incorrect: in this paper we describe quantum error-correcting codes capable of correcting up to (n-1)/2 arbitrary errors with fidelity exponentially close to 1, at the price of i…
Quantum Arithmetic Circuits in Public-Key Cryptography
介绍公钥密码学中量子算术电路，阐述其面临的设计挑战，强调基于测量的反计算等优化策略，回顾基本算术运算的最新设计及量子密码分析中容错运行时和资源估计技术，为评估量子密码分析能力提供基础。
Quantum Error Correction in Adversarial Regimes
本研究针对对抗性环境下的量子纠错，提出推广的Knill-Laflamme条件以识别可列表解码的码，并基于伪随机幺正变换构建了安全的无歧义列表解码协议，能抵御量子多项式时间对手。
Hybrid Schemes of NIST Post-Quantum Cryptography Standard Algorithms and Quantum Key Distribution for Key Exchange and Digital Signature
本研究结合NIST标准化后量子密码算法与量子密钥分发，提出包含密钥交换和数字签名的混合安全方案，通过熵值、分布特性、计算耗时等指标验证了方案的可行性，构建了双层安全模型。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。