The quantum threat is not a gradual erosion of security margins but what the authors describe as a structural break in cryptographic trust. Classical public-key systems, including the schemes protecting most internet traffic today, derive their security from mathematical problems such as integer factorization and discrete logarithms, which are assumed to be intractable for classical computers. Quantum computers, by exploiting superposition and entanglement, change the feasibility of solving exactly these problem classes in a qualitative rather than incremental way. Once sufficiently capable quantum machines exist, the guarantees underpinning widely deployed cryptosystems simply no longer hold. Symmetric cryptography fares somewhat better, but even its effective security levels must be re-evaluated under quantum-capable adversarial models, which is why researchers are now calling for quantum-safe approaches across the entire security stack, including federated learning systems.

Post-quantum cryptography, or PQC, is the field’s answer to this looming crisis. Unlike quantum cryptography, which relies on specialized physical hardware, PQC schemes are designed to run on conventional computers while resting on mathematical problems believed to remain hard even against quantum attackers. The review highlights that PQC research has produced several distinct families, each grounded in different mathematical foundations. Lattice-based schemes rest on the hardness of high-dimensional lattice approximation problems; code-based schemes on the difficulty of decoding random linear codes; hash-based schemes on preimage and collision resistance; and multivariate schemes on the hardness of solving systems of polynomial equations. Crucially, no single family yet commands universal confidence, which makes cryptographic agility—the ability to swap algorithms as knowledge evolves—a central design requirement rather than an afterthought.

A major milestone arrived in 2024, when the U.S. National Institute of Standards and Technology finalized its first post-quantum standards. ML-KEM, formerly known as CRYSTALS-Kyber, became the primary key encapsulation mechanism, while ML-DSA, formerly CRYSTALS-Dilithium, became the primary digital signature scheme. SLH-DSA, derived from SPHINCS+, offers a hash-based signature alternative built on deliberately conservative assumptions, and FN-DSA, formerly FALCON, was selected as a compact lattice-based signature option for bandwidth-constrained environments. These standards give engineers concrete primitives to build with, but they also introduce practical friction: larger keys, bigger signatures, and heavier computational overheads that ripple through every protocol they touch, including the AI monitoring pipelines that depend on timely data flows.

Meanwhile, the defensive side of the field has been undergoing its own revolution. Threat hunting has evolved from rule-based, signature-driven detection toward intelligence-driven, learning-based analysis. Traditional monitoring assumes malicious activity can be identified through predefined indicators drawn from historical observations—an assumption that collapses in the face of adaptive adversaries who deliberately evade static defenses. AI-driven threat hunting reframes security monitoring as a continuous inference process: models learn representations of normal operational behavior and flag deviations that may signal malicious intent, enabling the discovery of previously unseen threats. The review formalizes this as a decision process mapping observed system states to threat hypotheses, and notes that it can be instantiated through Bayesian networks for transparent probabilistic reasoning, LSTM and Transformer models for capturing temporal patterns in security logs, Isolation Forest and One-Class SVM for unsupervised anomaly detection when labeled data is scarce, and reinforcement learning for selecting defensive actions under uncertainty.

The core argument of the review is that these two pillars are structurally interdependent, yet have almost always been studied in isolation. Cryptographic strength alone cannot prevent misuse, misconfiguration, or insider-driven exploitation; even a perfectly quantum-proof cipher offers no visibility into how a system is being abused. Conversely, AI-driven threat hunting is only as trustworthy as the data it observes. If cryptographic protections are weakened or rendered obsolete, adversaries can manipulate observation channels, poison training data, or obscure malicious activity in ways that quietly corrupt the AI’s judgment. The authors also point to an emerging hybrid threat model in which adversaries combine quantum-enabled cryptanalysis with AI-assisted automation to accelerate reconnaissance and adapt attacks in real time—a scenario that defeats defenses built around single-dimensional assumptions.

