Efficient Factoring Based on Partial Information

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 219)


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.


  1. [B183]
    Blum, Manuel. “How to exchange secrets,” Proc. 15th Annual ACM STOC Conference (1983), 440–447.Google Scholar
  2. [Le81]
    Lenstra, H. W., Jr. “Integer programming in a fixed number of variables,” Report 81-03, Mathematisch Institut, Universitat ban Amsterdam (1981).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  1. 1.MIT Laboratory for Computer ScienceCambridgeUSA
  2. 2.Applied Math. Dept.The Weizmann Institute of ScienceRehovotIsrael

Personalised recommendations