15. Post-Quantum Cryptography and Future Secure Networks

Introduction and Context

Modern network security depends heavily on public-key cryptography. RSA, Diffie–Hellman key exchange, elliptic-curve cryptography (ECC), digital signatures, certificates, secure software updates, virtual private networks, and authenticated web sessions all rely on mathematical problems believed to be difficult for conventional computers. The security of RSA depends primarily on the difficulty of integer factorisation, while Diffie–Hellman and ECC depend on discrete-logarithm problems.

The emergence of large-scale quantum computing creates a strategic challenge because Shor’s algorithm can solve integer factorisation and discrete logarithms in polynomial time on a sufficiently capable fault-tolerant quantum computer. Symmetric cryptography is affected differently: Grover’s algorithm provides a quadratic speed-up for exhaustive search, reducing the effective security of an n-bit key approximately to n/2 bits. Consequently, quantum computing does not make all cryptography obsolete, but it requires a planned transition in public-key systems and careful strengthening of symmetric systems.

The risk is not confined to the date on which a cryptographically relevant quantum computer becomes available. Adversaries may already collect encrypted traffic and store it for later decryption, an approach commonly called “harvest now, decrypt later.” Long-lived information—government records, health data, intellectual property, identity credentials, and strategic communications—may therefore be vulnerable today. Post-quantum cryptography (PQC) addresses this problem by developing algorithms intended to resist both classical and quantum attacks while remaining executable on conventional computers.

This chapter examines quantum threats, post-quantum algorithms, migration and crypto-agility, confidential computing, privacy-enhancing technologies, blockchain, 5G/6G, the Internet of Things (IoT), and autonomous network defence. The central argument is that future secure networks will not be protected by a single algorithm. They will require coordinated cryptographic engineering, inventory management, hardware protection, privacy governance, resilient architectures, and continuous monitoring.

Learning Objectives

After studying this chapter, students should be able to:

1. Explain how quantum algorithms affect public-key and symmetric cryptography.

2. Compare the principal families of post-quantum algorithms and their trade-offs.

3. Design a crypto-agility and migration strategy for an organisation.

4. Assess the roles of confidential computing and privacy-enhancing technologies.

5. Analyse PQC implications for blockchain, 5G/6G, IoT, and autonomous defence.

6. Identify technical, organisational, regulatory, and ethical risks in post-quantum transitions.

The Quantum Threat Model

A quantum computer is not simply a faster conventional computer. It uses quantum states, superposition, interference, and entanglement to process certain mathematical structures in ways unavailable to classical machines. Quantum algorithms are powerful only for particular problem classes; they do not provide a universal acceleration for every computation.

Shor’s algorithm is the most important threat to contemporary public-key cryptography. It can factor large integers and compute discrete logarithms efficiently, threatening RSA, finite-field Diffie–Hellman, elliptic-curve Diffie–Hellman, ECDSA, and related schemes. If a cryptographically relevant quantum computer becomes available, an attacker could potentially recover private keys from public keys or derive shared secrets from intercepted exchanges. Digital signatures based on these assumptions would also become forgeable.

Grover’s algorithm searches an unstructured space in roughly the square root of the classical number of operations. Its effect is less catastrophic. A 128-bit symmetric key may offer approximately 64 bits of quantum brute-force security under idealised assumptions. Increasing key sizes—for example, using AES-256 where appropriate—provides a practical response. Hash functions also require careful analysis: quantum search affects preimage resistance, while collision attacks have different bounds and implementation implications.

Quantum attacks are not the only reason to migrate. Classical cryptanalysis, implementation errors, weak random-number generation, poor key management, certificate misuse, side-channel leakage, and protocol design flaws may compromise systems before a quantum computer does. PQC must therefore be integrated into a broader risk-management programme rather than treated as a replacement algorithm exercise.

Important terms include:

• Cryptographically relevant quantum computer (CRQC): A fault-tolerant quantum system capable of breaking widely deployed public-key schemes.
• Post-quantum cryptography: Cryptography designed to resist attacks from classical and quantum computers.
• Quantum-safe cryptography: A broad practical term often used for post-quantum methods; it does not imply absolute or permanent security.
• Harvest now, decrypt later: Collection of encrypted information today for future decryption.
• Hybrid cryptography: Use of a classical and a post-quantum mechanism together, so that security depends on an appropriate combination of both.
• Crypto-agility: The organisational and technical ability to replace cryptographic algorithms, parameters, keys, and protocols with limited disruption.
• Cryptographic inventory: A maintained record of algorithms, keys, certificates, protocols, dependencies, data lifetimes, and system owners.

