Security of virtual-optics-based cryptosystem

We present a security analysis to the virtual optics (VO)-based cryptosystems, in which several aspects affecting security strength of the algorithm involved in such systems are considered. We start with the evaluation of the computational complexities of virtual-optical-imaging (VOI)-based and virtual-optical-holography (VOH)-based cryptosystems as the security strength of a cryptosystem is relevant to its computational complexity. Furthermore, we assess the key length and key space of both VOI- and VOH-based cryptosystems, respectively, to show their performance. Other cryptographic properties such as confusion and diffusion, nonlinearity, as well as resistant capacity to potential attacks are also explored to illustrate the security of VO-based cryptosystem. Finally the scheme of hardware encryption based on virtual optics is briefly discussed.     

Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice

In Eurocrypt 2004 Augot and Finiasz presented a coding theoretic public key cryptosystem that suggests a new approach for designing such systems based on the Polynomial Reconstruction Problem (PR). Their cryptosystem is an instantiation of this approach under a specific choice of parameters which, given the state of the art of coding theory, we show in this work to be sub-optimal. Coron showed how to attack the Augot and Finiasz cryptosystem. A question left open is whether the general approach suggested by the cryptosystem works or not. In this work, we show that the general approach (rather than only the instantiation) is broken as well.