Tech

Physics-based encryption aims to secure data in the quantum computing era

Share
Share
Our online world relies on encryption. What happens if it fails?
An example of “pushing” a Toffoli gate g past gates h 1 , h 2 , ⋯ , h p so as to annihilate g with its inverse g ~ (identical to g for a Toffoli gate), thereby reducing the circuit size by two gates. Typically, in a random circuit over n bitlines, a Toffoli gate can travel past O ( n ) gates with which it commutes before encountering either a gate with which it does not commute or, with probability O ( 1 / n 3 ) , its inverse. The process depicted leads to a compression of the circuit size by a factor ( 1 to 2 𝜉 / n 2 ) , where ξ is a constant of O ( 1 ) . Credit: Proceedings of the National Academy of Sciences (2025). DOI: 10.1073/pnas.2415913122

In our hyper-connected world, we rely on encrypted communications every day—to shop online, digitally sign documents, make bank transactions, check our steps on fitness trackers.

But today’s encryption, which transforms data into unreadable formats to keep our information secure, is under intense pressure. Cybercriminals are increasingly sophisticated, and our networks—woven with cloud services and third-party platforms—are more vulnerable than ever. JP Morgan reports it repels 45 billion hacking attempts a day.

The most significant threat is something called Y2Q or Q-Day: the date quantum computers will make most current encryption methods obsolete. To grasp the scale, a quantum computer could do in a day what the world’s current fastest supercomputer would need millennia to accomplish: break RSA-2048 encryption, an algorithm that’s the backbone of internet security. It’s not an overstatement to say that, without encryption, the entire security of our connected world would collapse, threatening the stability of society.

While Y2Q may be years away, there is also a growing need to boost the resilience of encryption. “Harvest now, decrypt later” attacks are escalating—a strategy where cybercriminals harvest encrypted data today with the intent of decrypting it later when quantum tools become available.

To address these challenges, a Boston University–led multidisciplinary research team is developing a physics-inspired approach to data security and privacy. Their method reimagines the very foundations of encryption tools and they say it promises to be more robust, scalable, and future-ready in the face of rapidly evolving cyber threats.

The team, which includes collaborators at Cornell University and the University of Central Florida, has just published a paper in the Proceedings of the National Academy of Sciences that illustrates some of the ideas driving its approach to cryptography.

“We’re in a new era of technology, where the frontiers of computational capability lie at the intersection of classical and quantum computing, AI, and data security,” says principal investigator Andrei Ruckenstein, a BU College of Arts & Sciences Distinguished Professor of Physics.

“The most urgent and complex challenges in these areas, such as safeguarding sensitive data or preparing for the quantum threat, cannot be solved by current encryption and security methods. What’s exciting about this work is that it introduces a true paradigm shift and provides new capabilities made possible only through diverse disciplines forging a fundamental change in thinking.”

Quantum computing taps into unusual properties of the very small—where particles can exist in multiple states simultaneously (quantum superposition) and stay connected over distance (entanglement), allowing a quantum computer to explore many possibilities at once, significantly speeding up certain computations.

“Our approach is expected to be inherently resistant to both classical and quantum attacks,” says Ruckenstein. “It would not only strengthen public confidence in AI systems, but also unlock new opportunities for data-powered, socially responsible innovation.”

Protecting data during use

Modern encryption methods, developed roughly 50 years ago, could not envision the computational demands of today—let alone those of the quantum era. Relying on hard-to-solve mathematical problems, these systems mostly only protect data in transit or at rest—leaving it exposed during use. That poses a problem for data-intensive applications like AI training models, which process vast amounts of data that is often private or confidential.

Current approaches typically require models to decrypt data during training, leaving it exposed, or employ privacy-preserving techniques that slow processing speeds, making them difficult to apply at scale.

The BU-led NSF project offers a new path forward. The proposed scheme, called Encrypted Operator Computing (EOC), merges physics, computer science, and mathematics to develop scalable methods for computing directly on encrypted data—long considered the “holy grail” of cryptography.

“The approach is an alternative to Fully Homomorphic Encryption (FHE), an elegant, state-of-the-art cryptographic tool, which has so far proven difficult to apply to large-scale practical problems,” says Ruckenstein.

The EOC allows users to manipulate and gain insights from confidential data without ever exposing the raw information to third parties. This level of security and privacy is essential for applications such as blockchain transactions, medical AI models, cloud services, and more.

“While our EOC method is designed to work on classical computers doing classical computations, the conceptual breakthrough behind it is quantum computation–inspired,” says Claudio Chamon, a CAS professor of physics.

“In addressing the real-world challenge of computation on encrypted data, we also encounter fundamental questions, such as how many distinct ways a given computation can be expressed for a fixed-length circuit. We relate these questions to thermodynamic concepts like ‘entropy,’ which describes how unpredictable or random a system is based on how many ways it can be arranged.”