To move from argument to architecture, the review proposes an integrated AI–PQC defense framework built on four tightly coupled layers. The cryptographic assurance layer, grounded in the NIST-standardized schemes, establishes a trusted substrate protecting communication channels, identities, and system states. Above it, an observation and feature abstraction layer transforms cryptographically protected events into behavioral and structural representations—key exchange patterns, protocol state transitions, message timing, and the frequency of cryptographic operations—that AI models can analyze without ever touching sensitive cryptographic material. The intelligent threat inference layer then applies probabilistic reasoning to estimate the most plausible threat hypothesis, and an adaptive response coordination layer selects defensive actions, from increased monitoring to cryptographic re-keying, by minimizing expected risk. A feedback loop closes the system, allowing cryptographic policies and AI threat models to co-evolve as conditions change.

The framework’s most demanding proving ground may be smart grid infrastructure, which the review examines in unusual depth. Grid communications rely on protocols such as IEC 61850 for substation automation, DNP3 for SCADA traffic, and GOOSE messaging for time-critical protection signaling—protocols designed with no quantum-resilient mechanisms in mind. ML-DSA signatures are substantially larger than their ECDSA equivalents, potentially exceeding DNP3 frame payload limits or colliding with GOOSE delivery windows measured in single-digit milliseconds. The threat model is equally severe: the harvest-now-decrypt-later strategy, in which adversaries stockpile encrypted grid telemetry today for decryption once quantum computers mature, is particularly acute for critical infrastructure. Attackers may also pursue false data injection against metering systems and disruption of relay coordination, requiring defenses that address both the cryptographic channel and behavioral anomaly layers simultaneously—precisely the integration the proposed framework is designed to deliver.

The authors are candid about the obstacles standing between concept and deployment. Scalability is a structural tension: lattice-based key encapsulation and signature verification impose overheads that compound across thousands of concurrent authentication events, while AI threat hunting demands continuous telemetry processing, and the combined latency can degrade detection timeliness exactly when responsiveness matters most. Explainability is another barrier with regulatory teeth—in finance, healthcare, and critical infrastructure, AI-generated alerts that trigger re-keying or access restrictions must be auditable, and post-hoc explanation methods such as SHAP and LIME remain largely unintegrated into real-time security operations. The review also flags the adversarial fragility of the AI components themselves, which can be poisoned, misled by injected telemetry, or probed through model inversion; the scarcity of representative quantum-era datasets; and the overlooked security risks of the multi-year migration period itself, when hybrid classical-PQC configurations must operate safely and adversaries may exploit transitional windows of reduced coverage.

Looking forward, the review outlines research directions that go beyond incremental improvement: AI-assisted optimization of cryptographic parameters and protocol adaptation, quantum-aware threat intelligence that accounts for quantum-enabled reconnaissance, autonomous cyber defense systems that balance autonomy with human oversight, and hybrid classical–quantum security architectures as quantum technologies mature. The authors’ synthesis of 84 studies—selected from an initial pool of 847 records screened across IEEE Xplore, Scopus, Web of Science, and the ACM Digital Library—reveals recurring patterns: most evaluations rely on synthetic or narrowly scoped data, few explicitly model adversarial robustness of the AI layer, and explainability remains a consistent gap. Their conclusion is blunt but constructive: the convergence of post-quantum cryptography and AI-driven threat hunting is not an incremental enhancement but a necessary evolution in cybersecurity design philosophy, one that demands interdisciplinary collaboration, careful trust and risk reasoning, and sustained attention to how cryptographic assurance and intelligent detection must grow together to survive the quantum era.

Subject of Research: Convergence of post-quantum cryptography and AI-driven threat hunting in quantum-resilient cybersecurity defense frameworks

Article Title: The convergence of post-quantum cryptography and AI-driven threat hunting: a review of quantum-resilient defense frameworks

Article References: Mohamed, N., & Taherdoost, H. (2026). The convergence of post-quantum cryptography and AI-driven threat hunting: a review of quantum-resilient defense frameworks. Frontiers in Communications and Networks, 7, Article 1816116. https://doi.org/10.3389/frcmn.2026.1816116

Image Credits: AI Generated

