Sciweavers

JOC
2007
125views more  JOC 2007»
13 years 5 months ago
Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring
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...
Jean-Sébastien Coron, Alexander May
SCN
2008
Springer
103views Communications» more  SCN 2008»
13 years 5 months ago
Full Cryptanalysis of LPS and Morgenstern Hash Functions
Collisions in the LPS cryptographic hash function of Charles, Goren and Lauter have been found by Z
Christophe Petit, Kristin Lauter, Jean-Jacques Qui...
IJNSEC
2008
96views more  IJNSEC 2008»
13 years 5 months ago
Weak Composite Diffie-Hellman
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...
Kooshiar Azimian, Javad Mohajeri, Mahmoud Salmasiz...
COLT
2008
Springer
13 years 7 months ago
Learning Random Monotone DNF Under the Uniform Distribution
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...
Linda Sellie
STOC
2006
ACM
115views Algorithms» more  STOC 2006»
14 years 5 months ago
Zero knowledge with efficient provers
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 ...
Minh-Huyen Nguyen, Salil P. Vadhan