How entropy applies to computation is the subject of the team’s paper.

“In our framework, computation is represented as a circuit of logical elements, or gates, encoding elementary operations and which, when applied sequentially to the input data, implement the desired computation,” says Ruckenstein, who coauthored the paper with Chamon, Ran Canetti, a CAS professor of computer science, and Eduardo R. Mucciolo, a professor of physics at the University of Central Florida.

“In the paper, we considered both the functionality and complexity of computational circuits—what the circuit is computing and how large a circuit is needed to implement that computation.”

The team’s physics-inspired approach treats complexity in computing as a thermodynamic quantity; thermodynamics relates to how things like heat and energy spread. The rules of thermodynamics govern how, for example, the heat diffuses in your morning coffee: as the heat spreads, the molecules become more distributed and disordered, their patterns more complex.

None of which stops you from enjoying your coffee—but good luck recovering the history of all those erratic molecules. The researchers suggest that, in a computer circuit, its gates can similarly be disordered to hide information.

The paper proposes a dynamic process to obfuscate, or “hide,” any circuit by rearranging gates, randomizing its structure without altering its function. The aim is to not only scramble information fast, but also do so thoroughly—essentially destroying all patterns, so that a program is impossible to reverse engineer. The team’s vision is to create a trustworthy environment where both the data and programs that use the data stay hidden.

“Program obfuscation is an extremely powerful and versatile concept for protecting data, its processing, and its various uses in multiple scenarios and over time,” says Canetti.

“However, it is notoriously hard to construct: to date, we have no general-purpose program obfuscation scheme that is even close to being practical. This exciting project has the potential to make program obfuscation a reality.”

Breaking boundaries through convergent research

The project aims to turn these cryptography concepts into practical tools. Together, the research team will develop the EOC framework into scalable, special-purpose hardware, merging physics-inspired insights about information with advanced cryptography and pure mathematics. The goal is to accelerate performance and make secure, privacy-preserving computing widely accessible for real-world use.

“By combining expertise from diverse areas, we can tackle problems from multiple angles at once—whether it’s understanding quantum behavior, designing new algorithms, or building better hardware,” says Mucciolo. “This synergy not only speeds things up, but also allows us to dive much deeper than any one discipline could alone. We’re uncovering connections that wouldn’t be visible without this kind of cross-disciplinary perspective.”

One of the team’s other contributors, Timothy Riley, a professor of mathematics at Cornell University, says the collaboration across disciplines is a “rare and precious opportunity” that is allowing the researchers “to understand each other’s languages, to learn from each other’s perspectives, and to share the models, problems, and abstractions that drive our work.”

Canetti, Chamon, and Ruckenstein were able to advance the work with the support of the Hariri Institute’s Quantum Convergence Focused Research Program, which facilitates convergent thinking and multidisciplinary collaborations across BU on crosscutting themes around quantum science and engineering. All three BU researchers are affiliated with the institute.

“The rise of digital infrastructure demands stronger security to protect our economy, privacy, and national interests,” says Yannis Paschalidis, a BU College of Engineering Distinguished Professor of Engineering, director of the Hariri Institute, and a member of the University’s Task Force on Convergent Research and Education.

“Solving these complex challenges requires breaking down silos. This work shows how convergent research can drive real-world impact and unlock entirely new technological frontiers.”

More information:
Claudio Chamon et al, Circuit complexity and functionality: A statistical thermodynamics perspective, Proceedings of the National Academy of Sciences (2025). DOI: 10.1073/pnas.2415913122

Provided by
Boston University


Citation:
Prepping for Q-Day: Physics-based encryption aims to secure data in the quantum computing era (2025, June 4)
retrieved 4 June 2025
from

This document is subject to copyright. Apart from any fair dealing for the purpose of private study or research, no
part may be reproduced without the written permission. The content is provided for information purposes only.

Share

Leave a comment

Leave a Reply

Your email address will not be published. Required fields are marked *

Related Articles
OpenAI says it disrupted at least 10 malicious AI campaigns already this year
Tech

OpenAI says it disrupted at least 10 malicious AI campaigns already this year

OpenAI says it has disrupted numerous malicious campaigns using ChatGPT These include...

Spotify fans just got another free in-flight upgrade, thanks to this Starlink and United Airlines collab
Tech

Spotify fans just got another free in-flight upgrade, thanks to this Starlink and United Airlines collab

Spotify and United Airlines have announced a new partnership that enhances in-flight...

Apple WWDC 2025: dates, timings, and everything we’re expecting from the big software show
Tech

Apple WWDC 2025: dates, timings, and everything we’re expecting from the big software show

It’s almost that time of year again: WWDC time. Apple’s Worldwide Developer...