DOI: 10.3389/frcmn.2026.1816116

Keywords: post-quantum cryptography, quantum computing, AI threat hunting, cybersecurity, NIST standards, lattice-based cryptography, smart grid security, zero trust, threat intelligence, cryptographic agility, adversarial machine learning, quantum-resilient defense

The study, published in the journal Cluster Computing, introduces what the authors call EQR-MCPABE, short for an efficient and quantum-resistant multi-authority ciphertext-policy attribute-based encryption scheme. The work was carried out by Sravya Gudipati and R. Padmavathy of the National Institute of Technology Warangal, together with Syam Kumar Pasupuleti of the Quantum-Safe Cryptography Lab at the Institute for Development and Research in Banking Technology in Hyderabad. Gudipati and Pasupuleti contributed equally to the research.

Attribute-based encryption is a family of techniques that rethinks who holds the keys to a piece of data. Instead of encrypting a file for one specific recipient, the data owner encrypts it under a policy written in terms of attributes, such as department, clearance level, or role. Only users whose credentials satisfy the policy can decrypt the content. In the ciphertext-policy variant, the encryptor dictates the policy, which makes the approach a natural fit for fine-grained access control in cloud environments where files may be read by many different people over long periods.

Multi-authority versions of the scheme add another layer of practicality. Rather than relying on a single trusted authority to issue every key, a dangerous single point of failure, multiple independent authorities each manage their own set of attributes. A hospital might have one authority for medical roles and another for administrative clearances, and no single entity can reconstruct a user’s full secret key. This decentralization has made multi-authority ciphertext-policy attribute-based encryption, or MCP-ABE, one of the most promising building blocks for privacy-preserving cloud applications.

Yet nearly all of the classical MCP-ABE schemes rest on number-theoretic assumptions, problems such as factoring and computing discrete logarithms that Shor’s algorithm, running on a future quantum computer, is known to solve efficiently. That looming vulnerability has pushed cryptographers toward lattice-based constructions, whose security rests on problems like Learning with Errors that have resisted both classical and quantum attack strategies for nearly two decades. Lattice problems involve finding short vectors in high-dimensional geometric structures, and no known quantum algorithm breaks them.

Existing lattice-based MCP-ABE schemes, however, carry a heavy computational burden. Most are built on the Learning with Errors problem or its ring-based variant, Ring-LWE, and they rely on Gaussian sampling algorithms, procedures that draw random values from a bell-shaped distribution over a lattice. Gaussian sampling is notoriously expensive and delicate to implement correctly, and it has historically been a major source of inefficiency in lattice cryptography. On top of that, many of these schemes lack effective attribute revocation, the ability to cleanly remove a user’s access when attributes change, which is essential for any system handling dynamic organizations where people join, leave, and change roles constantly.

The new scheme sidesteps both problems. EQR-MCPABE is constructed from module lattices, a middle ground between general lattices and ideal lattices that offers a balance of security confidence and efficiency. Module lattices have gained prominence in post-quantum cryptography; the standardized key-encapsulation mechanism CRYSTALS-Kyber, selected by standards bodies for quantum-safe encryption, is itself built on module lattices. Crucially, the new construction avoids Gaussian sampling algorithms altogether, which the authors identify as the key to reducing computation cost while preserving resistance to quantum attacks.

Revocation is handled through a server-assisted mechanism. Instead of forcing every authority to reissue keys whenever an attribute must be revoked, the scheme delegates part of the revocation workload to the cloud server, allowing access to be cut off efficiently without imposing a heavy burden on users or authorities. The design achieves both forward and backward security, meaning that a revoked user cannot read data encrypted after the revocation, and cannot recover data encrypted before it either, closing the window that poorly designed revocation systems often leave open.

On the theoretical side, the authors prove that EQR-MCPABE is secure against chosen-plaintext attacks under the Module-LWE assumption, the module-lattice analogue of the Learning with Errors problem. Chosen-plaintext security is a standard formal guarantee: an adversary who can obtain encryptions of messages of their choosing still cannot extract information about other encrypted content. Grounding the proof in Module-LWE ties the scheme’s security to a well-studied lattice problem, aligning it with the assumptions underpinning the leading post-quantum standards.