Families of Post-Quantum Algorithms

PQC is based on mathematical problems for which no efficient quantum attacks are currently known. No assumption is guaranteed forever; confidence comes from public analysis, reductions, parameter selection, implementation testing, and cryptanalytic scrutiny.

Lattice-based cryptography

Lattice-based schemes use problems involving points in high-dimensional geometric structures. The Learning With Errors (LWE) and Module-LWE problems add controlled noise to linear equations, making the underlying secret difficult to recover. Lattice methods support both key establishment and digital signatures. They are attractive because they offer efficient operations and relatively versatile constructions, although public keys, ciphertexts, or signatures may be larger than those of ECC. Implementations must address floating-point issues in some constructions, parameter validation, decryption failures, and side channels.

The standardised Kyber family, commonly associated with post-quantum key encapsulation, is designed to establish shared secrets. A key encapsulation mechanism (KEM) consists of key generation, encapsulation using a public key, and decapsulation using a private key. The resulting shared secret is then used with a symmetric authenticated-encryption scheme. Dilithium is a lattice-based signature family designed for authentication and integrity. Falcon offers smaller signatures in some settings but requires more delicate implementation, particularly around numerical operations. Standards and product names should always be checked against current guidance because specifications and approved profiles evolve.

Hash-based signatures

Hash-based signatures rely mainly on the security of cryptographic hash functions. They have a conservative security rationale and are well suited to highly controlled signing environments such as firmware roots of trust. Stateful schemes require strict management of a one-time signing state: reusing a state can destroy security. Stateless schemes avoid this operational requirement but generally produce larger signatures and may incur different performance costs. Hash-based signatures are therefore valuable, but their deployment requires disciplined key and state management.

Code-based cryptography

Code-based schemes derive security from decoding random error-correcting codes. They have been studied for decades and are considered important candidates for key establishment. Their principal operational disadvantage is often very large public keys, which can affect certificates, constrained devices, bandwidth, and storage. Their diversity is strategically useful because relying on one mathematical family creates concentration risk.

Multivariate, isogeny-based, and other approaches

Multivariate schemes use the difficulty of solving systems of nonlinear equations. Some candidates have suffered major cryptanalytic breaks, illustrating why standardisation requires extensive public review. Isogeny-based schemes once attracted attention because of small keys, but prominent constructions were seriously attacked. This history demonstrates that “post-quantum” is not a permanent security label. Algorithms must be monitored throughout their life cycle.

Symmetric primitives remain central in a PQC environment. Authenticated encryption, secure hashing, key derivation, and high-quality random generation continue to provide the operational foundation. A common design is a PQC KEM to establish a secret, followed by a well-tested symmetric authenticated-encryption algorithm. Hybrid exchanges may combine an elliptic-curve method with a PQC KEM during transition. A hybrid design should specify how the two secrets are combined, how failure is handled, and whether downgrade attacks are prevented; simply running two algorithms without secure composition is not sufficient.

From Algorithm Selection to Migration Engineering

A migration programme begins with governance rather than code. Senior leadership must establish ownership, risk tolerance, budget, procurement requirements, and deadlines based on data sensitivity and system life cycles. The security team should then build a cryptographic inventory. Discovery must include source code, libraries, operating systems, network appliances, certificates, hardware security modules, identity providers, cloud services, embedded firmware, third-party products, and machine-to-machine protocols. Unknown cryptography is a major migration risk.

A useful prioritisation model considers four factors: the confidentiality or integrity value of the protected asset; the required protection lifetime; exposure to adversarial collection or remote attack; and the replacement difficulty of the system. High-priority systems typically include long-lived secrets, public-key infrastructure, software-signing roots, industrial-control systems, national or institutional archives, and products that remain deployed for many years.

Migration should distinguish between cryptographic roles. Key establishment, digital signatures, certificate formats, code signing, identity federation, secure boot, database encryption, backup encryption, and archival protection may have different algorithm and performance requirements. A system that uses PQC for transport encryption but retains a vulnerable classical signing root has not achieved complete migration.

A practical process is:

1. Establish policy, ownership, risk criteria, and procurement rules.

2. Discover and classify cryptographic assets and dependencies.

3. Map data lifetimes and identify harvest-now-decrypt-later exposure.

