12,878 research outputs found
Breaking a chaos-based secure communication scheme designed by an improved modulation method
Recently Bu and Wang [Chaos, Solitons & Fractals 19 (2004) 919] proposed a
simple modulation method aiming to improve the security of chaos-based secure
communications against return-map-based attacks. Soon this modulation method
was independently cryptanalyzed by Chee et al. [Chaos, Solitons & Fractals 21
(2004) 1129], Wu et al. [Chaos, Solitons & Fractals 22 (2004) 367], and
\'{A}lvarez et al. [Chaos, Solitons & Fractals, accepted (2004),
arXiv:nlin.CD/0406065] via different attacks. As an enhancement to the Bu-Wang
method, an improving scheme was suggested by Wu et al. by removing the
relationship between the modulating function and the zero-points. The present
paper points out that the improved scheme proposed by Wu et al. is still
insecure against a new attack. Compared with the existing attacks, the proposed
attack is more powerful and can also break the original Bu-Wang scheme.
Furthermore, it is pointed out that the security of the modulation-based
schemes is not so satisfactory from a pure cryptographical point of view. The
synchronization performance of this class of modulation-based schemes is also
discussed.Comment: elsart.cls, 18 pages, 9 figure
Composable security proof for continuous-variable quantum key distribution with coherent states
We give the first composable security proof for continuous-variable quantum
key distribution with coherent states against collective attacks. Crucially, in
the limit of large blocks the secret key rate converges to the usual value
computed from the Holevo bound. Combining our proof with either the de Finetti
theorem or the Postselection technique then shows the security of the protocol
against general attacks, thereby confirming the long-standing conjecture that
Gaussian attacks are optimal asymptotically in the composable security
framework.
We expect that our parameter estimation procedure, which does not rely on any
assumption, will find applications elsewhere, for instance for the reliable
quantification of continuous-variable entanglement in finite-size settings.Comment: 27 pages, 1 figure. v2: added a version of the AEP valid for
conditional state
Return-Map Cryptanalysis Revisited
As a powerful cryptanalysis tool, the method of return-map attacks can be
used to extract secret messages masked by chaos in secure communication
schemes. Recently, a simple defensive mechanism was presented to enhance the
security of chaotic parameter modulation schemes against return-map attacks.
Two techniques are combined in the proposed defensive mechanism: multistep
parameter modulation and alternative driving of two different transmitter
variables. This paper re-studies the security of this proposed defensive
mechanism against return-map attacks, and points out that the security was much
over-estimated in the original publication for both ciphertext-only attack and
known/chosen-plaintext attacks. It is found that a deterministic relationship
exists between the shape of the return map and the modulated parameter, and
that such a relationship can be used to dramatically enhance return-map attacks
thereby making them quite easy to break the defensive mechanism.Comment: 11 pages, 7 figure
- …