3,039 research outputs found
A Pseudo DNA Cryptography Method
The DNA cryptography is a new and very promising direction in cryptography
research. DNA can be used in cryptography for storing and transmitting the
information, as well as for computation. Although in its primitive stage, DNA
cryptography is shown to be very effective. Currently, several DNA computing
algorithms are proposed for quite some cryptography, cryptanalysis and
steganography problems, and they are very powerful in these areas. However, the
use of the DNA as a means of cryptography has high tech lab requirements and
computational limitations, as well as the labor intensive extrapolation means
so far. These make the efficient use of DNA cryptography difficult in the
security world now. Therefore, more theoretical analysis should be performed
before its real applications.
In this project, We do not intended to utilize real DNA to perform the
cryptography process; rather, We will introduce a new cryptography method based
on central dogma of molecular biology. Since this method simulates some
critical processes in central dogma, it is a pseudo DNA cryptography method.
The theoretical analysis and experiments show this method to be efficient in
computation, storage and transmission; and it is very powerful against certain
attacks. Thus, this method can be of many uses in cryptography, such as an
enhancement insecurity and speed to the other cryptography methods. There are
also extensions and variations to this method, which have enhanced security,
effectiveness and applicability.Comment: A small work that quite some people asked abou
Applications of single-qubit rotations in quantum public-key cryptography
We discuss cryptographic applications of single-qubit rotations from the
perspective of trapdoor one-way functions and public-key encryption. In
particular, we present an asymmetric cryptosystem whose security relies on
fundamental principles of quantum physics. A quantum public key is used for the
encryption of messages while decryption is possible by means of a classical
private key only. The trapdoor one-way function underlying the proposed
cryptosystem maps integer numbers to quantum states of a qubit and its
inversion can be infeasible by virtue of the Holevo's theorem.Comment: to appear in Phys. Rev.
Security of quantum cryptography using balanced homodyne detection
In this paper we investigate the security of a quantum cryptographic scheme
which utilizes balanced homodyne detection and weak coherent pulse (WCP). The
performance of the system is mainly characterized by the intensity of the WCP
and postselected threshold. Two of the simplest intercept/resend eavesdropping
attacks are analyzed. The secure key gain for a given loss is also discussed in
terms of the pulse intensity and threshold.Comment: RevTeX4, 8pages, 7 figure
Some Physics And System Issues In The Security Analysis Of Quantum Key Distribution Protocols
In this paper we review a number of issues on the security of quantum key
distribution (QKD) protocols that bear directly on the relevant physics or
mathematical representation of the QKD cryptosystem. It is shown that the
cryptosystem representation itself may miss out many possible attacks which are
not accounted for in the security analysis and proofs. Hence the final security
claims drawn from such analysis are not reliable, apart from foundational
issues about the security criteria that are discussed elsewhere. The cases of
continuous-variable QKD and multi-photon sources are elaborated upon
Security of practical private randomness generation
Measurements on entangled quantum systems necessarily yield outcomes that are
intrinsically unpredictable if they violate a Bell inequality. This property
can be used to generate certified randomness in a device-independent way, i.e.,
without making detailed assumptions about the internal working of the quantum
devices used to generate the random numbers. Furthermore these numbers are also
private, i.e., they appear random not only to the user, but also to any
adversary that might possess a perfect description of the devices. Since this
process requires a small initial random seed, one usually speaks of
device-independent randomness expansion.
The purpose of this paper is twofold. First, we point out that in most real,
practical situations, where the concept of device-independence is used as a
protection against unintentional flaws or failures of the quantum apparatuses,
it is sufficient to show that the generated string is random with respect to an
adversary that holds only classical-side information, i.e., proving randomness
against quantum-side information is not necessary. Furthermore, the initial
random seed does not need to be private with respect to the adversary, provided
that it is generated in a way that is independent from the measured systems.
The devices, though, will generate cryptographically-secure randomness that
cannot be predicted by the adversary and thus one can, given access to free
public randomness, talk about private randomness generation.
The theoretical tools to quantify the generated randomness according to these
criteria were already introduced in [S. Pironio et al, Nature 464, 1021
(2010)], but the final results were improperly formulated. The second aim of
this paper is to correct this inaccurate formulation and therefore lay out a
precise theoretical framework for practical device-independent randomness
expansion.Comment: 18 pages. v3: important changes: the present version focuses on
security against classical side-information and a discussion about the
significance of these results has been added. v4: minor changes. v5: small
typos correcte
Finite-Block-Length Analysis in Classical and Quantum Information Theory
Coding technology is used in several information processing tasks. In
particular, when noise during transmission disturbs communications, coding
technology is employed to protect the information. However, there are two types
of coding technology: coding in classical information theory and coding in
quantum information theory. Although the physical media used to transmit
information ultimately obey quantum mechanics, we need to choose the type of
coding depending on the kind of information device, classical or quantum, that
is being used. In both branches of information theory, there are many elegant
theoretical results under the ideal assumption that an infinitely large system
is available. In a realistic situation, we need to account for finite size
effects. The present paper reviews finite size effects in classical and quantum
information theory with respect to various topics, including applied aspects
- …