4. Test candidate algorithms in representative networks and devices.

5. Deploy crypto-agile interfaces and version-negotiation controls.

6. Use hybrid mechanisms where interoperability and risk analysis justify them.

7. Rotate certificates, keys, software-signing credentials, and trust anchors in stages.

8. Validate performance, failure recovery, downgrade resistance, and side-channel protection.

9. Monitor standards, vulnerabilities, supplier roadmaps, and algorithm status.

10. Retire obsolete algorithms and update the inventory continuously.

Crypto-agility is an architectural property. Applications should call approved cryptographic services through well-defined interfaces instead of embedding algorithm-specific assumptions throughout business logic. Configuration should be authenticated, centrally governed, and protected against rollback. Protocols should support algorithm negotiation without allowing an attacker to force a weak option. Tests should cover message sizes, certificate-chain growth, fragmentation, latency, memory usage, energy consumption, and denial-of-service exposure.

Confidential Computing and Privacy-Enhancing Technologies

PQC protects information in transit and, depending on design, in storage. It does not automatically protect data while it is being processed in memory. Confidential computing addresses this gap through hardware-based trusted execution environments (TEEs), memory encryption, isolation, and remote attestation. A remote party can verify that a workload is running in an approved environment before releasing keys or data.

Confidential computing is useful for cloud analytics, multi-party collaborations, financial processing, and machine-learning workloads involving sensitive data. However, attestation chains, firmware, enclave interfaces, supply chains, side channels, denial of service, and privileged administrators remain relevant risks. A TEE should not be treated as an unquestionable security boundary. It should be combined with least privilege, input validation, secure logging, key separation, and independent monitoring.

Privacy-enhancing technologies (PETs) reduce the exposure of personal or commercially sensitive information while allowing useful computation. Important examples include:

• Differential privacy, which adds carefully calibrated statistical noise to limit the effect of any one individual on an output.
• Secure multiparty computation, which enables parties to calculate jointly without revealing their private inputs.
• Homomorphic encryption, which permits selected computations on encrypted data, although performance and supported operations remain constraints.
• Private set intersection, which allows parties to discover common records without exposing their entire sets.
• Tokenisation and pseudonymisation, which reduce direct identifiers but do not eliminate re-identification risk.

PQC and PETs address different problems. PQC protects cryptographic mechanisms against future computational attacks; PETs reduce data disclosure and inference. Combining them can provide defence in depth, but privacy mechanisms may introduce accuracy, latency, complexity, and governance trade-offs.

Sectoral Implications for Future Networks

Blockchain and distributed ledgers

Many blockchains depend on digital signatures to authorise transactions and on hash functions for linking blocks or supporting consensus. A quantum attacker who can derive a private key from a visible public key could forge transactions. Exposure varies by address format and by whether public keys are revealed before funds are moved. Hash-based protections are generally more resilient than public-key signatures, although Grover-related considerations affect security margins.

A quantum-resilient ledger requires migration of account and wallet signatures, transaction formats, validator identities, custody systems, and governance rules. Larger PQC signatures increase block size, propagation time, storage requirements, and validation cost. A ledger may support multiple signature types during transition, but this creates interoperability and replay risks. Governance must define emergency key rotation, invalidation of compromised credentials, and treatment of dormant assets.

5G and 6G

5G networks use extensive authentication, roaming, network slicing, software-defined functions, edge computing, and virtualised infrastructure. PQC affects subscriber authentication, device onboarding, service-based interfaces, certificates, management planes, and secure backhaul. Larger keys and messages can affect radio resources, latency, control-plane congestion, and battery-powered devices.

Future 6G environments are expected to integrate highly distributed sensing, AI-native control, non-terrestrial networks, and pervasive edge services. Security architecture should therefore separate trust domains, minimise exposed interfaces, and support rapid credential replacement. Quantum-resistant authentication must be considered alongside availability, safety, lawful access requirements, supply-chain assurance, and privacy of location and sensing data. Standardisation and interoperability are particularly important because telecommunications equipment has long replacement cycles.

IoT and operational technology

IoT devices often have limited memory, processing capacity, energy, and update capability. Some are deployed for decades in homes, healthcare, transport, utilities, and industrial environments. PQC may impose larger messages and computational costs, making device identity, secure boot, firmware signing, and gateway-mediated cryptography important design choices. A constrained sensor may use a trusted gateway for some operations, but this creates a high-value intermediary that requires strong isolation and availability.

