1,158 research outputs found
Successful attack on permutation-parity-machine-based neural cryptography
An algorithm is presented which implements a probabilistic attack on the
key-exchange protocol based on permutation parity machines. Instead of
imitating the synchronization of the communicating partners, the strategy
consists of a Monte Carlo method to sample the space of possible weights during
inner rounds and an analytic approach to convey the extracted information from
one outer round to the next one. The results show that the protocol under
attack fails to synchronize faster than an eavesdropper using this algorithm.Comment: 4 pages, 2 figures; abstract changed, note about chaos cryptography
added, typos correcte
On lower bounds for circuit complexity and algorithms for satisfiability
This work is devoted to explore the novel method of proving circuit lower bounds for the class NEXP by Ryan Williams. Williams is able to show two circuit lower bounds: A conditional lower bound which says that NEXP does not have polynomial size circuits if there exists better-than-trivial algorithms for CIRCUIT SAT and an inconditional lower bound which says that NEXP does not have polynomial size circuits of the class ACC^0. We put special emphasis on the first result by exposing, in as much as of a self-contained manner as possible, all the results from complexity theory that Williams use in his proof. In particular, the focus is put in an efficient reduction from non-deterministic computations to satisfiability of Boolean formulas. The second result is also studied, although not as thoroughly, and some pointers with regards to the relationship of Williams' method and the known complexity theory barriers are given
An Analysis of Error Reconciliation Protocols for use in Quantum Key Distribution
Quantum Key Distribution (QKD) is a method for transmitting a cryptographic key between a sender and receiver in a theoretically unconditionally secure way. Unfortunately, the present state of technology prohibits the flawless quantum transmission required to make QKD a reality. For this reason, error reconciliation protocols have been developed which preserve security while allowing a sender and receiver to reconcile the errors in their respective keys. The most famous of these protocols is Brassard and Salvail\u27s Cascade, which is effective, but suffers from a high communication complexity and therefore results in low throughput. Another popular option is Buttler\u27s Winnow protocol, which reduces the communication complexity over Cascade, but has the added detriment of introducing errors, and has been shown to be less effective than Cascade. Finally, Gallager\u27s Low Density Parity Check (LDPC) codes have recently been shown to reconcile errors at rates higher than those of Cascade and Winnow with a large reduction in communication, but with greater computational complexity. This research seeks to evaluate the effectiveness of these LDPC codes in a QKD setting, while comparing real-world parameters such as runtime, throughput and communication complexity empirically with the well-known Cascade and Winnow algorithms. Additionally, the effects of inaccurate error estimation, non-uniform error distribution and varying key length on all three protocols are evaluated for identical input key strings. Analyses are performed on the results in order to characterize the performance of all three protocols and determine the strengths and weaknesses of each
Efficient Error detection Architectures for Low-Energy Block Ciphers with the Case Study of Midori Benchmarked on FPGA
Achieving secure, high performance implementations for constrained applications such as implantable and wearable medical devices is a priority in efficient block ciphers. However, security of these algorithms is not guaranteed in presence of malicious and natural faults. Recently, a new lightweight block cipher, Midori, has been proposed which optimizes the energy consumption besides having low latency and hardware complexity. This algorithm is proposed in two energy-efficient varients, i.e., Midori64 and Midori128, with block sizes equal to 64 and 128 bits. In this thesis, fault diagnosis schemes for variants of Midori are proposed. To the best of the our knowledge, there has been no fault diagnosis scheme presented in the literature for Midori to date. The fault diagnosis schemes are provided for the nonlinear S-box layer and for the round structures with both 64-bit and 128-bit Midori symmetric key ciphers. The proposed schemes are benchmarked on field-programmable gate array (FPGA) and their error coverage is assessed with fault-injection simulations. These proposed error detection architectures make the implementations of this new low-energy lightweight block cipher more reliable
A Framework for Efficient Adaptively Secure Composable Oblivious Transfer in the ROM
Oblivious Transfer (OT) is a fundamental cryptographic protocol that finds a
number of applications, in particular, as an essential building block for
two-party and multi-party computation. We construct a round-optimal (2 rounds)
universally composable (UC) protocol for oblivious transfer secure against
active adaptive adversaries from any OW-CPA secure public-key encryption scheme
with certain properties in the random oracle model (ROM). In terms of
computation, our protocol only requires the generation of a public/secret-key
pair, two encryption operations and one decryption operation, apart from a few
calls to the random oracle. In~terms of communication, our protocol only
requires the transfer of one public-key, two ciphertexts, and three binary
strings of roughly the same size as the message. Next, we show how to
instantiate our construction under the low noise LPN, McEliece, QC-MDPC, LWE,
and CDH assumptions. Our instantiations based on the low noise LPN, McEliece,
and QC-MDPC assumptions are the first UC-secure OT protocols based on coding
assumptions to achieve: 1) adaptive security, 2) optimal round complexity, 3)
low communication and computational complexities. Previous results in this
setting only achieved static security and used costly cut-and-choose
techniques.Our instantiation based on CDH achieves adaptive security at the
small cost of communicating only two more group elements as compared to the
gap-DH based Simplest OT protocol of Chou and Orlandi (Latincrypt 15), which
only achieves static security in the ROM
Units of rotational information
Entanglement in angular momentum degrees of freedom is a precious resource
for quantum metrology and control. Here we study the conversions of this
resource, focusing on Bell pairs of spin-J particles, where one particle is
used to probe unknown rotations and the other particle is used as reference.
When a large number of pairs are given, we show that every rotated spin-J Bell
state can be reversibly converted into an equivalent number of rotated spin
one-half Bell states, at a rate determined by the quantum Fisher information.
This result provides the foundation for the definition of an elementary unit of
information about rotations in space, which we call the Cartesian refbit. In
the finite copy scenario, we design machines that approximately break down Bell
states of higher spins into Cartesian refbits, as well as machines that
approximately implement the inverse process. In addition, we establish a
quantitative link between the conversion of Bell states and the simulation of
unitary gates, showing that the fidelity of probabilistic state conversion
provides upper and lower bounds on the fidelity of deterministic gate
simulation. The result holds not only for rotation gates, but also to all sets
of gates that form finite-dimensional representations of compact groups. For
rotation gates, we show how rotations on a system of given spin can simulate
rotations on a system of different spin.Comment: 25 pages + appendix, 7 figures, new results adde
- …