Proposing a Quantum simulator for integer factorization

Rosales Bejarano, José Luis and Martín Ayuso, Vicente (2016). Proposing a Quantum simulator for integer factorization. In: "6th International Conference on Quantum Cryptography, QCrypt 2016,", 12-16 Dic 2016, Washington, DC, Estados Unidos. p. 1.

Description

Title: Proposing a Quantum simulator for integer factorization
Author/s:
  • Rosales Bejarano, José Luis
  • Martín Ayuso, Vicente
Item Type: Presentation at Congress or Conference (Article)
Event Title: 6th International Conference on Quantum Cryptography, QCrypt 2016,
Event Dates: 12-16 Dic 2016
Event Location: Washington, DC, Estados Unidos
Date: 2016
Subjects:
Faculty: E.T.S. de Ingenieros Informáticos (UPM)
Department: Lenguajes y Sistemas Informáticos e Ingeniería del Software
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

[img]
Preview
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (303kB) | Preview

Abstract

Many cryptographic algorithms depend on computational complexity assumptions. Notorious cases are the RSA algorithm for public key criptography or the Diffie-Hellman key exchange protocol, to publicly agree on a common secret key. Both algorithms are known to be broken by quantum computing as well as those that can be reduced to a discrete logarithm problem. These are key algorithms in our digital society and are at the basis of everyday tasks, specially those that rely on digital signatures. The RSA algorithm, in particular, is probably the most used algorithm and is its assumed security the one that guards most of the e-commerce nowadays. In this case, it is the time complexity of finding the prime factors of a large number, that grows worse than polinomially with the size of the number, the main guardian of our cyberinfrastructure. The fact that a quantum computer can solve this problem in polynomial time using Shor's algorithm is seen as a potentially major disruption and has prompted security agencies to advice the progressive deprecation of these algorithms.

Funding Projects

TypeCodeAcronymLeaderTitle
Madrid Regional GovernmentS2013/ICE-2801QUITEMA D+UnspecifiedUnspecified

More information

Item ID: 46650
DC Identifier: http://oa.upm.es/46650/
OAI Identifier: oai:oa.upm.es:46650
Official URL: http://2016.qcrypt.net/
Deposited by: Memoria Investigacion
Deposited on: 21 Mar 2018 12:40
Last Modified: 21 Mar 2018 12:40
  • Logo InvestigaM (UPM)
  • Logo GEOUP4
  • Logo Open Access
  • Open Access
  • Logo Sherpa/Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Logo Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Logo de Recolecta
  • Logo del Observatorio I+D+i UPM
  • Logo de OpenCourseWare UPM