Manufacturers should provide secure update mechanisms, protected key storage, rollback prevention, vulnerability disclosure processes, and documented cryptographic lifetimes. Operators should avoid deploying devices that cannot be updated or whose cryptographic implementation is undocumented. For safety-critical operational technology, migration must be tested without disrupting physical processes.

Autonomous network defence

Future networks will increasingly use machine learning to detect anomalies, prioritise alerts, adapt access policies, and coordinate responses. Autonomous defence can identify unusual certificate use, abnormal key-exchange patterns, unexpected protocol downgrades, or suspicious changes in encrypted traffic metadata. It can also assist with cryptographic inventory and migration prioritisation.

Automation must remain bounded by policy. Models may produce false positives, inherit biased data, be manipulated by adversarial examples, or make unsafe changes at machine speed. High-impact actions—such as revoking a hospital’s trust anchor or isolating a safety controller—should require explicit safeguards, staged execution, rollback, and human accountability. Explainability, audit logs, model integrity, and separation of detection from authorisation are essential.

Illustrative Case Study: A National Health Network Migration

Background

Consider a fictional national health service, MedNet, operating hospitals, laboratories, cloud applications, ambulance systems, medical IoT devices, and a public patient portal. Its environment includes TLS, VPNs, smart-card authentication, software signing, database encryption, and vendor-managed medical equipment. Patient records must remain confidential for many decades.

Situation and problem

A security review finds that MedNet has no complete cryptographic inventory. Several vendors cannot state which algorithms are embedded in diagnostic devices, and some certificates are valid for many years. Research traffic crosses public networks and may be collected by adversaries. The organisation initially proposes replacing RSA with a single PQC algorithm everywhere.

Analysis

The proposal is rejected because systems have different roles and constraints. Large certificate chains could increase handshake traffic between ambulances and regional data centres. Medical devices may lack update capacity. The software-signing root is more critical than ordinary web certificates, while archived records require protection for a longer period than routine sessions. A single algorithm would also create concentration and supply-chain risk.

Strategy and solution

MedNet establishes a cryptographic steering committee and assigns system owners. Automated scanning, supplier questionnaires, code analysis, and network telemetry create an initial inventory. Data is classified by confidentiality lifetime. The organisation first protects long-lived research and patient archives, then deploys hybrid key establishment for external services. It upgrades software-signing infrastructure using a carefully governed signature strategy and tests PQC certificate sizes with hospital networks.

A laboratory pilot measures CPU use, memory, handshake latency, packet fragmentation, and failure recovery. Medical devices that cannot support new algorithms receive compensating controls, segmented network placement, gateway protection, and accelerated replacement plans. The security architecture introduces an algorithm-independent cryptographic service, central policy, authenticated configuration, and downgrade monitoring. Procurement contracts require update support, vulnerability reporting, algorithm disclosure, and migration assistance.

Outcome

MedNet does not claim that every system is immediately quantum safe. Instead, it obtains visibility, protects the highest-value data first, and creates a repeatable process for algorithm replacement. Quarterly reviews update the inventory and test emerging standards. Incident-response plans include compromised trust anchors, emergency certificate rotation, and vendor algorithm failure.

Learning points

The case demonstrates that migration is a programme of risk reduction, not a one-time software patch. Inventory quality, data lifetime, supplier cooperation, testing, governance, and crypto-agility are as important as algorithm selection. Hybrid deployment may be useful, but only when composition and downgrade resistance are explicitly designed.

Risks, Limitations, and Governance Questions

PQC algorithms may have larger keys, signatures, and ciphertexts; they may require more computation, memory, bandwidth, or energy; and their implementations may expose new side channels or denial-of-service opportunities. A mathematically strong algorithm can still fail through nonce reuse, faulty randomness, buffer errors, invalid-parameter handling, or poor secret erasure. Decryption-failure behaviour deserves particular attention because attackers may exploit repeated failures as an oracle.

Interoperability is a significant challenge. Different vendors may implement different profiles or prematurely deploy drafts. Organisations should track authoritative standards, require conformance testing, and avoid confusing experimental support with stable production assurance. Algorithm transitions also raise supply-chain concerns: libraries, firmware, HSMs, cloud APIs, certificate authorities, and managed services must align.

Governance must address accountability, privacy, lawful access, records retention, export controls, and accessibility. Stronger encryption can protect vulnerable populations and essential services, but it may complicate investigations and cross-border operations. Privacy regulations generally require appropriate technical and organisational safeguards, data minimisation, purpose limitation, retention control, and breach response. PQC supports these objectives but does not replace them.

