{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T06:40:33Z","timestamp":1743403233216,"version":"3.40.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Datenschutz Datensich"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s11623-025-2062-y","type":"journal-article","created":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T06:20:21Z","timestamp":1743402021000},"page":"159-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Herausforderungen der Post-Quanten-Kryptographie"],"prefix":"10.1007","volume":"49","author":[{"given":"Carmen","family":"Kempka","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,28]]},"reference":[{"key":"2062_CR1","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1038\/299802a0","volume":"299","author":"W Wootters","year":"1982","unstructured":"Wootters, W., Zurek, W.: A single quantum cannot be cloned. Nature 299, 802\u2013803 (1982). https:\/\/doi.org\/10.1038\/299802a0","journal-title":"Nature"},{"issue":"6","key":"2062_CR2","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0375-9601(82)90084-6","volume":"92","author":"D Dieks","year":"1982","unstructured":"D. Dieks: Communication by EPR devices, Physics Letters A, Volume\u00a092, Issue 6, 1982, Pages 271-272, ISSN 0375-9601, https:\/\/doi.org\/10.1016\/0375-9601(82)90084-6.","journal-title":"Physics Letters A"},{"key":"2062_CR3","unstructured":"https:\/\/www.heise.de\/news\/Google-stellt-neuen-Quantenprozessor-Willow-vor-10192828.html Aufgerufen am 18. Feb 2025"},{"key":"2062_CR4","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1038\/s41586-024-08404-x","volume":"638","author":"D Main","year":"2025","unstructured":"Main, D., Drmota, P., Nadlinger, D.P. et al.: Distributed quantum computing across an optical network link. Nature 638, 383\u2013388 (2025). https:\/\/doi.org\/10.1038\/s41586-024-08404-x","journal-title":"Nature"},{"key":"2062_CR5","unstructured":"https:\/\/newsroom.ibm.com\/2023-12-04-IBM-Debuts-Next-Generation-Quantum-Processor-IBM-Quantum-System-Two,-Extends-Roadmap-to-Advance-Era-of-Quantum-Utility Aufgerufen am 18. Feb 2025"},{"key":"2062_CR6","unstructured":"https:\/\/www.eenewseurope.com\/en\/rigetti-launches-84qubit-single-chip-quantum-processor\/ Aufgerufen am 18. Feb 2025"},{"key":"2062_CR7","unstructured":"Global Risk Institute: 2024 Quantum Threat Timeline Report, 2024, https:\/\/globalriskinstitute.org\/publication\/2024-quantum-threat-timeline-report\/ Aufgerufen am 18. Feb 2025"},{"key":"2062_CR8","first-page":"555","volume":"2024","author":"Y Chen","year":"2024","unstructured":"Chen, Y: Quantum Algorithms for Lattice Problems. IACR Cryptol. ePrint Arch. 2024: 555 (2024): https:\/\/ia.cr\/2024\/555","journal-title":"IACR Cryptol. ePrint Arch"},{"key":"2062_CR9","unstructured":"https:\/\/www.iso.org\/standard\/37971.html Aufgerufen am 18. Feb 2025"},{"key":"2062_CR10","unstructured":"https:\/\/www.openpgp.org\/ Aufgerufen am 18. Feb 2025"},{"key":"2062_CR11","unstructured":"Mosca, M.: Cybersecurity in a Quantum World: will we be ready? 2015. https:\/\/csrc.nist.gov\/csrc\/media\/events\/workshop-on-cybersecurity-in-a-post-quantum-world\/documents\/presentations\/session8-mosca-michele.pdf Aufgerufen am 18. Feb 2025"},{"key":"2062_CR12","unstructured":"Bundesamt f\u00fcr Sicherheit in der Informationstechnik (BSI): Migration zu Post-Quanten-Kryptographie. 2020. https:\/\/www.bsi.bund.de\/SharedDocs\/Downloads\/DE\/BSI\/Krypto\/Post-Quanten-Kryptografie.pdf Aufgerufen am 18. Feb 2025"},{"key":"2062_CR13","unstructured":"Bundesamt f\u00fcr Sicherheit in der Informationstechnik (BSI): Studie: Entwicklungsstand Quantencomputer Version 2.1, 2025, https:\/\/www.bsi.bund.de\/SharedDocs\/Downloads\/DE\/BSI\/Publikationen\/Studien\/Quantencomputer\/Entwicklungstand_QC_V_2_1.pdf Aufgerufen am 18. Feb 2025"},{"key":"2062_CR14","doi-asserted-by":"crossref","unstructured":"Lov K. Grover: A fast quantum mechanical algorithm for database search. 28th Annual ACM Symposium on the Theory of Computing (STOC), pages 212\u2013219, 1996.","DOI":"10.1145\/237814.237866"},{"issue":"5","key":"2062_CR15","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Peter W. Shor: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5):1484\u20131509, Oct 1997","journal-title":"SIAM Journal on Computing"},{"key":"2062_CR16","unstructured":"Euklid: Elements, ca. 300 v.Chr."},{"key":"2062_CR17","unstructured":"https:\/\/media.defense.gov\/2022\/Sep\/07\/2003071836\/-1\/-1\/0\/CSI_CNSA_2.0_FAQ_.PDF Aufgerufen am 19. Feb 2025"}],"container-title":["Datenschutz und Datensicherheit - DuD"],"original-title":[],"language":"de","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11623-025-2062-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11623-025-2062-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11623-025-2062-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T06:20:39Z","timestamp":1743402039000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11623-025-2062-y"}},"subtitle":["Wie bereite ich mein Unternehmen vor?"],"short-title":[],"issued":{"date-parts":[[2025,3]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["2062"],"URL":"https:\/\/doi.org\/10.1007\/s11623-025-2062-y","relation":{},"ISSN":["1614-0702","1862-2607"],"issn-type":[{"value":"1614-0702","type":"print"},{"value":"1862-2607","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3]]},"assertion":[{"value":"28 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}