In this paper we present experiments in order to show how some pseudo random number generators can improve the effectiveness of a statistical cryptanalysis algorithm. We deduce mainly that a better generator enhance the accuracy of the cryptanalysis algorithm.

No abstract

No abstract

The aim of this paper is to provide two distributed versions of Boneh elliptic curve cryptography (BECC) algorithm. We give a proof of semantic security for the first one. This guaranties that our algorithm is semantically secure in the contest of active non-adaptive adversary. Furthermore, we prove that the second version of our distributed scheme is computationally more efficient in time computation than ElGamal elliptic curve threshold cryptosystem and secure under the Subgroup Decision Problem assumption.