gogo
Amazon cover image
Image from Amazon.com

International Symposium on Mathematics, Quantum Theory, and Cryptography [electronic resource] : Proceedings of MQC 2019 / edited by Tsuyoshi Takagi, Masato Wakayama, Keisuke Tanaka, Noboru Kunihiro, Kazufumi Kimoto, Yasuhiko Ikematsu.

Contributor(s): Material type: TextTextSeries: Mathematics for Industry ; 33Publisher: Singapore : Springer Singapore : Imprint: Springer, 2021Edition: 1st ed. 2021Description: XII, 274 p. 83 illus., 24 illus. in color. online resourceContent type:
Media type:
Carrier type:
ISBN:
  • 9789811551918
Subject(s): Additional physical formats: Printed edition:: No title; Printed edition:: No title; Printed edition:: No titleDDC classification:
  • 519 23
Online resources:
Contents:
Sustainable Cryptography -- What Kind of Insight Provide Analytical Solutions of Quantum Models? -- Emerging Ultrastrong Coupling between Light and Matter Observed in Circuit Quantum Electrodynamics -- Quantum Random Numbers Generated by a Cloud Superconducting Quantum Computer -- Quantum Factoring Algorithm: Resource Estimation and Survey of Experiments -- A Review of Secret Key Distribution Based on Bounded Observability -- Towards Constructing Fully Homomorphic Encryption without Ciphertext Noise from Group Theory -- Number Theoretic Study in Quantum Interactions -- From the Bloch Sphere to Phase Space Representations with the Gottesman-Kitaev-Preskill Encoding -- A Data Concealing Technique with Random Noise Disturbance and A Restoring Technique for the Concealed Data by Stochastic Process Estimation.
In: Springer Nature eBookSummary: 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.
No physical items for this record

IT Carlow ebook

Sustainable Cryptography -- What Kind of Insight Provide Analytical Solutions of Quantum Models? -- Emerging Ultrastrong Coupling between Light and Matter Observed in Circuit Quantum Electrodynamics -- Quantum Random Numbers Generated by a Cloud Superconducting Quantum Computer -- Quantum Factoring Algorithm: Resource Estimation and Survey of Experiments -- A Review of Secret Key Distribution Based on Bounded Observability -- Towards Constructing Fully Homomorphic Encryption without Ciphertext Noise from Group Theory -- Number Theoretic Study in Quantum Interactions -- From the Bloch Sphere to Phase Space Representations with the Gottesman-Kitaev-Preskill Encoding -- A Data Concealing Technique with Random Noise Disturbance and A Restoring Technique for the Concealed Data by Stochastic Process Estimation.

Open Access

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.

Powered by Koha