JOC
2007
14 years 5 months ago
2007
Abstract. We address one of the most fundamental problems concerning the RSA cryptosystem: does the knowledge of the RSA public and secret key-pair (e, d) yield the factorization o...
SCN
2008
Springer
14 years 5 months ago
2008
Springer
Collisions in the LPS cryptographic hash function of Charles, Goren and Lauter have been found by Z
IJNSEC
2008
14 years 5 months ago
2008
In1985, Shmuley proposed a theorem about intractability of Composite Diffie-Hellman. The theorem of Shmuley may be paraphrased as saying that if there exist a probabilistic polyno...
COLT
2008
Springer
14 years 7 months ago
2008
Springer
We show that randomly generated monotone c log(n)-DNF formula can be learned exactly in probabilistic polynomial time. Our notion of randomly generated is with respect to a unifor...
STOC
2006
ACM
15 years 6 months ago
2006
ACM
We prove that every problem in NP that has a zero-knowledge proof also has a zero-knowledge proof where the prover can be implemented in probabilistic polynomial time given an NP ...