The Security of All Bits Using List Decoding

  • Paz Morillo
  • Carla Ràfols
Conference paper

DOI: 10.1007/978-3-642-00468-1_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5443)
Cite this paper as:
Morillo P., Ràfols C. (2009) The Security of All Bits Using List Decoding. In: Jarecki S., Tsudik G. (eds) Public Key Cryptography – PKC 2009. PKC 2009. Lecture Notes in Computer Science, vol 5443. Springer, Berlin, Heidelberg

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.

Keywords

bit security list decoding one-way function 
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Paz Morillo
    • 1
  • Carla Ràfols
    • 1
  1. 1.Dept. Matemàtica Aplicada IVUniversitat Politècnica de CatalunyaBarcelonaSpain

Personalised recommendations