We provide the basic definitions regarding computational complexity theory and review some basic cryptographic protocols based on RSA or elliptic curves. These protocols summarize the history of last fifty years in cryptography and are actually ubiquitous in applications as, for example, SSL (secure socket layers), smartcards, creation of a bitcoin wallet, etc. Since it is known they are in the polynomial class for the Shor's algorithm, the possible development of quantum computers, needed to run such algorithm, will represent a dramatic shift in cryptography research and in applications.
A review about public cryptography protocols based on RSA or elliptic curves
Antonio CORBO ESPOSITO
;
2019-01-01
Abstract
We provide the basic definitions regarding computational complexity theory and review some basic cryptographic protocols based on RSA or elliptic curves. These protocols summarize the history of last fifty years in cryptography and are actually ubiquitous in applications as, for example, SSL (secure socket layers), smartcards, creation of a bitcoin wallet, etc. Since it is known they are in the polynomial class for the Shor's algorithm, the possible development of quantum computers, needed to run such algorithm, will represent a dramatic shift in cryptography research and in applications.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
