Vai al contenuto principale della pagina

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



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Autore: Takagi Tsuyoshi Visualizza persona
Titolo: 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 Visualizza cluster
Pubblicazione: Springer Nature, 2021
Singapore : , : Springer Singapore : , : Imprint : Springer, , 2021
Edizione: 1st ed. 2021.
Descrizione fisica: 1 online resource (XII, 274 p. 83 illus., 24 illus. in color.)
Disciplina: 519
Soggetto topico: Applied mathematics
Engineering mathematics
Data structures (Computer science)
Quantum computers
Computer security
Mathematical and Computational Engineering
Data Structures and Information Theory
Quantum Computing
Systems and Data Security
Soggetto non controllato: Mathematical and Computational Engineering
Data Structures and Information Theory
Quantum Computing
Systems and Data Security
Mathematical and Computational Engineering Applications
Data and Information Security
Cryptography for Quantum Computers
Post-quantum Cryptography
Number Theory
Representation Theory
Quantum Physics
Security Modelling
Open Access
Maths for engineers
Algorithms & data structures
Information theory
Mathematical theory of computation
Computer security
Network security
Persona (resp. second.): TakagiTsuyoshi
WakayamaMasato
TanakaKeisuke
KunihiroNoboru
KimotoKazufumi
IkematsuYasuhiko
Nota di contenuto: 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.
Sommario/riassunto: 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.
Titolo autorizzato: International Symposium on Mathematics, Quantum Theory, and Cryptography  Visualizza cluster
ISBN: 981-15-5191-X
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 996466557703316
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Serie: Mathematics for Industry, . 2198-350X ; ; 33