A Comparison of Security and its Performance for Key Agreements in Post-Quantum Cryptography

A Comparison of Security and its Performance for Key Agreements in Post-Quantum Cryptography

Nowadays, we are surrounded by devices collecting and transmitting private information. Currently, the two main mathematical problems that guarantee security on the Internet are the Integer Factorization Problem and the Discrete Logarithm Problem. However, Shor's quantum algorithm can easily so...

Full description

Bibliographic Details
Main Authors: Fabio Borges, Paulo Ricardo Reis, Diogo Pereira
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Post-quantum cryptography
asymmetric cryptography
key agreement
complexity
algorithms
asymptotic analysis
Online Access:https://ieeexplore.ieee.org/document/9153901/

Internet

https://ieeexplore.ieee.org/document/9153901/

Similar Items