Ethically, organisations should prioritise systems whose compromise would harm patients, children, citizens, or critical infrastructure. They should communicate migration risks accurately, avoid unsupported claims of “unbreakable” security, and ensure that automated defence does not discriminate or make unreviewable decisions. Security investment should account for smaller suppliers and public-interest services that may lack specialised resources.

Best Practices for Professional Practice

A mature organisation should maintain a living cryptographic inventory; classify information by required protection lifetime; prefer standardised, publicly reviewed algorithms; separate cryptographic policy from application logic; protect roots of trust and signing keys; use hardware-backed protection where justified; test performance on real devices and networks; prevent downgrade and rollback; monitor algorithm and vulnerability status; require supplier transparency; rehearse emergency key rotation; and document residual risk.

Executives should treat PQC as a multi-year technology and governance programme. Architects should design replaceable interfaces and trust boundaries. Developers should use approved libraries rather than implementing primitives independently. Operations teams should monitor certificates, protocol negotiation, failures, and unusual cryptographic behaviour. Auditors should verify inventory completeness, control effectiveness, supplier claims, and evidence of testing.

Current Developments and Future Directions

The field is moving from algorithm competition toward standardisation, implementation hardening, product integration, and migration measurement. Research continues on alternative mathematical families, efficient constrained-device implementations, quantum-resistant hardware roots of trust, formal verification, and hybrid protocols. Cryptographic discovery tools are becoming more capable of scanning binaries, traffic, certificates, and cloud configurations.

Future secure networks will likely combine PQC with confidential computing, hardware-backed identity, PETs, zero-trust access control, software-defined infrastructure, and AI-assisted operations. The decisive capability will be adaptability: systems must be able to change cryptographic mechanisms without losing identity, availability, auditability, or trust. Organisations that postpone inventory and architectural preparation may face rushed, expensive, and unsafe transitions.

Chapter Summary

Quantum computing threatens RSA, Diffie–Hellman, ECC, and related signatures through Shor’s algorithm, while Grover’s algorithm reduces the effective security of symmetric keys. Post-quantum cryptography uses alternative assumptions, including lattices, hash functions, and error-correcting codes, to provide quantum-resistant key establishment and signatures. Algorithm selection must be accompanied by implementation assurance, hybrid composition, and downgrade protection.

The practical challenge is migration. Organisations need governance, cryptographic inventories, data-lifetime analysis, prioritisation, testing, crypto-agile architectures, supplier controls, and plans for certificate and key rotation. Confidential computing protects data during processing, while privacy-enhancing technologies reduce disclosure and inference. Blockchain, 5G/6G, IoT, and autonomous defence each introduce distinctive performance, safety, privacy, and governance concerns. Future secure networks will depend on continuous adaptability rather than a single permanent solution.

Key Terms

Post-quantum cryptography: Cryptography intended to resist classical and quantum attacks.

Shor’s algorithm: A quantum algorithm that threatens integer factorisation and discrete logarithms.

Grover’s algorithm: A quantum search algorithm that approximately halves the bit security of symmetric keys.

Cryptographically relevant quantum computer: A fault-tolerant quantum computer capable of breaking widely used public-key systems.

Harvest now, decrypt later: Collecting encrypted information for future quantum decryption.

Key encapsulation mechanism: A mechanism for establishing a shared secret using public-key techniques.

Crypto-agility: The ability to replace cryptographic mechanisms with limited disruption.

Hybrid cryptography: Combining classical and post-quantum mechanisms in one security design.

Lattice-based cryptography: Cryptography based on hard problems involving high-dimensional lattices.

Hash-based signature: A signature scheme whose security relies primarily on cryptographic hash functions.

Code-based cryptography: Cryptography based on the difficulty of decoding random error-correcting codes.

Confidential computing: Protection of data during processing through hardware-supported isolated execution.

Trusted execution environment: An isolated execution area that protects code and data from broader system access.

Remote attestation: Evidence that a workload is running approved software in an approved environment.

Differential privacy: A method limiting the effect of one individual’s data on a published result.

Homomorphic encryption: Encryption supporting specified computations on ciphertexts.

Cryptographic inventory: A record of algorithms, keys, certificates, protocols, dependencies, and owners.

Downgrade attack: An attack that forces communication to use a weaker security option.

