IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v8y2020i12p2126-d452249.html
   My bibliography  Save this article

Factorization and Malleability of RSA Moduli, and Counting Points on Elliptic Curves Modulo N

Author

Listed:
  • Luis V. Dieulefait

    (Departament de Matemàtiques i Informàtica, Universitat de Barcelona, Gran Via de les Corts Catalanes 585, 08007 Barcelona, Spain)

  • Jorge Urroz

    (Departamento de Matemáticas, Universitat Politécnica Catalunya, Edificio C3—Campus Nord UPC, Carrer de Jordi Girona 1-3, 08034 Barcelona, Spain)

Abstract

In this paper we address two different problems related with the factorization of an RSA (Rivest–Shamir–Adleman cryptosystem) modulus N . First we show that factoring is equivalent, in deterministic polynomial time, to counting points on a pair of twisted Elliptic curves modulo N . The second problem is related with malleability. This notion was introduced in 2006 by Pailler and Villar, and deals with the question of whether or not the factorization of a given number N becomes substantially easier when knowing the factorization of another one N ′ relatively prime to N . Despite the efforts done up to now, a complete answer to this question was unknown. Here we settle the problem affirmatively. To construct a particular N ′ that helps the factorization of N , we use the number of points of a single elliptic curve modulo N . Coppersmith’s algorithm allows us to go from the factors of N ′ to the factors of N in polynomial time.

Suggested Citation

  • Luis V. Dieulefait & Jorge Urroz, 2020. "Factorization and Malleability of RSA Moduli, and Counting Points on Elliptic Curves Modulo N," Mathematics, MDPI, vol. 8(12), pages 1-10, November.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:12:p:2126-:d:452249
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/12/2126/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/8/12/2126/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:8:y:2020:i:12:p:2126-:d:452249. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.