Posts Tagged ‘computer security’
“Quantum computation is … nothing less than a distinctly new way of harnessing nature”*…
As the tools in the world around us change, the world– and we– change with them. The onslaught of AI is the change that seems to be grabbing most of our mindshare these days… and with reason. But there are, of course, other changes (in biotech, in materials science, et al.) that are also going to be hugely impactful.
Today, a look at the computing technology stalking up behind AI: quantum computing. As enthusiasts like David Deutsch (author of the quote above) argue, it can have tremendous benefits, perhaps especially in our ability to model (and thus better understand) our reality.
But quantum computing will, if/when it arrives, also present huge challenges to us as individuals and as societies– perhaps most prominently in its threat to the ways in which we protect our systems and our information: We’ve felt pretty safe for decades, secure in the knowledge that we could lose passwords to phising or hacks, but that it would take the “classical” computers we have 1 billion years to break today’s RSA-2048 encryption. A quantum computer could crack it in as little as a hundred seconds.
The technology has been “somewhere on the horizon” for 30 years… so not something that has seemed urgent to confront. But progress has accelerated; a recent Google paper reports on a programming and architectural breakthrough that greatly reduces the computing resources necessary to break classical cryptography… putting the prospect of “Q-Day” (the point at which quantum computers become powerful enough to break standard encryption methods (RSA, ECC), endangering global digital security) much closer, which would put everything from crypto-wallets to our e-banking accounts at risk.
Charlie Wood brings us up to speed…
Some 30 years ago, the mathematician Peter Shor took a niche physics project — the dream of building a computer based on the counterintuitive rules of quantum mechanics — and shook the world.
Shor worked out a way for quantum computers to swiftly solve a couple of math problems that classical computers could complete only after many billions of years. Those two math problems happened to be the ones that secured the then-emerging digital world. The trustworthiness of nearly every website, inbox, and bank account rests on the assumption that these two problems are impossible to solve. Shor’s algorithm proved that assumption wrong.
For 30 years, Shor’s algorithm has been a security threat in theory only. Physicists initially estimated that they would need a colossal quantum machine with billions of qubits — the elements used in quantum calculations — to run it. That estimate has come down drastically over the years, falling recently to a million qubits. But it has still always sat comfortably beyond the modest capabilities of existing quantum computers, which typically have just hundreds of qubits.
However, two different groups of researchers have just announced advances that notably reduce the gap between theoretical estimates and real machines. A star-studded team of quantum physicists at the California Institute of Technology went public with a design for a quantum computer that could break encryption with only tens of thousands of qubits and said that it had formed a company to build the machine. And researchers at Google announced that they had developed an implementation of Shor’s algorithm that is ten times as efficient as the best previous method.
Neither company has the hardware to break encryption today. But the results underscore what some quantum physicists had already come to suspect: that powerful quantum computers may be years away, rather than decades. “If you care about privacy or you have secrets, then you better start looking for alternatives,” said Nikolas Breuckmann, a mathematical physicist at the University of Bristol, who did not work on either of the papers.
While the new results may provide a jolt for the policymakers and corporations that guard our digital infrastructure, they also signal the rapid progress that physicists have made toward building machines that will let them more thoroughly explore the quantum world.
“We’re going to actually do this,” said Dolev Bluvstein, a Caltech physicist and CEO of the new company, Oratomic…
[Wood unpacks the history of the development of the technology and explores the challenges that remain; he concludes…]
… If any group succeeds at building a quantum computer that can realize Shor’s algorithm, it will mark the end an era — specifically, the “Noisy Intermediate Scale Quantum” era, as Preskill dubbed the pre-error-correction period in a 2018 paper. Each researcher has a vision for what to pursue first with a machine in the new “fault-tolerant” era.
[Robert] Huang said he would start by running Shor’s algorithm, just to prove that the device works. After that, he said he would try to use it to speed up machine learning — an application to be detailed in coming work.
Most of the architects building quantum computers, whether at Oratomic or other startups, are physicists at heart. They’re interested in physics, not cryptography. Specifically, they’re interested in all the things a computer fluent in the language of quantum mechanics could teach them about the quantum realm, such as what sort of materials might become superconductors even at warm temperatures. Preskill, for his part, would like to simulate the quantum nature of space-time.
The Caltech group knows it has years of work ahead before any of its dreams have a chance of coming true. But the researchers can’t wait to get started. “Pick a cooler life quest than building the world’s first quantum computer with your friends!” said a jubilant Bluvstein, reached by phone shortly before their paper went live, before rushing off to celebrate…
Eminently worth reading in full: “New Advances Bring the Era of Quantum Computers Closer Than Ever,” from @walkingthedot.bsky.social in @quantamagazine.bsky.social.
* David Deutsch, The Fabric of Reality
###
As we prepare, we might take a moment to appreciate just how vastly and deeply the legacy systems challenged by quantum computing run, recalling that on this date in 1959 Mary Hawes, a computer scientist for the Burroughs Corporation held a meeting of computers users, manufacturers, and academics at the University of Pennsylvania aimed at creating a common business oriented programming language. At the meeting, representative Grace Hopper suggested that they ask the Department of Defense to fund the effort to create such a language. Also attending was Charles Phillips who was director of the Data System Research Staff at the DoD and was excited by the possibility of a common language streamlining their operations. He agreed to sponsor the creation of such a language. This was the genesis of what would eventually become the COBOL language.
To this day COBOL is still the most common programming language used in business, finance, and administrative systems for companies and governments, primarily on mainframe systems, with around 200 billion lines of code still in production use… all of which are in question and/or at risk in a world of quantum computing.
“Troubles hurt the most when they prove self-inflicted”*…
Earlier this year, Georgia’s Secure, Accessible, and Fair Elections Commission held a public meeting at the state capitol to answer a pressing question: What should Georgia do to replace its aging, touchscreen voting machines, as well as other parts of its election system? In the preceding years, security vulnerabilities in the state’s election system had been repeatedly exposed: by Russian operatives, friendly hackers, and even a Georgia voter who, just days ahead of the 2018 midterms, revealed that anyone could go online and gain access to the state’s voter registration database.
Computer scientists and elections experts from around the country had weighed in during the seven months of the commission’s deliberations on the issue. They submitted letters and provided testimony, sharing the latest research and clarifying technical concepts tied to holding safe, reliable elections. Their contributions were underscored by commission member Wenke Lee, co-director of Georgia Tech’s Institute for Information Security and Privacy, and the group’s only computer scientist.
Despite this, the commission ultimately did not recommend measures backed by Lee and his colleagues at places like Stanford, Yale, Princeton, MIT, and Google — including the recommendation that the state return to a system of paper ballots filled out by hand, combined with what scientists call risk-limiting audits. Instead, the commission recommended buying a system that included another, more expensive touchscreen voting machine that prints a paper ballot. Months later, Lee was at a loss to explain: “I don’t understand why they still don’t understand,” he said.
With its decision, Georgia’s counties remain among the 33 percent of counties nationwide that use either machines with no paper trail or machines that print paper ballots, which are then scanned on separate machines. The vast majority of the rest of the counties use paper ballots filled out by hand, which are then scanned or counted by hand…
Georgia is one of many states that is adopting or considering voting technology that some experts say decreases security and election integrity: “Georgia’s New Election System Raises Old Computer Security Concerns.”
[Most of those voting systems run on Windows 7, a dated operating system that’s demonstrably vulnerable to hackers… and that reaches “end of life” in January.]
* Sophocles
###
As we wonder why, we might recall that it was on this date in 1946 that notices were tacked onto the doors of African-American churches in Fitzgerald, Georgia reading “The first n-gger who votes in Georgia will be a dead n-gger” [without the ellision].
Geek Humor…
Readers who have wondered about the utility of Quora can discover at least one example here…
- yo momma’s so mean, she has no standard deviation.
- A infectious disease walks into a bar. The bartender says “We don’t serve infectious diseases.” The infectious disease says “Well, you’re not a very good host.”
- A neutrino walks into a bar. The bartender says “We don’t serve neutrinos in this bar.” The neutrino says “Hey, I was just passing through.”
- A wife asks her husband, a software engineer: “Could you please go shopping for me and buy one carton of milk, and if they have eggs, get 6!” A short time later the husband comes back with 6 cartons of milk. The wife asks him, “Why the hell did you buy 6 cartons of milk?” He replied, “They had eggs.”
- The Higgs boson walks into a church. The priest says “We don’t allow Higgs boson in here. The Higgs boson says, “But without me how can you have mass?”
- Two men walk into a bar and the first one says, ” I would like some H20.” Then the second man says, “That sounds good I will have H20 too.” Then the second man died.
Many more at “What are some funny nerd jokes?”
###
As we titter technologically, we might recall that it was on this date in 1988 that the first “computer worm” was unleashed. The phrase was coined in in John Brunner’s 1975 novel, The Shockwave Rider; but the first worm was written and released thirteen years later by Robert Tappan Morris, a Cornell University computer science graduate student. Morris also has the distinction of being the first person tried and convicted under the 1986 federal Computer Fraud and Abuse Act.
You must be logged in to post a comment.