Software-signing key: A private key used to authenticate software or firmware releases.

Quantum-safe migration: The planned transition of systems toward resistance to quantum-enabled attacks.

Review Questions

Short Answer Questions

1. Why does Shor’s algorithm pose a greater direct threat to public-key cryptography than Grover’s algorithm?

2. What is meant by harvest now, decrypt later?

3. Define crypto-agility and explain why it is an architectural property.

4. Why are state-management controls important for stateful hash-based signatures?

5. Distinguish confidential computing from encryption of data in transit.

Long Answer Questions

1. Compare lattice-based, hash-based, and code-based post-quantum cryptography, including their principal applications and trade-offs.

2. Explain a complete organisational process for migrating from classical public-key cryptography to post-quantum systems.

3. Analyse the effects of PQC on 5G/6G networks and constrained IoT devices.

4. Discuss how confidential computing and privacy-enhancing technologies complement post-quantum cryptography.

5. Explain the governance, ethical, and supply-chain challenges of a national post-quantum migration.

Analytical / Application Questions

1. A hospital has long-lived patient records, legacy medical devices, and public cloud services. Develop a prioritised PQC migration plan and justify the order of activities.

2. A blockchain proposes adding larger post-quantum signatures without changing block limits or validator capacity. Analyse the likely consequences and recommend design alternatives.

3. An autonomous defence system detects a possible certificate downgrade and proposes immediate isolation of a national control network. Design safeguards that balance rapid response, safety, human accountability, and rollback.

22. Multiple Choice Questions with Answers

Question 1

Which cryptographic systems are most directly threatened by Shor’s algorithm?

A. RSA and elliptic-curve cryptography

B. AES and ChaCha20 only

C. Differential privacy mechanisms

D. Tokenisation systems

Correct Answer: A. RSA and elliptic-curve cryptography

Question 2

What is the principal purpose of a post-quantum key encapsulation mechanism?

A. To compress blockchain transactions

B. To establish a shared secret using quantum-resistant assumptions

C. To anonymise statistical datasets

D. To detect malware in memory

Correct Answer: B. To establish a shared secret using quantum-resistant assumptions

Question 3

Which migration activity should generally occur before selecting replacement algorithms across an organisation?

A. Disable all existing encryption

B. Publish private keys for interoperability testing

C. Create a cryptographic inventory and classify data lifetimes

D. Replace every network device simultaneously

Correct Answer: C. Create a cryptographic inventory and classify data lifetimes

Question 4

Why can a hybrid classical/PQC exchange be useful during migration?

A. It removes the need for authentication

B. It can provide transition interoperability while combining security assumptions

C. It guarantees security even when implementation is defective

D. It eliminates all bandwidth overhead

Correct Answer: B. It can provide transition interoperability while combining security assumptions

Question 5

Which is a distinctive operational risk of stateful hash-based signatures?

A. Public-key factorisation

B. Reuse of a signing state

C. Excessive quantum entanglement

D. Loss of differential privacy

Correct Answer: B. Reuse of a signing state

Question 6

A PQC deployment causes certificate chains to become substantially larger. Which impact is most plausible?

A. Reduced network traffic in every case

B. Higher handshake bandwidth and possible fragmentation

C. Automatic elimination of side channels

D. Removal of the need for key rotation

Correct Answer: B. Higher handshake bandwidth and possible fragmentation

Question 7

What does confidential computing primarily attempt to protect?

A. Data while it is being processed

B. Only data stored on paper

C. The mathematical definition of a hash function

D. Blockchain governance from all disputes

Correct Answer: A. Data while it is being processed

Question 8

Which statement best describes differential privacy?

A. It encrypts every computation with a public key

B. It limits how much an individual record changes an output

C. It replaces all digital signatures with hashes

D. It prevents every form of re-identification absolutely

Correct Answer: B. It limits how much an individual record changes an output

Question 9

Why are IoT devices a difficult target for PQC migration?

A. They never use identity or firmware updates

B. They often have constrained resources and long deployment lifetimes

C. They are unaffected by public-key cryptography

D. They can always be replaced immediately

Correct Answer: B. They often have constrained resources and long deployment lifetimes

Question 10

What is the principal governance concern with autonomous network defence?

A. It cannot process any telemetry

B. Automated actions may be unsafe, opaque, or manipulated

C. It makes cryptographic inventories unnecessary

D. It prevents all false positives by design

Correct Answer: B. Automated actions may be unsafe, opaque, or manipulated