Performance analysis presented in the paper shows that the scheme outperforms existing lattice-based MCP-ABE constructions, a result the researchers attribute largely to the elimination of Gaussian sampling and the efficiency of the module-lattice setting. As organizations worldwide begin the long migration to quantum-safe cryptography, work like this points toward access-control systems that can protect fine-grained, multi-authority cloud data not just against today’s attackers, but against the quantum machines of tomorrow, without the performance penalties that have kept earlier lattice-based designs out of practical deployment.

Subject of Research: A quantum-resistant multi-authority attribute-based encryption scheme for secure cloud storage

Article Title: Efficient and quantum-resistant multi-authority CP-ABE with attribute revocation for cloud Storage

Article References: Gudipati, S., Pasupuleti, S. K., & Padmavathy, R. (2026). Efficient and quantum-resistant multi-authority CP-ABE with attribute revocation for cloud Storage. Cluster Computing, 29(15), Article 849. https://doi.org/10.1007/s10586-026-06660-2

Image Credits: AI Generated

DOI: 10.1007/s10586-026-06660-2

Keywords: cryptography, post-quantum cryptography, lattice-based cryptography, cloud storage, attribute-based encryption, Module-LWE, attribute revocation, access control, multi-authority encryption, quantum computing, data security, Efficient

The work, carried out by Rachid Beghdad of the University of Béjaïa in Algeria, arrives at a moment of genuine urgency for the security community. The cryptographic machinery that currently protects most internet traffic, including the widely used RSA scheme, rests on mathematical problems that classical computers cannot solve in any practical timeframe. Quantum computers change that calculus. Peter Shor showed as early as 1994 that a sufficiently powerful quantum machine could factor large numbers and compute discrete logarithms efficiently, which means the public-key systems guarding today’s sessions could eventually be broken outright. Grover’s algorithm adds a second worry by quadratically speeding up brute-force searches, effectively halving the security margin of symmetric ciphers. Any framework designed to protect cloud services into the 2030s must therefore assume that quantum adversaries are coming.

Beghdad’s proposal, which he calls the Hybrid ECC-Quantum Cloud Security Framework, or HEQCSF, is built on a pragmatic division of labor. Elliptic-curve cryptography, first proposed by Victor Miller and Neal Koblitz in the mid-1980s, delivers security equivalent to RSA with dramatically smaller keys, which translates into faster handshakes, lower bandwidth, and reduced computational overhead. That efficiency makes ECC especially attractive for resource-constrained cloud environments where millions of connections must be authenticated quickly. The framework leans on the elliptic-curve digital signature algorithm for client authentication and on elliptic-curve Diffie-Hellman style key agreement, keeping the classical layer light and battle-tested.

The quantum half of the equation comes from two directions. The first is quantum key distribution, or QKD, a technique rooted in the pioneering work of Charles Bennett and Gilles Brassard in 1984 and later extended by Artur Ekert’s entanglement-based approach. QKD exploits the laws of quantum mechanics themselves: any eavesdropper who measures quantum states in transit unavoidably disturbs them, revealing the intrusion. The framework incorporates QKD to establish distributed quantum-secured communication channels between cloud nodes. The second direction is post-quantum cryptography, specifically lattice-based schemes that run on ordinary hardware but resist quantum attack. Here the framework adopts CRYSTALS-Kyber, the module-lattice key-encapsulation mechanism standardized by the US National Institute of Standards and Technology as FIPS 203, to provide quantum-resistant key establishment and confidentiality.

Under the hood, the lattice machinery is mathematically elegant. Kyber’s security rests on the module learning-with-errors problem, a variant of the learning-with-errors problem introduced by Oded Regev in 2005, which asks an attacker to solve noisy linear equations over polynomial rings, a task believed to be hard even for quantum computers. Keys are encapsulated rather than exchanged directly, and an HMAC-based key-derivation function then stretches the shared secret into session keys used with AES-GCM authenticated encryption. This hybrid design follows the pattern now being deployed commercially, including in TLS configurations tuned by major cloud providers, where a classical key exchange and a post-quantum one run in parallel so that security holds as long as either component remains unbroken.

