Proposing a Quantum simulator for integer factorization

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

Descripción

Título: Proposing a Quantum simulator for integer factorization
Autor/es:
  • Rosales Bejarano, José Luis
  • Martín Ayuso, Vicente
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: 6th International Conference on Quantum Cryptography, QCrypt 2016,
Fechas del Evento: 12-16 Dic 2016
Lugar del Evento: Washington, DC, Estados Unidos
Fecha: 2016
Materias:
Escuela: E.T.S. de Ingenieros Informáticos (UPM)
Departamento: Lenguajes y Sistemas Informáticos e Ingeniería del Software
Licencias Creative Commons: Reconocimiento - Sin obra derivada - No comercial

Texto completo

[img]
Vista Previa
PDF (Document Portable Format) - Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (303kB) | Vista Previa

Resumen

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.

Proyectos asociados

TipoCódigoAcrónimoResponsableTítulo
Comunidad de MadridS2013/ICE-2801QUITEMA D+Sin especificarSin especificar

Más información

ID de Registro: 46650
Identificador DC: http://oa.upm.es/46650/
Identificador OAI: oai:oa.upm.es:46650
URL Oficial: http://2016.qcrypt.net/
Depositado por: Memoria Investigacion
Depositado el: 21 Mar 2018 12:40
Ultima Modificación: 21 Mar 2018 12:40
  • GEO_UP4
  • Open Access
  • Open Access
  • Sherpa-Romeo
    Compruebe si la revista anglosajona en la que ha publicado un artículo permite también su publicación en abierto.
  • Dulcinea
    Compruebe si la revista española en la que ha publicado un artículo permite también su publicación en abierto.
  • Recolecta
  • InvestigaM
  • Observatorio I+D+i UPM
  • OpenCourseWare UPM