We study the problem of integer factoring given implicit information of a special kind. The problem is as follows: let N1 = p1q1 and N2 = p2q2 be two RSA moduli of same bit-size, w...
For the first time, a proof of the sifting process (SP) and so the empirical mode decomposition (EMD), is given. For doing this, lower and upper envelopes are modeled in a more c...
El-Hadji Samba Diop, R. Alexandre, Abdel-Ouahab Bo...
The paper presents an unified Description Logic (DL) model for databases. Describing database models using DLs is a fundamental problem in many areas because it turns databases to...
Abstract. In this paper we revisit one of the most popular passwordbased key exchange protocols, namely the OKE (for Open Key Exchange) scheme, proposed by Luck in 1997. Our result...
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...