What distinguishes HEQCSF from a purely cryptographic upgrade is its layered approach to the DDoS problem itself. The architecture combines real-time traffic anomaly detection with cryptographically authenticated session management, so that suspicious traffic can be identified and filtered before it exhausts server resources, while legitimate sessions are bound to strong cryptographic identities that attackers cannot easily forge. The design targets the full taxonomy of DDoS threats, from volumetric floods that saturate bandwidth, to protocol-based attacks that exploit weaknesses in connection handling, to application-layer attacks that mimic genuine requests. By tying authentication to efficient elliptic-curve signatures and channel establishment to quantum-resistant key encapsulation, the framework aims to make the cost of mounting an attack prohibitively high while keeping the overhead for honest users low.

The evidence for these claims comes from simulation rather than production hardware, a caveat the author states plainly. In simulated evaluations across a 10,000-node cloud environment subjected to traffic containing up to 30 percent malicious flows, the hybrid model showed significant improvements in resistance to volumetric, protocol-based, and application-layer DDoS attacks, while maintaining low latency and high throughput suitable for production cloud deployments. Those numbers are encouraging, but they describe a modeled environment, not a live data center, and real-world performance will depend on how the detection layer copes with adversarial traffic patterns that evolve to evade statistical profiling.

There is also an honest gap on the authentication side. Because client authentication in the current framework still relies on the classical elliptic-curve digital signature algorithm, it is not yet fully quantum-resistant; an adversary with a large-scale quantum computer could in principle forge ECDSA signatures. The paper identifies hybrid co-signatures combining ECDSA with CRYSTALS-Dilithium, the lattice-based signature scheme standardized as FIPS 204, as future work that would close this remaining exposure. The move would mirror the hybrid key-exchange strategy already used for confidentiality, extending quantum resistance across the entire protocol stack. Until then, HEQCSF should be understood as quantum-resistant in its key establishment and data confidentiality, with authentication still anchored in classical mathematics.

The broader context makes the timing of this research significant. Standards bodies have spent the past decade cataloguing the quantum threat, with NIST finalizing a first generation of post-quantum algorithms including Kyber, Dilithium, and the hash-based SPHINCS+, and more recently selecting HQC as an additional key-encapsulation candidate. Cloud providers have begun shipping hybrid post-quantum TLS, and researchers have explored quantum-secured cloud storage and QKD-linked architectures for the internet of things. Yet most of that work addresses confidentiality in isolation. Beghdad’s contribution is to place post-quantum cryptography inside a defensive architecture aimed specifically at DDoS, one of the oldest and most persistent attack classes in networking, and to argue that the two problems should be solved together rather than in separate silos.

Whether frameworks like HEQCSF will scale from simulation to the hyperscale clouds that carry much of the internet’s traffic remains an open question, and the transition will demand careful engineering, standardization, and years of operational hardening. But the direction of travel is clear. The quantum computers that could one day dismantle today’s public-key infrastructure are still maturing, yet adversaries are already harvesting encrypted traffic to decrypt later, and DDoS botnets grow more powerful every year. Hybrid designs that pair efficient classical cryptography with quantum-resistant primitives offer a way to defend the cloud on both fronts at once, buying security today without sacrificing it tomorrow. As the first line of cryptographic defense gets rebuilt for the quantum era, the humble DDoS attack may finally meet an adversary built from the very physics that threatens the rest of the internet’s armor.

Subject of Research: Hybrid elliptic-curve and post-quantum cryptographic defense of cloud computing against DDoS attacks

Article Title: Combining elliptic-curve cryptography and quantum-computing approach to secure cloud computing against distributed denial-of-service attacks

