Advances in Cryptology — EUROCRYPT'98

TL;DR: The implementation in software shows that the decryption time of NICE is comparably as fast as the encryption time of the RSA cryptosystem with e = 216+1, but not so fast as in software implementation.

TL;DR: This paper studies this extended setting of RSA and quantifies the number of bits of d required to mount practical partial key exposure attacks, based on Coppersmith's heuristic methods and validated by practical experiments run through the SAGE computer-algebra system.

TL;DR: This paper presents a generic technique to make a highly secure cryptosystem from any partially trapdoor one-way function, in the random oracle model, and presents the first scheme whose security is relative to the factorization of large integers, with a perfect reduction.

TL;DR: The parametrization provides a tight tradeoff between the running time and the extraction error of the algorithm, which allows optimizing the parameters to minimize: the soundness error for interactive proofs, or the extraction time for proofs of knowledge.