Downloads provided by UsageCounts
handle: 2445/113282
From Shor's algorithm follows an algorithm that would allow us, in a proper quantum computer, to factorize integers e ectively. This could break the RSA encryption algorithm. This paper tries to study this algorithm as well as some further variations that improve Shor's algorithm in certain conditions or are able to attack other cryptographic systems.
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2017, Director: Artur Travesa i Grau
Bachelor's thesis, Ordinadors quàntics, Bachelor's theses, Quantum computers, Algorismes computacionals, Treballs de fi de grau, Xifratge (Informàtica), Computer algorithms, Data encryption (Computer science)
Bachelor's thesis, Ordinadors quàntics, Bachelor's theses, Quantum computers, Algorismes computacionals, Treballs de fi de grau, Xifratge (Informàtica), Computer algorithms, Data encryption (Computer science)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 81 | |
| downloads | 59 |

Views provided by UsageCounts
Downloads provided by UsageCounts