Article References: Beghdad, R. (2026). Combining elliptic-curve cryptography and quantum-computing approach to secure cloud computing against distributed denial-of-service attacks. Quantum Information Processing, 25(10), Article 329. https://doi.org/10.1007/s11128-026-05344-5

Image Credits: AI Generated

DOI: 10.1007/s11128-026-05344-5

Keywords: cloud security, DDoS attacks, elliptic-curve cryptography, post-quantum cryptography, CRYSTALS-Kyber, quantum key distribution, hybrid cryptosystem, network security, lattice-based cryptography, ECDSA, quantum computing, TLS

Yet the mathematics underpinning these new standards remains locked behind graduate-level abstraction, and a team of researchers at the Universidad de La Laguna in Spain argues that this is a problem education must solve now. In a study published in the Journal of New Approaches in Educational Research, Édgar Pérez-Ramos, Candelaria Hernández-Goya, and Pino Caballero-Gil present an interactive GeoGebra-based activity designed to introduce high school students to the core ideas of lattice-based post-quantum cryptography. The work is notable not only for its subject matter but for its results: after a single session, students with no prior cryptography experience showed dramatic gains in both motivation and conceptual understanding, with some test scores improving by more than 40 percentage points.

The mathematical heart of the activity is the lattice, an object the researchers describe as a multidimensional infinite grid. In its simplest two-dimensional form, a lattice is the collection of all points reachable by adding and subtracting whole-number multiples of a finite set of vectors. This definition deliberately builds on concepts students already meet in secondary school: the dot product of two vectors, orthogonality, Euclidean distance, and the so-called taxi or Manhattan distance, which measures travel along a rectangular grid rather than a straight line. The dot product links the lattice-generating vectors to the cosine of the angle between them, creating a natural bridge to trigonometry, while the taxi distance gives students a tangible way to think about how lattice points relate to one another in space.

Why do these geometric ideas matter for security? Modern lattice-based schemes rest on computational problems that are believed to be intractable even for quantum computers, including the Shortest Vector Problem, the Closest Vector Problem, and the Module Learning With Errors Problem. Finding the shortest vector from a lattice point to an arbitrary target looks trivial in the flat Cartesian plane, but the real cryptographic schemes operate in dimensions up to 1024, with coefficients drawn modulo large prime numbers such as q = 3329 in CRYSTALS-Kyber. Crucially, the less orthogonal the vectors defining a lattice are, the harder the associated problem becomes. A student who can see this relationship in two dimensions has grasped the seed of an idea that protects encrypted communications at planetary scale.

The researchers chose GeoGebra, an open-source mathematics platform combining dynamic geometry, algebra, and data visualization, as the vehicle for the lesson. The publicly available activity, titled A Brief Introduction to Lattice Theory, lets students drag vectors on screen and watch the resulting lattice reshape itself in real time. They can verify that the only null lattice consists entirely of null vectors, discover that non-null vectors with infinite coefficients generate an infinite lattice, and explore what happens when generating vectors are perpendicular versus skewed. Short-answer and open-ended questions are woven throughout, pushing students beyond passive observation toward constructing their own lattices and articulating the rules that govern them.

The design is grounded in three established frameworks from mathematics education research. The Theory of Didactical Situations structures the session into action, formulation, validation, and institutionalization phases: students first manipulate vectors independently, then formulate hypotheses about how vector choices shape the lattice, test those conjectures through GeoGebra’s immediate feedback, and finally formalize their discoveries with the teacher using concepts like basis, orthogonality, and scalar products. APOS Theory describes the cognitive progression from concrete actions to internalized processes, reified objects, and integrated schemas, mapping how a lattice transforms from something students click on into a mathematical object with intrinsic properties. The Theory of Instrumental Genesis adds a dual perspective, treating GeoGebra both as a tool students learn to operate and as an artifact that actively reshapes their mathematical thinking.

