Buch, Englisch, 274 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 441 g
Reihe: Mathematics for Industry
Proceedings of MQC 2019
Buch, Englisch, 274 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 441 g
Reihe: Mathematics for Industry
ISBN: 978-981-15-5193-2
Verlag: Springer
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.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Technische Informatik Computersicherheit
- Mathematik | Informatik EDV | Informatik Daten / Datenbanken
- Technische Wissenschaften Technik Allgemein Mathematik für Ingenieure
- Mathematik | Informatik EDV | Informatik Technische Informatik Quantencomputer, DNA-Computing
Weitere Infos & Material
Part I : Mathematics1. Representation Theory2. Quantum Rabi Model3. Dirichlet L-functions4. Ramanujan Graphs5. Linear Programming6. Random Number Generation7. Lattice Theory8. Multivariate Polynomial Theory
Part II : Cryptography9. Post-Quantum Cryptography10. Code-based Cryptography11. Multivariate Polynomial Cryptography12. Lattice-based Cryptography13. Isogeny-based Cryptography14. Hash-based Cryptography15. ID-based Encryptions16. Leakage-resilient Cryptography




