Name
Abstract | ||
|---|---|---|
The relation between list decoding and hard-core predicates has provided a clean and easy methodology to prove the hardness of certain predicates. So far this methodology has only been used to prove that the O (loglogN ) least and most significant bits of any function with multiplicative access --which include the most common number theoretic trapdoor permutations-- are secure. In this paper we show that the method applies to all bits of any function defined on a cyclic group of order N with multiplicative access for cryptographically interesting N . As a result, in this paper we reprove the security of all bits of RSA, the discrete logarithm in a group of prime order or the Paillier encryption scheme. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-00468-1_2 | Public Key Cryptography |
Keywords | Field | DocType |
order n,certain predicate,prime order,easy methodology,cyclic group,paillier encryption scheme,multiplicative access,cryptographically interesting n,list decoding,discrete logarithm,common number theoretic trapdoor,one way function | Prime (order theory),Discrete mathematics,Cyclic group,Multiplicative function,Computer science,Permutation,Paillier cryptosystem,Arithmetic,Theoretical computer science,One-way function,List decoding,Discrete logarithm | Conference |
Volume | ISSN | Citations |
5443 | 0302-9743 | 6 |
PageRank | References | Authors |
0.48 | 8 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paz Morillo | 1 | 166 | 16.02 |
| Carla Rí/fols | 2 | 340 | 15.51 |