The Bit Security of Two Variants of Paillier Trapdoor Function: The Bit Security of Two Variants of Paillier Trapdoor Function

[1]  Rosario Gennaro,et al.  Paillier's Trapdoor Function Hides up to O(n) Bits , 2002, Journal of Cryptology.

[2]  Yu. V. Malykhin.  Bounds for exponential sums modulo p2 , 2007 .

[3]  Claus-Peter Schnorr,et al.  Stronger Security Proofs for RSA and Rabin Bits , 1997, Journal of Cryptology.

[4]  Manuel Blum,et al.  How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[5]  Oded Goldreich,et al.  RSA and Rabin Functions: Certain Parts are as Hard as the Whole , 1988, SIAM J. Comput..