{"id":850,"date":"2025-10-07T11:30:00","date_gmt":"2025-10-07T09:30:00","guid":{"rendered":"https:\/\/tradelogik.de\/?p=850"},"modified":"2025-10-07T08:33:52","modified_gmt":"2025-10-07T06:33:52","slug":"quantencomputing-kryptographie","status":"publish","type":"post","link":"https:\/\/tradelogik.de\/en\/quantencomputing-kryptographie\/","title":{"rendered":"How Quantum Computing Is Changing Cryptography"},"content":{"rendered":"<h1 class=\"wp-block-heading has-text-align-center\">Quantencomputing Kryptographie<\/h1>\n\n\n\n<article class=\"quantumcryptography-deepresearch no-images wp-block-group has-border-color has-cyan-bluish-gray-border-color is-layout-constrained wp-container-core-group-is-layout-4d424610 wp-block-group-is-layout-constrained\" style=\"border-width:1px;border-radius:16px;padding-top:32px;padding-right:32px;padding-bottom:32px;padding-left:32px\">\n<h2 class=\"wp-block-heading\" id=\"quantencomputing-kryptographie\">How Quantum Computing Is Changing Cryptography<\/h2>\n\n\n\n<p class=\"\">Quantum computing is on the verge of reshaping the very foundations of digital security.\nWhile today\u2019s encryption systems rely on mathematical problems that are practically impossible for classical computers to solve, quantum algorithms threaten to upend those assumptions.\nAsymmetric algorithms such as RSA, Diffie-Hellman, and elliptic curve cryptography (ECC) may become obsolete once scalable quantum computers arrive.\n\nThis article explores the underlying mechanics of quantum computing, its impact on cryptography, and the emerging field of post-quantum cryptography (PQC), which aims to secure information against these new threats.<\/p>\n\n\n\n<div class=\"wp-block-group has-border-color has-cyan-bluish-gray-border-color is-layout-flow wp-container-core-group-is-layout-0ca90dcb wp-block-group-is-layout-flow\" style=\"border-width:1px;border-radius:12px;padding-top:16px;padding-right:16px;padding-bottom:16px;padding-left:16px\">\n<h3 class=\"wp-block-heading\">Table of contents<\/h3>\n\n\n\n<ul class=\"wp-block-list\">\n<li class=\"\"><a href=\"#grundlagen\">The Basics of Quantum Computing<\/a><\/li>\n\n\n\n<li class=\"\"><a href=\"#klassische-krypto\">2. Classical Cryptography and Its Mathematical Assumptions<\/a><\/li>\n\n\n\n<li class=\"\"><a href=\"#quantenangriffe\">3. Quantum Attacks: Shor and Grover<\/a><\/li>\n\n\n\n<li class=\"\"><a href=\"#betroffenheit\">4. Which Systems Are Affected?<\/a><\/li>\n\n\n\n<li class=\"\"><a href=\"#pqc\">5. Post-Quantum Cryptography (PQC)<\/a><\/li>\n\n\n\n<li class=\"\"><a href=\"#qkd\">6. Quantum Key Distribution (QKD) vs. PQC<\/a><\/li>\n\n\n\n<li class=\"\"><a href=\"#migration\">7. Migration &amp; Roadmap (X + Y &gt; Z)<\/a><\/li>\n\n\n\n<li class=\"\"><a href=\"#branchen\">8. Industry Impact and Risk Analysis<\/a><\/li>\n\n\n\n<li class=\"\"><a href=\"#faq\">9. FAQ<\/a><\/li>\n\n\n\n<li class=\"\"><a href=\"#abkuerzungen\">Anhang: Abk\u00fcrzungs-Legende<\/a><\/li>\n<\/ul>\n<\/div>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"grundlagen\">The Basics of Quantum Computing<\/h2>\n\n\n\n<p class=\"\">Quantum computers process information using qubits, which can exist in multiple states simultaneously \u2014 a property known as superposition.\nWhen qubits become entangled, the state of one instantly affects another, enabling powerful correlations that classical systems cannot replicate. This parallelism allows quantum algorithms to evaluate an enormous number of possibilities at once. However, quantum decoherence \u2014 the loss of this delicate state due to environmental noise \u2014 remains a major obstacle.\nPractical quantum computers require error correction and thousands of physical qubits to build a handful of reliable logical qubits. The race to achieve this is the defining challenge of modern quantum engineering.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"klassische-krypto\">2. Classical Cryptography and Its Mathematical Assumptions<\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li class=\"\"><strong>Asymmetric cryptography:<\/strong> RSA, Diffie-Hellman (DH), and ECC depend on the difficulty of factoring large integers or solving discrete logarithms.<\/li>\n\n\n\n<li class=\"\"><strong>Symmetric cryptography:<\/strong> AES encryption relies on key size and diffusion; brute force is the only known attack.<\/li>\n\n\n\n<li class=\"\"><strong>Hash functions:<\/strong> SHA-2 and SHA-3 ensure one-way transformations resistant to collisions and preimage attacks.<\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"quantenangriffe\">3. Quantum Attacks: Shor and Grover<\/h2>\n\n\n\n<p class=\"\">Two quantum algorithms fundamentally challenge cryptography:\n\nShor\u2019s Algorithm (1994): Efficiently factors large integers and computes discrete logarithms in polynomial time \u2014 breaking RSA, DH, and ECC once sufficient qubits exist.\n\nGrover\u2019s Algorithm (1996): Speeds up brute-force search from O(N) to O(\u221aN). This effectively halves the key strength of symmetric systems. For example, AES-256 under Grover\u2019s algorithm offers about 128-bit effective security.\n\nIn short, a quantum computer large enough to run Shor\u2019s algorithm would render much of today\u2019s digital infrastructure insecure. <code>O(N)<\/code> auf <code>O(\u221aN)<\/code>. In der Praxis bedeutet das: die <em>effektive<\/em> Sicherheit symmetrischer Verfahren halbiert sich (z.\u00a0B. AES-256 \u2248 128-Bit Niveau unter idealisierten Angreifermodellen).<\/p>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"betroffenheit\">4. Which Systems Are Affected?<\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li class=\"\"><strong>Highly vulnerable:<\/strong> RSA, DH, ECC \u2014 any system relying on integer factorization or discrete logs.<\/li>\n\n\n\n<li class=\"\"><strong>Moderately impacted:<\/strong> Symmetrische Krypto (z.&nbsp;B. AES) und Hashes (SHA-2\/SHA-3) \u2013 Parameter hochsetzen, z.&nbsp;B. AES-256, l\u00e4ngere Hash-Outputs f\u00fcr Preimage-Resistenz.<\/li>\n\n\n\n<li class=\"\"><strong>\u201cHarvest Now, Decrypt Later\u201d:<\/strong> Angreifer speichern heute verschl\u00fcsselte Daten, um sie mit k\u00fcnftigen Quantenrechnern zu entschl\u00fcsseln. Relevant \u00fcberall, wo <em>Adversaries may store encrypted data today, awaiting future quantum decryption. Any data needing confidentiality beyond 2030 should already transition to quantum-safe protection.<\/em> ist.<\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"pqc\">5. Post-Quantum Cryptography (PQC)<\/h2>\n\n\n\n<p class=\"\">PQC aims to design encryption algorithms resistant to both classical and quantum attacks.\nInstead of relying on factorization, PQC uses problems like lattice structures, error correction codes, and hash-based systems that are believed to be hard even for quantum computers.\n\nLeading PQC Families\n\nLattice-based: CRYSTALS-Kyber (key exchange) and CRYSTALS-Dilithium (digital signatures) \u2013 both selected by NIST as upcoming standards.\n\nCode-based: Classic McEliece \u2013 very large public keys but extremely robust.\n\nHash-based: XMSS and LMS \u2013 used for digital signatures, some with stateful management.\n\nMultivariate-based: UOV and Rainbow \u2013 under review due to key-size and security trade-offs.\n\nImplementation Concerns\n\nIntegration into TLS, VPNs, and IoT systems requires optimization for bandwidth, latency, and memory.\nHybrid schemes \u2014 combining classical and PQC algorithms \u2014 are recommended to maintain backward compatibility and layered security.<\/p>\n\n\n\n<p class=\"\">Implementierungsaspekte: Schl\u00fcssel- und Ciphertext-Gr\u00f6\u00dfen, Laufzeiten, Side-Channel-Resilienz, Parameterwahl (Sicherheitsstufen), Bibliotheken (z.\u00a0B. PQClean, liboqs) sowie Integration in Protokolle (TLS, IPsec, SSH, QUIC). F\u00fcr die \u00dcbergangszeit empfehlen sich Hybrid-Suiten (klassisch\u00a0+\u00a0PQC), um Kompatibilit\u00e4t und Verteidigungs-in-Tiefe zu gew\u00e4hrleisten.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"qkd\">6. Quantum Key Distribution (QKD) vs. PQC<\/h2>\n\n\n\n<p class=\"\">Quantum Key Distribution (QKD), such as the BB84 protocol, leverages quantum physics to securely share encryption keys.\nAny eavesdropping attempt changes the quantum state, alerting the communicating parties.\n\nHowever, QKD has practical limitations: high cost, limited range, specialized hardware, and incompatibility with large-scale internet infrastructure.\nTherefore, while QKD may secure government or research networks, PQC remains the pragmatic global solution for quantum-resistant encryption.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"migration\">7. Migration and the Mosca Equation (X + Y &gt; Z)<\/h2>\n\n\n\n<p class=\"\">Dr. Michele Mosca\u2019s equation describes the urgency of quantum readiness:\nX = data confidentiality lifetime, Y = migration duration, Z = years until powerful quantum attacks.\nIf X + Y &gt; Z, you are already too late. <code>X + Y > Z<\/code>, besteht akuter Handlungsbedarf. In vielen Sektoren (z.\u00a0B. Beh\u00f6rde, Finanz, Gesundheit, Energie) trifft das bereits heute zu.<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li class=\"\"><strong>Inventory &amp; Assessment<\/strong> Identify cryptographic assets, algorithms, and data retention timelines.<\/li>\n\n\n\n<li class=\"\"><strong>Pilot &amp; Hybrid Phase<\/strong> Implement hybrid PQC in TLS\/VPN\/SSH, evaluate performance and interoperability.<\/li>\n\n\n\n<li class=\"\"><strong>Full Rollout<\/strong> Update libraries, HSMs, firmware, and certification paths to PQC standards.<\/li>\n\n\n\n<li class=\"\"><strong>Ongoing Monitoring<\/strong> Track NIST\/BSI guidelines, patch libraries, monitor performance and incidents.<\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"branchen\">8. Industry Impact and Risk Analysis<\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li class=\"\"><strong>Government &amp; Defense:<\/strong> Long-term classified data \u2192 immediate PQC planning and hybrid deployments<\/li>\n\n\n\n<li class=\"\"><strong>Finance &amp; Blockchain:<\/strong> Digital signatures and cold-wallet keys \u2192 re-issuance of addresses and hybrid PQC for transaction security.<\/li>\n\n\n\n<li class=\"\"><strong>Healthcare &amp; Research:<\/strong> Sensitive medical records with long retention \u2192 prioritize early migration.<\/li>\n\n\n\n<li class=\"\"><strong>Telecom &amp; IoT:<\/strong> Device lifecycle and update constraints require lightweight PQC and efficient key management.<\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"faq\">9. Frequently Asked Questions (FAQ)<\/h2>\n\n\n\n<h4 class=\"wp-block-heading\">When will quantum computers break RSA and ECC?<\/h4>\n\n\n\n<p class=\"\">Estimates range between 2030\u20132035, depending on advances in qubit error correction and scalability.\nBut due to \u201charvest now, decrypt later,\u201d organizations must act before that threshold.<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">Is AES-256 safe against quantum attacks?<\/h4>\n\n\n\n<p class=\"\">Ja, gegen ideale Grover-Angreifer gilt AES-256 als ad\u00e4quat (effektiv ~128-Bit). Achte auf robuste Implementierung (z.&nbsp;B. konstante Zeit, Side-Channel-Schutz).<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">Will QKD replace PQC?<\/h4>\n\n\n\n<p class=\"\">No. QKD is specialized, hardware-based, and expensive. PQC is software-based, scalable, and suitable for general internet use.<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">How should organizations prepare?<\/h4>\n\n\n\n<p class=\"\">Create a cryptographic inventory, identify long-term sensitive data, test hybrid PQC suites, and update vendor contracts for PQC support.<\/p>\n\n\n\n<hr class=\"is-style-wide wp-block-separator has-css-opacity\"\/>\n\n\n\n<h3 class=\"wp-block-heading\" id=\"abkuerzungen\">Abk\u00fcrzungs-Legende<\/h3>\n\n\n\n<ul class=\"acronym-legend wp-block-list\">\n<li class=\"\"><strong>Quantum bit capable of superposition and entanglement<\/strong> \u2013 Quanteneinheit mit Superposition\/Verschr\u00e4nkung.<\/li>\n\n\n\n<li class=\"\"><strong>Rivest-Shamir-Adleman, classic asymmetric algorithm<\/strong> \u2013 Rivest-Shamir-Adleman (Faktorisierung).<\/li>\n\n\n\n<li class=\"\"><strong>Diffie-Hellman key exchange<\/strong> \u2013 Diffie-Hellman (Schl\u00fcsselaustausch, diskreter Logarithmus).<\/li>\n\n\n\n<li class=\"\"><strong>Elliptic Curve Cryptography<\/strong> \u2013 Elliptic Curve Cryptography (diskreter Logarithmus auf Kurven).<\/li>\n\n\n\n<li class=\"\"><strong>Advanced Encryption Standard<\/strong> \u2013 Advanced Encryption Standard (symmetrisch).<\/li>\n\n\n\n<li class=\"\"><strong>SHA-2\/SHA-3<\/strong> Secure Hash Algorithms<\/li>\n\n\n\n<li class=\"\"><strong>Post-Quantum Cryptography<\/strong> \u2013 Post-Quantum-Kryptographie (quantenresistent).<\/li>\n\n\n\n<li class=\"\"><strong>Quantum Key Distribution<\/strong> \u2013 Quantum Key Distribution (quantenphysikalischer Schl\u00fcsseltausch).<\/li>\n\n\n\n<li class=\"\"><strong>LWE\/RLWE<\/strong> (Ring) Learning With Errors \u2013 lattice-based foundations<\/li>\n\n\n\n<li class=\"\"><strong>Kyber\/Dilithium<\/strong> NIST-selected PQC algorithms<\/li>\n\n\n\n<li class=\"\"><strong>Classic McEliece<\/strong> Code-based encryption algorithm<\/li>\n\n\n\n<li class=\"\"><strong>XMSS\/LMS<\/strong> Hash-based digital signature schemes<\/li>\n\n\n\n<li class=\"\"><strong>The day quantum computers can practically break current crypto<\/strong> \u2013 Zeitpunkt praktischer Quantenangriffe auf heutige Krypto.<\/li>\n<\/ul>\n\n\n\n<p class=\"has-small-font-size\"><em>Hinweis: Inhaltlich ausgerichtet an g\u00e4ngigen Empfehlungen (z.&nbsp;B. NIST-PQC-Programm, BSI-Leitf\u00e4den). <\/em><\/p>\n\n\n\n<hr class=\"is-style-wide wp-block-separator has-css-opacity\"\/>\n\n\n\n<h3 class=\"wp-block-heading\">\ud83d\udd17 Quellen &amp; weiterf\u00fchrende Literatur<\/h3>\n\n\n\n<ul class=\"source-list wp-block-list\">\n<li class=\"\"><a href=\"https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\" target=\"_blank\" rel=\"noopener nofollow\">NIST Post-Quantum Cryptography Project<\/a> \u2013 Offizielles Standardisierungsprojekt f\u00fcr quantenresistente Kryptographie (USA).<\/li>\n\n\n\n<li class=\"\"><a href=\"https:\/\/www.bsi.bund.de\/DE\/Themen\/Unternehmen-und-Organisationen\/Standards-und-Zertifizierung\/Post-Quanten-Kryptografie\/post-quanten-kryptografie_node.html\" target=\"_blank\" rel=\"noopener nofollow\">BSI \u2013 Post-Quanten-Kryptographie (BSI.de)<\/a> \u2013 Empfehlungen und Sicherheitsniveaus f\u00fcr Deutschland.<\/li>\n\n\n\n<li class=\"\"><a href=\"https:\/\/arxiv.org\/abs\/1902.02200\" target=\"_blank\" rel=\"noopener nofollow\">Bernstein, D.J. et al. (2019): \u201ePost-Quantum Cryptography\u201c (arXiv)<\/a> \u2013 Technische Einf\u00fchrung in PQC-Verfahren und mathematische Grundlagen.<\/li>\n\n\n\n<li class=\"\"><a href=\"https:\/\/www.nature.com\/articles\/d41586-019-02935-4\" target=\"_blank\" rel=\"noopener nofollow\">Nature (2019): \u201eQuantum computing has arrived, but it\u2019s not ready for prime time\u201c<\/a> \u2013 \u00dcberblick \u00fcber Fortschritte und Grenzen realer Quantenhardware.<\/li>\n\n\n\n<li class=\"\"><a href=\"https:\/\/www.scientificamerican.com\/article\/the-quantum-threat-to-encryption\/\" target=\"_blank\" rel=\"noopener nofollow\">Scientific American (2021): \u201eThe Quantum Threat to Encryption\u201c<\/a> \u2013 Popul\u00e4rwissenschaftlicher \u00dcberblick zur Bedrohungslage f\u00fcr Kryptographie.<\/li>\n\n\n\n<li class=\"\"><a href=\"https:\/\/www.ibm.com\/quantum\/blog\/quantum-safe-cryptography\" target=\"_blank\" rel=\"noopener nofollow\">IBM Quantum (2023): \u201eQuantum-Safe Cryptography and Your Data\u201c<\/a> \u2013 Praxisleitfaden zur Einf\u00fchrung quantensicherer Systeme.<\/li>\n\n\n\n<li class=\"\"><a href=\"https:\/\/www.iso.org\/standard\/83456.html\" target=\"_blank\" rel=\"noopener nofollow\">ISO\/IEC 14888-3:2023<\/a> \u2013 Internationale Norm f\u00fcr digitale Signaturmechanismen, inkl. PQC-Kompatibilit\u00e4t.<\/li>\n\n\n\n<li class=\"\"><a href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3372297.3417889\" target=\"_blank\" rel=\"noopener nofollow\">Mosca, M. (2020): \u201eCybersecurity in an era with quantum computers\u201c (ACM Journal)<\/a> \u2013 Darstellung des X+Y&gt;Z-Migrationsmodells.<\/li>\n\n\n\n<li class=\"\"><a href=\"https:\/\/crypto.stackexchange.com\/questions\/quantum-safe-algorithms\" target=\"_blank\" rel=\"noopener nofollow\">Crypto.StackExchange (2024): \u201eQuantum-safe Algorithms Overview\u201c<\/a> \u2013 Diskussionsplattform mit technischen Referenzen zu PQC-Verfahren.<\/li>\n\n\n\n<li class=\"\"><a href=\"https:\/\/quantumai.google\" target=\"_blank\" rel=\"noopener nofollow\">Google Quantum AI<\/a> \u2013 Aktuelle Forschungsinitiativen zu skalierbaren Qubits und Fehlerinfrastruktur.<\/li>\n\n\n\n<li class=\"\"><a href=\"https:\/\/www.llnl.gov\/news\/post-quantum-cryptography-research-accelerates\" target=\"_blank\" rel=\"noopener nofollow\">Lawrence Livermore National Laboratory (LLNL): \u201ePost-Quantum Cryptography Research Accelerates\u201c<\/a> \u2013 \u00dcberblick \u00fcber angewandte Forschung in den USA.<\/li>\n\n\n\n<li class=\"\"><a href=\"https:\/\/www.research.ibm.com\/blog\/post-quantum-cryptography-nist-standardization\" target=\"_blank\" rel=\"noopener nofollow\">IBM Research (2022): \u201eKyber and Dilithium selected by NIST\u201c<\/a> \u2013 Bericht zur Auswahl der NIST-PQC-Standards.<\/li>\n\n\n\n<li class=\"\"><a href=\"https:\/\/www.spglobal.com\/marketintelligence\/en\/news-insights\/latest-news-headlines\/the-road-to-quantum-safe-cryptography-74581264\" target=\"_blank\" rel=\"noopener nofollow\">S&amp;P Global (2024): \u201eThe Road to Quantum-Safe Cryptography\u201c<\/a> \u2013 Wirtschaftliche Perspektive auf PQC-Umstellung.<\/li>\n\n\n\n<li class=\"\"><a href=\"https:\/\/www.enisa.europa.eu\/publications\/post-quantum-cryptography\" target=\"_blank\" rel=\"noopener nofollow\">ENISA Report (2024): Post-Quantum Cryptography \u2013 Current State and Challenges<\/a> \u2013 EU-Perspektive auf Standardisierung und Implementierungsstrategien.<\/li>\n<\/ul>\n\n\n\n<p class=\"has-small-font-size\"><em>Zusammengestellt und \u00fcberpr\u00fcft am 7. Oktober 2025. Quellen: NIST, BSI, arXiv, Nature, IBM, ENISA, ACM, ISO.<\/em><\/p>\n\n\n\n<p class=\"\"><a href=\"https:\/\/tradelogik.de\/en\/category\/deep-research\/\" data-type=\"category\" data-id=\"42\">Deep-Research<\/a><\/p>\n\n\n\n<script type=\"application\/ld+json\">\n  {\n    \"@context\":\"https:\/\/schema.org\",\n    \"@type\":\"TechArticle\",\n    \"headline\":\"Wie Quantencomputing die Kryptographie ver\u00e4ndert \u2013 Risiken, L\u00f6sungen & Post-Quantum-Sicherheit 2025\",\n    \"description\":\"Fundierte Analyse zu Quantenangriffen (Shor, Grover), Betroffenheit klassischer Verfahren, Post-Quantum-Kryptographie (Kyber, Dilithium) und Migrationsstrategien (X+Y>Z).\",\n    \"inLanguage\":\"de\",\n    \"author\":{\"@type\":\"Organization\",\"name\":\"Tradelogik Research\"},\n    \"publisher\":{\"@type\":\"Organization\",\"name\":\"Tradelogik.de\"},\n    \"datePublished\":\"2025-10-07\",\n    \"dateModified\":\"2025-10-07\",\n    \"mainEntityOfPage\":{\"@type\":\"WebPage\",\"@id\":\"https:\/\/example.com\/quantencomputing-kryptographie\"}\n  }\n  <\/script>\n<\/article>","protected":false},"excerpt":{"rendered":"<p>Quantencomputing Kryptographie Wie Quantencomputing die Kryptographie ver\u00e4ndert Quantencomputing stellt Grundannahmen der heutigen Kryptographie infrage. Asymmetrische Verfahren wie RSA, Diffie-Hellman und ECC k\u00f6nnten durch Quantenalgorithmen gebrochen werden; symmetrische Verfahren und Hashes verlieren effektive Sicherheit. Dieser Beitrag liefert einen fundierten \u00dcberblick, ordnet Risiken ein und beschreibt praktikable Migrationspfade in die Post-Quantum-\u00c4ra. Inhaltsverzeichnis 1. Grundlagen des Quantencomputings Qubits [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":858,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"nf_dc_page":"","_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"categories":[42,20],"tags":[],"class_list":["post-850","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-deep-research","category-research"],"blocksy_meta":{"has_hero_section":"disabled","styles_descriptor":{"styles":{"desktop":"","tablet":"","mobile":""},"google_fonts":[],"version":6}},"_links":{"self":[{"href":"https:\/\/tradelogik.de\/en\/wp-json\/wp\/v2\/posts\/850","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/tradelogik.de\/en\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/tradelogik.de\/en\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/tradelogik.de\/en\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/tradelogik.de\/en\/wp-json\/wp\/v2\/comments?post=850"}],"version-history":[{"count":7,"href":"https:\/\/tradelogik.de\/en\/wp-json\/wp\/v2\/posts\/850\/revisions"}],"predecessor-version":[{"id":861,"href":"https:\/\/tradelogik.de\/en\/wp-json\/wp\/v2\/posts\/850\/revisions\/861"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/tradelogik.de\/en\/wp-json\/wp\/v2\/media\/858"}],"wp:attachment":[{"href":"https:\/\/tradelogik.de\/en\/wp-json\/wp\/v2\/media?parent=850"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/tradelogik.de\/en\/wp-json\/wp\/v2\/categories?post=850"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/tradelogik.de\/en\/wp-json\/wp\/v2\/tags?post=850"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}