One unconventional element is the use of ChatGPT to provide an accessible, natural-language definition of a lattice at the start of the session. The researchers are careful to frame this as a didactical support tool rather than a replacement for instruction: prompts are carefully designed, and outputs are systematically checked by teachers against established academic sources. The activity also connects the abstract material to the physical world through an aerial view of Barcelona, whose famously regular urban grid is overlaid with lattice points at street intersections. Students are challenged to navigate from point A to point B using only lattice points, discovering that there is no single straight-line solution but multiple valid routes, a vivid demonstration of the taxi distance and the non-unique structure of lattice problems.

To evaluate the activity, the team ran experiments with 102 secondary school students in Spain, spanning the final year of compulsory education and both years of the Baccalaureate program. The cohort was 43.14 percent female and 53.92 percent male, with specializations split across technology, natural sciences, social sciences, and arts. A baseline survey revealed that 94.12 percent of participants had no prior experience with cryptography, making the group an ideal test bed for whether digital tools can open access to advanced content. The study followed a pre-post design: a short pre-test, a 30-minute introductory lecture on post-quantum cryptography, roughly one hour with the GeoGebra activity, and then a post-test. Ethical approval was obtained from the university ethics committee, with informed consent from students and their legal guardians, and the dataset was made publicly available on Zenodo.

The statistical results were striking. Using paired two-sample Student’s t-tests at a significance level of 0.05, the researchers rejected both null hypotheses. Students’ self-assessed knowledge of post-quantum cryptography rose from a median of 1 to a median of 3 on a five-point scale, and reported interest increased significantly. Correct answers on the question of what post-quantum cryptography is based on jumped from 3.92 percent to 82.35 percent, while understanding of its mathematical foundations climbed from 23.53 percent to 82.35 percent. The gains extended to prerequisite mathematics: correct responses on the conceptual definition of vectors rose from 40.20 percent to 81.37 percent, vector addition from 32.35 percent to 81.37 percent, and scalar multiplication from 33.33 percent to 84.31 percent. Notably, the largest improvements appeared in questions addressed through dynamic visualization and direct manipulation, suggesting that hands-on exploration with immediate visual feedback consolidates learning more effectively than definitions and examples alone.

The timing of this work is significant beyond the classroom. Spain’s latest PISA results showed its lowest mathematics score since the assessment began, with students dropping eight points compared to the previous edition, creating what the researchers call an urgent need for innovative and useful mathematics materials. The activity aligns with Spain’s current education law, LOMLOE, and its evaluation criteria on selecting digital tools and forms of representation, as well as basic knowledge areas covering dynamic geometry software and computational thinking. It also echoes the Informatics for All Coalition’s vision of citizens as critical users and active creators of technology rather than mere consumers. Existing resources for learning lattice cryptography, such as CrypTool, SageMath materials, and IBM Quantum’s online course, target advanced learners and professionals, leaving a gap at earlier educational stages that this study directly addresses.

The researchers see the activity as a promising model for teacher training initiatives seeking to bring advanced topics into classrooms through technology, and they plan to extend it with more advanced content, including the determinant of a lattice’s fundamental parallelepiped and the Learning With Errors problem. Further workshops with students and teachers are planned to gather additional data and refine the approach, with an eye toward tailoring activities to individual differences in prior knowledge for more equitable outcomes. As the 2035 deadline for the post-quantum transition approaches, the study makes a compelling case that the mathematics protecting tomorrow’s secrets can, with the right interactive tools, be taught today in an ordinary high school classroom.

Subject of Research: Teaching lattice-based post-quantum cryptography to secondary school students through an interactive GeoGebra activity

Article Title: An interactive tool for teaching lattice-based post-quantum cryptography

Article References: Pérez-Ramos, É., Hernández-Goya, C., & Caballero-Gil, P. (2026). An interactive tool for teaching lattice-based post-quantum cryptography. Journal of New Approaches in Educational Research, 15(1), Article 18. https://doi.org/10.1007/s44322-026-00068-x

Image Credits: AI Generated

DOI: 10.1007/s44322-026-00068-x

Keywords: post-quantum cryptography, lattice-based cryptography, GeoGebra, mathematics education, quantum computing, NIST standards, secondary education, CRYSTALS-Kyber, interactive learning, vectors, taxi distance, digital security