Skip to main content
SpringerLink
Log in
Book cover

International Conference on Cryptology in Malaysia

Mycrypt 2005: Progress in Cryptology – Mycrypt 2005 pp 222–228Cite as

Twin RSA

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNSC,volume 3715)

Abstract

We introduce Twin RSA, pairs of RSA moduli (n,n+2), and formulate several questions related to it. Our main questions are: is Twin RSA secure, and what is it good for?

Keywords

  • recreational cryptography

This is a preview of subscription content, access via your institution.

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Coppersmith, D.: Finding a small root of a bivariate integer equation; factoring with high bits known. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 178–189. Springer, Heidelberg (1996)

    Google Scholar 

  2. Colliding, X.: 509 Certificates, see http://www.win.tue.nl/~bdeweger/CollidingCertificates/

  3. Cunningham project, see http://www.cerias.purdue.edu/homes/ssw/cun/

  4. Dodson, B.: email announcement of the ECM factorization of M963, April 6 (2005)

    Google Scholar 

  5. Lenstra, A.K.: Generating RSA moduli with a predetermined portion. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 1–10. Springer, Heidelberg (1998)

    CrossRef  Google Scholar 

  6. Lenstra, A.K., de Weger, B.M.M.: On the possibility of constructing meaningful hash collisions for public keys. In: Boyd, C., González Nieto, J.M. (eds.) ACISP 2005. LNCS, vol. 3574, pp. 267–279. Springer, Heidelberg (2005)

    CrossRef  Google Scholar 

  7. Shamir, A.: RSA for paranoids. RSA Laboratories’ Cryptobytes 1(3), 1–4 (1995)

    Google Scholar 

  8. Vanstone, S.A., Zuccherato, R.J.: Short RSA keys and their generation. J. Cryptology 8, 101–114 (1995)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lucent Technologies, Bell Laboratories, Room 2T-504 600 Mountain Avenue, P.O.Box 636, Murray Hill, NJ, 07974-0636, USA

    Arjen K. Lenstra

  2. Technische Universiteit Eindhoven, P.O.Box 513, 5600 MB, Eindhoven, The Netherlands

    Arjen K. Lenstra & Benjamin M. M. de Weger

Authors
  1. Arjen K. Lenstra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Benjamin M. M. de Weger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Information Security Institute, Queensland University of Technology, GPO Box 2434, 4001, Brisbane, Queensland, Australia

    Ed Dawson

  2. EPFL, CH-1015, Lausanne, Switzerland

    Serge Vaudenay

Rights and permissions

Reprints and Permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lenstra, A.K., de Weger, B.M.M. (2005). Twin RSA. In: Dawson, E., Vaudenay, S. (eds) Progress in Cryptology – Mycrypt 2005. Mycrypt 2005. Lecture Notes in Computer Science, vol 3715. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11554868_16

Download citation

  • DOI: https://doi.org/10.1007/11554868_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28938-8

  • Online ISBN: 978-3-540-32066-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

search

Navigation