1c:I[419806,["/_next/static/chunks/bb923814e1f4d2e9.js","/_next/static/chunks/dd3ee9f5b7716ca6.js","/_next/static/chunks/4204a0ae82542ca8.js","/_next/static/chunks/1270dead247da766.js","/_next/static/chunks/6e1aa89a642f40be.js","/_next/static/chunks/2d7aa753e81324a8.js","/_next/static/chunks/8ffd0b71567920d8.js","/_next/static/chunks/67ea6dfd21f16c5f.js","/_next/static/chunks/24eb4379f68013fd.js","/_next/static/chunks/b8cd775ffdf935bd.js","/_next/static/chunks/983103cd9eb7b428.js","/_next/static/chunks/263f2cdcb9aa2341.js","/_next/static/chunks/294b9525248c8e5f.js"],"default"] 1d:T42c,We re-examine Paillier's cryptosystem, and show that by choosing a particular discrete log base g, and by introducing an alternative decryption procedure, we can extend the scheme to allow an arbitrary exponent e instead of N. The use of low exponents substantially increases the efficiency of the scheme. The semantic security is now based on a new decisional assumption, namely the hardness of deciding whether an element is a "small" e-th residue modulo N2.We also show how to use Paillier's original cryptosystem to build a trapdoor commitment scheme. This new scheme is information-theoretically private, and computationally binding (this property holds under the assumption that the RSA function with exponent N is hard to invert). A novel property of this new commitment scheme is that most of the work can be done offline before knowing the message one wants to commit to. Once the message is known only two multiplications are required. This is the first trapdoor commitment scheme with this online-offline efficiency property which is also length-preserving.1e:T436,Let N have a prime divisor p such that p + 1 p + 1 has only small prime divisors. A method is described which will allow for the determination of p, given N. This method is analogous to the p − 1 p - 1 method of factoring which was described in 1974 by Pollard. The results of testing this method on a large number of composite numbers are also presented.1f:T636,

	Year	Citations

References