@InProceedings{RivestShamir-1985-EUROCRYPT-Efficient-factoring,
  author = 	 { Ronald L. Rivest and Adi Shamir },
  title = 	 { Efficient Factoring Based on Partial Information },
  pages = 	 { 31--34 },
  OPTurl =       { http://dx.doi.org/10.1007/3-540-39805-8_3 },
  doi =          { 10.1007/3-540-39805-8_3 },
  booktitle =    { Advances in Cryptology---EUROCRYPT '85, Workshop on the Theory and
                   Applications of Cryptographic Techniques },
  isbn =         { 978-3-540-16468-5 },                  
  editor = 	 { Franz Pichler },
  publisher =    { Springer },                  
  series = 	 { Lecture Notes in Computer Science },
  volume = 	 { 219 },
  date =         { 1986 },                  
  OPTcrossref =  {},
  OPTkey = 	 {},
  OPTyear = 	 { 1985 },
  OPTmonth =     { April },                  
  eventtitle =   { EUROCRYPT '85 },                  
  eventdate =    { 1985-04 },
  venue =        { Linz, Austria },                  
  OPTnumber = 	 {},
  OPTaddress = 	 {},
  OPTmonth = 	 {},
  OPTorganization = {},
  OPTpublisher = {},
  OPTnote = 	 {},
  OPTannote = 	 {},
  abstract =     {
                   Many recently proposed cryptosystems are based on the assumption 
                   that factoring large composite integers is computationally difficult. 
                   In this paper we examine this assumption when the cryptanalyst has 
                   “side information” available.
                 },
}