International Symposium on Mathematics, Quantum Theory, and Cryptography
Proceedings of MQC 2019
Always available
Always available
The security of the most widely used RSA cryptosystem is based on the difficulty of factoring large integers. However, in 1994 Shor proposed a quantum polynomial time algorithm for factoring integers, and the RSA cryptosystem is no longer secure in the quantum computing model. This vulnerability has prompted research into post-quantum cryptography using alternative mathematical problems that are secure in the era of quantum computers. In this regard, the National Institute of Standards and Technology (NIST) began to standardize post-quantum cryptography in 2016.
This book is suitable for postgraduate students in mathematics and computer science, as well as for experts in industry working on post-quantum cryptography.
-
Creators
-
Series
-
Publisher
-
Release date
October 22, 2020 -
Formats
-
OverDrive Read
- ISBN: 9789811551918
-
Open EPUB ebook
- ISBN: 9789811551918
- File size: 26654 KB
-
-
Languages
- English
Formats
- OverDrive Read
- Open EPUB ebook
Languages
- English
Loading
Why is availability limited?
×Availability can change throughout the month based on the library's budget. You can still place a hold on the title, and your hold will be automatically filled as soon as the title is available again.
The Kindle Book format for this title is not supported on:
×Read-along ebook
×The OverDrive Read format of this ebook has professional narration that plays while you read in your browser. Learn more here.