Der Artikel wird am Ende des Bestellprozesses zum Download zur Verfügung gestellt.

International Symposium on Mathematics, Quantum Theory, and Cryptography

Proceedings of MQC 2019
 eBook
Sofort lieferbar | Lieferzeit: Sofort lieferbar I
ISBN-13:
9789811551918
Veröffentl:
2020
Einband:
eBook
Seiten:
274
Autor:
Tsuyoshi Takagi
Serie:
33, Mathematics for Industry
eBook Typ:
PDF
eBook Format:
Reflowable eBook
Kopierschutz:
Digital Watermark [Social-DRM]
Sprache:
Englisch
Beschreibung:

This open access book presents selected papers from International Symposium on Mathematics, Quantum Theory, and Cryptography (MQC), which was held on September 25-27, 2019 in Fukuoka, Japan. The international symposium MQC addresses the mathematics and quantum theory underlying secure modeling of the post quantum cryptography including e.g. mathematical study of the light-matter interaction models as well as quantum computing.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 standardizepost-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.
This open access book presents selected papers from International Symposium on Mathematics, Quantum Theory, and Cryptography (MQC), which was held on September 25-27, 2019 in Fukuoka, Japan. The international symposium MQC addresses the mathematics and quantum theory underlying secure modeling of the post quantum cryptography including e.g. mathematical study of the light-matter interaction models as well as quantum computing.

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.
Part I : Mathematics
1. Representation Theory
2. Quantum Rabi Model
3. Dirichlet L-functions
4. Ramanujan Graphs
5. Linear Programming
6. Random Number Generation
7. Lattice Theory
8. Multivariate Polynomial Theory

Part II : Cryptography
9. Post-Quantum Cryptography
10. Code-based Cryptography
11. Multivariate Polynomial Cryptography
12. Lattice-based Cryptography
13. Isogeny-based Cryptography
14. Hash-based Cryptography
15. ID-based Encryptions
16. Leakage-resilient Cryptography

Kunden Rezensionen

Zu diesem Artikel ist noch keine Rezension vorhanden.
Helfen sie anderen Besuchern und verfassen Sie selbst eine Rezension.